For a quantum ensemble $\cE_3 =\set{\Pa{p_i,\rho_i}}_{i=1}^3$, M. Fannes \emph{et al.} conjectured that the entropy of the correlation matrix of $\cE_3 =\set{\Pa{p_i,\rho_i})}_{i=1}^3$ is upper bound for the Holevo quantity $\chi\Pa{\cE_3}$ of quantum ensemble $\cE_3 =\set{\Pa{p_i,\rho_i}}_{i=1}^3$. In this paper, we prove the conjecture under a strictly constraint condition.
For a quantum ensemble \cE_3 =\set{\Pa{p_i,\rho_i}}_{i=1}^3, M. Fannes \emph{et al.} conjectured that the entropy of the correlation matrix of \cE_3 =\set{\Pa{p_i,\rho_i})}_{i=1}^3 is upper bound for the Holevo quantity χ\Pa\cE3 of quantum ensemble \cE_3 =\set{\Pa{p_i,\rho_i}}_{i=1}^3. In this paper, we prove the conjecture under a strictly constraint condition.
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.
We present a family of easily computable upper bounds for the Holevo (information) quantity of an ensemble of quantum states depending on a reference state (as a free parameter). These upper bounds are obtained by combining probabilistic and metric characteristics of the ensemble. We show that an appropriate choice of the reference state gives tight upper bounds for the Holevo quantity which in many cases improve the estimates existing in the literature. We also present an upper bound for the Holevo quantity of a generalized ensemble of quantum states with finite average energy depending on the metric divergence of an ensemble. In the case of a multi-mode quantum oscillator, this upper bound is tight for large energy. Upper bounds for the Holevo capacity of finite-dimensional quantum channels depending on metric characteristics of the channel output are obtained.
In this paper, two conjectures which were proposed in [Phys. Rev. A \textbf{82}, 052122(2010)] on the correlations in a bipartite state ρAB are studied. If the mutual information $I\Pa{\rho^{AB}}$ between two quantum systems A and B before any measurement is considered as the total amount of correlations in the state ρAB, then it can be separated into two parts: classical correlations and quantum correlations. The so-called classical correlations $C\Pa{\rho^{AB}}$ in the state ρAB, defined by the maximizing mutual information between two quantum systems A and B after von Neumann measurements on system B, we show that it is upper bounded by the von Neumann entropies of both subsystems A and B, this answered the conjecture on the classical correlation. If the quantum correlations $Q\Pa{\rho^{AB}}$ in the state ρAB is defined by $Q\Pa{\rho^{AB}}= I\Pa{\rho^{AB}} - C\Pa{\rho^{AB}}$, we show also that it is upper bounded by the von Neumann entropy of subsystem B. It is also obtained that $Q\Pa{\rho^{AB}}$ is upper bounded by the von Neumann entropy of subsystem A for a class of states.
Let $S(\rho)=-\Tr (\rho\log\rho)$ be the von Neumann entropy of an N-dimensional quantum state ρ and e2(ρ) the second elementary symmetric polynomial of the eigenvalues of ρ. We prove the inequality S(\rho) \;\le \; c(N) \; \sqrt{e_2(\rho)} where c(N)=log(N)N−12N. This generalizes an inequality given by Fuchs and Graaf~\cite{fuchsgraaf} for the case of one qubit, i.e., N=2. Equality is achieved if and only if ρ is either a pure or the maximally mixed state. This inequality delivers new bounds for quantities of interest in quantum information theory, such as upper bounds for the minimum output entropy and the entanglement of formation as well as a lower bound for the Holevo channel capacity.
General probabilistic theories are designed to provide operationally the most general probabilistic models including both classical and quantum theories. In this paper, we introduce a systematic method to construct a series of entropies, all of which generalize Shannon entropy in classical systems and von Neumann entropy in quantum systems. Using these entropies, the Holevo bound, an upper bound of the accessible information from a quantum system, is generalized to hold in any general probabilistic theory.