Correlations between states in a general quantum ensemble can be encoded in a Gram matrix that depends on a prescribed joint purification. This allows to establish an upper bound for the Holevo quantity χ. Optimizing over joint purifications is a hard problem. For small ensembles the connection with matrices of fidelities is investigated. General bounds are obtained for a linearized version of χ.
Correlations between states in a general quantum ensemble can be encoded in a Gram matrix that depends on a prescribed joint purification. This allows to establish an upper bound for the Holevo quantity χ. Optimizing over joint purifications is a hard problem. For small ensembles the connection with matrices of fidelities is investigated. General bounds are obtained for a linearized version of χ.
The entropy of the Gram matrix of a joint purification of an ensemble of K mixed states yields an upper bound for the Holevo information χ of the ensemble. In this work we combine geometrical and probabilistic aspects of the ensemble in order to obtain meaningful bounds for χ. This is done by constructing various correlation matrices involving fidelities between every pair of states from the ensemble. For K=3 quantum states we design a matrix of root fidelities that is positive and the entropy of which is conjectured to upper bound χ. Slightly weaker bounds are established for arbitrary ensembles. Finally, we investigate correlation matrices involving multi-state correlations in relation to the Holevo quantity.
This paper is primarily concerned with the development and application of quantum bounds on mutual information, although some of the methods developed can be applied to any figure of merit indicating degree of correlation, such as coincidence rate. Three basic techniques for obtaining bounds are described: mappings between joint-measurement and communication correlation contexts; a duality relation for quantum ensembles and quantum measurements; and an information exclusion principle [M. J. W. Hall, Phys. Rev. Lett. 74, 3307 (1995)]. Results include a proof of Holevo's communication bound from a joint-measurement inequality; a measurement-dependent dual to Holevo's bound; lower bounds for mutual information under ensemble and measurement constraints; information exclusion relations for measurements described by probability-operator measures; a proof that Glauber coherent states are optimal signal states for quantum communication based on (noisy) optical heterodyne detection; and an information inequality for quantum eavesdropping. Relations between the three techniques are used to further obtain upper bounds for quantum information, and to extend the information exclusion principle to a joint-measurement context.
We explore ways to quantify multipartite correlations, in quantum information and in holography. We focus on optimized correlation measures, linear combinations of entropies minimized over all possible purifications of a state that satisfy monotonicity conditions. These contain far more information about correlations than entanglement entropy alone. We present a procedure to derive such quantities and construct a menagerie of symmetric optimized correlation measures on three parties. These include tripartite generalizations of the entanglement of purification, the squashed entanglement, and the recently introduced Q correlation and R correlation. Some correlation measures vanish only on product states and, thus, quantify both classical and quantum correlations; others vanish on any separable state, capturing quantum correlations alone. We then use a procedure motivated by the surface-state correspondence to construct holographic duals for the correlation measures as linear combinations of bulk surfaces. The geometry of the surfaces can preserve, partially break, or fully break the symmetry of the correlation measure. The optimal purification is encoded in the locations of certain points, whose locations are fixed by constraints on the areas of combinations of surfaces. This gives a new concrete connection between information theoretic quantities evaluated on a boundary state and detailed geometric properties of its dual.
The Gram matrix of a set of vectors, which encapsulates the relations between the constituent vectors, plays an important role in the exploration of both geometric and information-theoretic aspects of quantum state space. In view of its usefulness and importance, we study the Gram matrix of an ensemble of pure states (a set of pure states with a prior probability distribution) and reveal its fundamental properties. We highlight and exploit the fact that the Gram matrix of an ensemble can be formally regarded as a bona fide quantum state. The key idea is to employ coherence (with respect to the computational basis) of the Gram matrix (regarded as a quantum state) to quantify quantumness of the corresponding ensemble. In particular, we propose to use the l 1 -norm of coherence and the relative entropy of coherence, of the Gram matrix, as two significant quantifiers of quantumness. We illustrate the effectiveness and power of these quantifiers of quantumness by evaluating them for several important ensembles arising from quantum measurement and quantum cryptography. We further compare the quantumness based on the Gram matrix with various other quantifiers of quantumness in the literature, and show that although they are closely related in general, they have subtle differences and capture different aspects of ensembles, which shed light on the complexity of quantum ensembles.
This paper concerns the analysis of large quantum states. It is a notoriously difficult problem to quantify separability of quantum states, and for large quantum states, it is unfeasible. Here we posit that when quantum states are large, we can deduce reasonable expectations for the complex structure of non-classical multipartite correlations with surprisingly little information about the state. We show, with pegagogical examples, how known results from combinatorics can be used to reveal the expected structure of various correlations hidden in the ensemble described by a state.
The accessible information acc(E) of an ensemble E is the maximum mutual information between a random variable encoded into quantum states, and the probabilistic outcome of a quantum measurement of the encoding. Accessible information is extremely difficult to characterize analytically; even bounds on it are hard to place. The celebrated Holevo bound states that accessible information cannot exceed chi(E), the quantum mutual information between the random variable and its encoding. However, for general ensembles, the gap between the acc(E) and chi(E) may be arbitrarily large. We consider the special case of a binary random variable, which often serves as a stepping stone towards other results in information theory and communication complexity. We give explicit lower bounds on the the accessible information acc(E) of an ensemble E = {(p, rho_0), (1-p, rho_1)}, with 0 <= p <= 1, as functions of p and chi(E). The bounds are incomparable in the sense that they surpass each other in different parameter regimes. Our bounds arise by measuring the ensemble according to a complete orthogonal measurement that preserves the fidelity of the states rho_0,rho_1. As an intermediate step, therefore, we give new relations between the two quantities acc(E), chi(E) and the fidelity B(rho_0,rho_1).