Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Sharply Bounding the Holevo Quantity

Lin Zhang, Junde Wu, Shao-Ming Fei

Published Oct 27, 2011• 0 citations
OpenAlex

Abstract

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.

Related papers

Matrices of fidelities for ensembles of quantum states and the Holevo quantity

M. Fannes, Fernando de Melo, Wojciech Roga +1 more

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 $\chi$ of the ensemble. In this work we combine geometrical and probabilistic aspects of the ensemble in order to obtain meaningful bounds for $\chi$. 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 $\chi$. Slightly weaker bounds are established for arbitrary ensembles. Finally, we investigate correlation matrices involving multi-state correlations in relation to the Holevo quantity.

arXiv:1104.2271•Quantum Information and Computation•May 1, 2012•21 citations

Upper Bounds for the Holevo Information Quantity and Their Use

Максим Евгеньевич Широков

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.

arXiv:1703.05671•Problems of Information Transmission•Jul 1, 2019•4 citations

On a conjecture of the quantum correlations

Zhang Lin, Junde Wu

In this paper, two conjectures which were proposed in [Phys. Rev. A \textbf{82}, 052122(2010)] on the correlations in a bipartite state $\rho^{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 $\rho^{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 $\rho^{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 $\rho^{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.

•May 16, 2011•0 citations

An entropy inequality

Meik Hellmund, Armin Uhlmann

Let $S(\rho)=-\Tr (\rho\log\rho)$ be the von Neumann entropy of an $N$-dimensional quantum state $\rho$ and $e_2(\rho)$ the second elementary symmetric polynomial of the eigenvalues of $\rho$. We prove the inequality S(\rho) \;\le \; c(N) \; \sqrt{e_2(\rho)} where $c(N)=\log(N) \, \sqrt{\frac{2N}{N-1}}$. 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 $\rho$ 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.

arXiv:0812.0906•Quantum Information and Computation•Jul 1, 2009•4 citations

Ensemble-Dependent Bounds for Accessible Information in Quantum Mechanics

Christopher A. Fuchs, Carlton M. Caves

We simplify the derivation of the Holevo upper bound on the maximum information extractable from a quantum communication channel. This simplification leads to upper and lower bounds for binary channels, both of which depend explicitly on the message ensemble.

Physical Review Letters•Dec 5, 1994•93 citations

Entropies in general probabilistic theories and their application to the Holevo bound

Gen Kimura, Junji Ishiguro, Makoto Fukui

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.

arXiv:1604.08009•Physical Review A•Oct 17, 2016•12 citations
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\chi\Pa{\cE_3}χ\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 KKK mixed states yields an upper bound for the Holevo information χ\chiχ of the ensemble. In this work we combine geometrical and probabilistic aspects of the ensemble in order to obtain meaningful bounds for χ\chiχ. This is done by constructing various correlation matrices involving fidelities between every pair of states from the ensemble. For K=3K=3K=3 quantum states we design a matrix of root fidelities that is positive and the entropy of which is conjectured to upper bound χ\chiχ. 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\rho^{AB}ρAB are studied. If the mutual information $I\Pa{\rho^{AB}}$ between two quantum systems AAA and BBB before any measurement is considered as the total amount of correlations in the state ρAB\rho^{AB}ρ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\rho^{AB}ρAB, defined by the maximizing mutual information between two quantum systems AAA and BBB after von Neumann measurements on system BBB, we show that it is upper bounded by the von Neumann entropies of both subsystems AAA and BBB, this answered the conjecture on the classical correlation. If the quantum correlations $Q\Pa{\rho^{AB}}$ in the state ρAB\rho^{AB}ρ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 BBB. It is also obtained that $Q\Pa{\rho^{AB}}$ is upper bounded by the von Neumann entropy of subsystem AAA for a class of states.
Let $S(\rho)=-\Tr (\rho\log\rho)$ be the von Neumann entropy of an NNN-dimensional quantum state ρ\rhoρ and e2(ρ)e_2(\rho)e2​(ρ) the second elementary symmetric polynomial of the eigenvalues of ρ\rhoρ. We prove the inequality S(\rho) \;\le \; c(N) \; \sqrt{e_2(\rho)} where c(N)=log⁡(N) 2NN−1c(N)=\log(N) \, \sqrt{\frac{2N}{N-1}}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=2N=2N=2. Equality is achieved if and only if ρ\rhoρ 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.