RESUMEN
We address the problem of comparing quantum states with the same amount of coherence in terms of their coherence resource power given by the preorder of incoherent operations. For any coherence measure, two states with null or maximum value of coherence are equivalent with respect to that preorder. This is no longer true for intermediate values of coherence when pure states of quantum systems with dimension greater than two are considered. In particular, we show that, for any value of coherence (except the extreme values, zero and the maximum), there are infinite incomparable pure states with that value of coherence. These results are not peculiarities of a given coherence measure, but common properties of every well-behaved coherence measure. Furthermore, we show that for qubit mixed states there exist coherence measures, such as the relative entropy of coherence, that admit incomparable isocoherent states.
RESUMEN
In this paper we study how the coherence of a superposition of pure states is related with the coherence of its components. We consider two pure initial states and two pure final coherent states, such that the former ones cannot be transformed into the latter ones by means of incoherent transformations. In this situation, we analyze conditions for the existence of superpositions of the initial states that can be transformed into superpositions of the final states. In particular, we consider superpositions formed by quantum states belonging to orthogonal subspaces. By appealing to the majorization theory, we obtain necessary and sufficient conditions for such transformations to be possible. Finally, we provide some examples that illustrate the difference between the obtained conditions and the necessary criterion based on the relative entropy of coherence.
RESUMEN
The VII Conference on Quantum Foundations: 90 years of uncertainty (https://sites [...].
RESUMEN
The transformation of an initial bipartite pure state into a target one by means of local operations and classical communication and entangled-assisted by a catalyst defines a partial order between probability vectors. This partial order, so-called trumping majorization, is based on tensor products and the majorization relation. Here, we aim to study order properties of trumping majorization. We show that the trumping majorization partial order is indeed a lattice for four dimensional probability vectors and two dimensional catalysts. In addition, we show that the subadditivity and supermodularity of the Shannon entropy on the majorization lattice are inherited by the trumping majorization lattice. Finally, we provide a suitable definition of distance for four dimensional probability vectors.
RESUMEN
Based on the problem of quantum data compression in a lossless way, we present here an operational interpretation for the family of quantum Rényi entropies. In order to do this, we appeal to a very general quantum encoding scheme that satisfies a quantum version of the Kraft-McMillan inequality. Then, in the standard situation, where one is intended to minimize the usual average length of the quantum codewords, we recover the known results, namely that the von Neumann entropy of the source bounds the average length of the optimal codes. Otherwise, we show that by invoking an exponential average length, related to an exponential penalization over large codewords, the quantum Rényi entropies arise as the natural quantities relating the optimal encoding schemes with the source description, playing an analogous role to that of von Neumann entropy.