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

arXiv:0812.0906 · Quantum Information and Computation

An entropy inequality

Meik Hellmund, Armin Uhlmann

Published Jul 1, 2009• 2 citations
arXivHTMLPDF

Abstract

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.

DOI
10.26421/qic9.7-8-5

Related papers

Log-Sobolev inequality, von Neumann entropy and Entanglement of Formation

A. S. Holevo, M. E. Shirokov

We present two results derived from the sharp log-Sobolev inequality for the uniform measure on a complete graph which concern the von Neumann entropy and the Entanglement of Formation of a state of finite and infinite-dimensional quantum systems. The first result is a sharp Lipschitz lower semicontinuity bound for the von Neumann entropy at any mixed state $ρ$ with uniform positive spectrum (i.e. a state proportional to a projector) w.r.t. the fidelity deficit: the inequality $\,S(ρ)-S(σ)\leq C_ρ(1-F(ρ,σ))\,$ valid for any state $σ$, where $C_ρ$ is a constant depending on the rank of $ρ$. The second result is a sharp Lipschitz lower semicontinuity bound for the Entanglement of Formation at any pure state $ρ$ with uniform positive spectrum of marginal states w.r.t. the fidelity deficit: the inequality $\,E_F(ρ)-E_F(σ)\leq C_ρ(1-\mathrm{Tr}ρσ)\,$ valid for any state $σ$, where $C_ρ$ is a constant depending on the Schmidt rank of $ρ$. In both cases the optimal constant $C_ρ$ is equal to the optimal constant $K_{d}$ in the log-Sobolev inequality for the complete graph with $d$ vertices: in the first case $d=\mathrm{rank}ρ$, in the second one $d=\mathrm{rank}ρ_A=\mathrm{rank}ρ_B$. The authors are grateful to GPT 5.6 for valuable discussion and technical help in preparing this note.

quant-pharXiv:2609.12667•Sep 14, 2026•0 citations

Inequalities for quantum entropy: A review with conditions for equality

Mary Beth Ruskai

This article presents self-contained proofs of the strong subadditivity inequality for von Neumann’s quantum entropy, S(ρ), and some related inequalities for the quantum relative entropy, most notably its convexity and its monotonicity under stochastic maps. Moreover, the approach presented here, which is based on Klein’s inequality and Lieb’s theorem that the function A→Tr eK+log A is concave, allows one to obtain conditions for equality. In the case of strong subadditivity, which states that S(ρ123)+S(ρ2)⩽S(ρ12)+S(ρ23) where the subscripts denote subsystems of a composite system, equality holds if and only if log ρ123=log ρ12−log ρ2+log ρ23. Using the fact that the Holevo bound on the accessible information in a quantum ensemble can be obtained as a consequence of the monotonicity of relative entropy, we show that equality can be attained for that bound only when the states in the ensemble commute. The article concludes with an Appendix giving a short description of Epstein’s elegant proof of Lieb’s theorem.

arXiv:quant-ph/0205064•Journal of Mathematical Physics•Sep 1, 2002•185 citations

Additive Bounds of Minimum Output Entropies for Unital Channels and an Exact Qubit Formula

Motohisa Fukuda, Gilad Gour

We find an upper bound for the minimum output entropy of a unital quantum channel, and obtain an exact formula for general qubit channels. Our techniques incorporate the Rényi entropies, particularly, with Rényi parameter α = 2. Moreover, since our upper bound is additive under tensor product, we get as a corollary an upper bound for the classical capacity of unital quantum channels. Interestingly, our upper bound for the classical capacity depends only on the operator norm of matrix representations of channels on the space of traceless Hermitian operators, and is tight in the sense that it gives the precise quantity of classical capacity of the Werner-Holevo channel. As an example, we study quantum channels with operator sum representation that is made of the discrete Weyl operators (generalized Pauli operators), and explain how our formula works in this case. Finally, we find new examples for which the minimum output Rényi 2-entropy is additive.

arXiv:1502.06411•IEEE Transactions on Information Theory•Dec 19, 2016•5 citations

On a Quantum Version of Shannon's Conditional Entropy

R. Schrader

In this article we propose a quantum version of Shannon's conditional entropy. Given two density matrices ρ and σ on a finite dimensional Hilbert space and with S(ρ) = —Tr ρ ln ρ being the usual von Neumann entropy, this quantity S(ρ | σ) is concave in ρ and satisfies 0 ≤ S(ρ | σ) ≤ S(ρ), a quantum analogue of Shannon's famous inequality. Thus we view S(ρ | σ) as the entropy of ρ conditioned by σ. The second inequality is an equality if σ is a multiple of the identity. In contrast to the classical case, however, S(ρ | ρ) = 0 if and only if the non-vanishing eigenvalues of ρ are all non-degenerate. Also in general and again in contrast to the corresponding classical situation S(ρ, σ) = S(σ) + S(ρ | σ) is not symmetric in ρ and σ even if they commute. We also show that there is no quantum version of conditional entropy in terms of two density matrices, which shares more properties with the classical case and which in particular reduces to the classical case when the two density matrices commute. As an alternative we propose to use spectral resolutions of the unit matrix instead of density matrices. We briefly compare this with the algebraic approach of Connes and Størmer and Connes, Narnhofer and Thirring.

arXiv:quant-ph/0003048•Fortschritte der Physik•Aug 1, 2000•2 citations

Sublinear quantum algorithms for estimating von Neumann entropy

Tom Gur, Min-Hsiu Hsieh, Sathyawageeswar Subramanian

Entropy is a fundamental property of both classical and quantum systems, spanning myriad theoretical and practical applications in physics and computer science. We study the problem of obtaining estimates to within a multiplicative factor $γ>1$ of the Shannon entropy of probability distributions and the von Neumann entropy of mixed quantum states. Our main results are: $\quad\bullet$ an $\widetilde{\mathcal{O}}\left( n^{\frac{1+η}{2γ^2}}\right)$-query quantum algorithm that outputs a $γ$-multiplicative approximation of the Shannon entropy $H(\mathbf{p})$ of a classical probability distribution $\mathbf{p} = (p_1,\ldots,p_n)$; $\quad\bullet$ an $\widetilde{\mathcal{O}}\left( n^{\frac12+\frac{1+η}{2γ^2}}\right)$-query quantum algorithm that outputs a $γ$-multiplicative approximation of the von Neumann entropy $S(ρ)$ of a density matrix $ρ\in\mathbb{C}^{n\times n}$. In both cases, the input is assumed to have entropy bounded away from zero by a quantity determined by the parameter $η>0$, since, as we prove, no polynomial query algorithm can multiplicatively approximate the entropy of distributions with arbitrarily low entropy. In addition, we provide $Ω\left(n^{\frac{1}{3γ^2}}\right)$ lower bounds on the query complexity of $γ$-multiplicative estimation of Shannon and von Neumann entropies. We work with the quantum purified query access model, which can handle both classical probability distributions and mixed quantum states, and is the most general input model considered in the literature.

arXiv:2111.11139•Nov 22, 2021•10 citations

Eigenvalue and Entropy Statistics for Products of Conjugate Random Quantum Channels

Benoı̂t Collins, Ion Nechita

Using the graphical calculus and integration techniques introduced by the authors, we study the statistical properties of outputs of products of random quantum channels for entangled inputs. In particular, we revisit and generalize models of relevance for the recent counterexamples to the minimum output entropy additivity problems. Our main result is a classification of regimes for which the von Neumann entropy is lower on average than the elementary bounds that can be obtained with linear algebra techniques.

arXiv:1006.3247•Entropy•Jun 23, 2010•11 citations
Let S(ρ)=−\Tr(ρlog⁡ρ)S(\rho)=-\Tr (\rho\log\rho)S(ρ)=−\Tr(ρlogρ) 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.
We present two results derived from the sharp log-Sobolev inequality for the uniform measure on a complete graph which concern the von Neumann entropy and the Entanglement of Formation of a state of finite and infinite-dimensional quantum systems. The first result is a sharp Lipschitz lower semicontinuity bound for the von Neumann entropy at any mixed state ρρρ with uniform positive spectrum (i.e. a state proportional to a projector) w.r.t. the fidelity deficit: the inequality  S(ρ)−S(σ)≤Cρ(1−F(ρ,σ)) \,S(ρ)-S(σ)\leq C_ρ(1-F(ρ,σ))\,S(ρ)−S(σ)≤Cρ​(1−F(ρ,σ)) valid for any state σσσ, where CρC_ρCρ​ is a constant depending on the rank of ρρρ. The second result is a sharp Lipschitz lower semicontinuity bound for the Entanglement of Formation at any pure state ρρρ with uniform positive spectrum of marginal states w.r.t. the fidelity deficit: the inequality  EF(ρ)−EF(σ)≤Cρ(1−Trρσ) \,E_F(ρ)-E_F(σ)\leq C_ρ(1-\mathrm{Tr}ρσ)\,EF​(ρ)−EF​(σ)≤Cρ​(1−Trρσ) valid for any state σσσ, where CρC_ρCρ​ is a constant depending on the Schmidt rank of ρρρ. In both cases the optimal constant CρC_ρCρ​ is equal to the optimal constant KdK_{d}Kd​ in the log-Sobolev inequality for the complete graph with ddd vertices: in the first case d=rankρd=\mathrm{rank}ρd=rankρ, in the second one d=rankρA=rankρBd=\mathrm{rank}ρ_A=\mathrm{rank}ρ_Bd=rankρA​=rankρB​. The authors are grateful to GPT 5.6 for valuable discussion and technical help in preparing this note.
This article presents self-contained proofs of the strong subadditivity inequality for von Neumann’s quantum entropy, S(ρ), and some related inequalities for the quantum relative entropy, most notably its convexity and its monotonicity under stochastic maps. Moreover, the approach presented here, which is based on Klein’s inequality and Lieb’s theorem that the function A→Tr eK+log A is concave, allows one to obtain conditions for equality. In the case of strong subadditivity, which states that S(ρ123)+S(ρ2)⩽S(ρ12)+S(ρ23) where the subscripts denote subsystems of a composite system, equality holds if and only if log ρ123=log ρ12−log ρ2+log ρ23. Using the fact that the Holevo bound on the accessible information in a quantum ensemble can be obtained as a consequence of the monotonicity of relative entropy, we show that equality can be attained for that bound only when the states in the ensemble commute. The article concludes with an Appendix giving a short description of Epstein’s elegant proof of Lieb’s theorem.
We find an upper bound for the minimum output entropy of a unital quantum channel, and obtain an exact formula for general qubit channels. Our techniques incorporate the Rényi entropies, particularly, with Rényi parameter α = 2. Moreover, since our upper bound is additive under tensor product, we get as a corollary an upper bound for the classical capacity of unital quantum channels. Interestingly, our upper bound for the classical capacity depends only on the operator norm of matrix representations of channels on the space of traceless Hermitian operators, and is tight in the sense that it gives the precise quantity of classical capacity of the Werner-Holevo channel. As an example, we study quantum channels with operator sum representation that is made of the discrete Weyl operators (generalized Pauli operators), and explain how our formula works in this case. Finally, we find new examples for which the minimum output Rényi 2-entropy is additive.
In this article we propose a quantum version of Shannon's conditional entropy. Given two density matrices ρ and σ on a finite dimensional Hilbert space and with S(ρ) = —Tr ρ ln ρ being the usual von Neumann entropy, this quantity S(ρ | σ) is concave in ρ and satisfies 0 ≤ S(ρ | σ) ≤ S(ρ), a quantum analogue of Shannon's famous inequality. Thus we view S(ρ | σ) as the entropy of ρ conditioned by σ. The second inequality is an equality if σ is a multiple of the identity. In contrast to the classical case, however, S(ρ | ρ) = 0 if and only if the non-vanishing eigenvalues of ρ are all non-degenerate. Also in general and again in contrast to the corresponding classical situation S(ρ, σ) = S(σ) + S(ρ | σ) is not symmetric in ρ and σ even if they commute. We also show that there is no quantum version of conditional entropy in terms of two density matrices, which shares more properties with the classical case and which in particular reduces to the classical case when the two density matrices commute. As an alternative we propose to use spectral resolutions of the unit matrix instead of density matrices. We briefly compare this with the algebraic approach of Connes and Størmer and Connes, Narnhofer and Thirring.
Entropy is a fundamental property of both classical and quantum systems, spanning myriad theoretical and practical applications in physics and computer science. We study the problem of obtaining estimates to within a multiplicative factor γ>1γ>1γ>1 of the Shannon entropy of probability distributions and the von Neumann entropy of mixed quantum states. Our main results are: ∙\quad\bullet∙ an O~(n1+η2γ2)\widetilde{\mathcal{O}}\left( n^{\frac{1+η}{2γ^2}}\right)O(n2γ21+η​)-query quantum algorithm that outputs a γγγ-multiplicative approximation of the Shannon entropy H(p)H(\mathbf{p})H(p) of a classical probability distribution p=(p1,…,pn)\mathbf{p} = (p_1,\ldots,p_n)p=(p1​,…,pn​); ∙\quad\bullet∙ an O~(n12+1+η2γ2)\widetilde{\mathcal{O}}\left( n^{\frac12+\frac{1+η}{2γ^2}}\right)O(n21​+2γ21+η​)-query quantum algorithm that outputs a γγγ-multiplicative approximation of the von Neumann entropy S(ρ)S(ρ)S(ρ) of a density matrix ρ∈Cn×nρ\in\mathbb{C}^{n\times n}ρ∈Cn×n. In both cases, the input is assumed to have entropy bounded away from zero by a quantity determined by the parameter η>0η>0η>0, since, as we prove, no polynomial query algorithm can multiplicatively approximate the entropy of distributions with arbitrarily low entropy. In addition, we provide Ω(n13γ2)Ω\left(n^{\frac{1}{3γ^2}}\right)Ω(n3γ21​) lower bounds on the query complexity of γγγ-multiplicative estimation of Shannon and von Neumann entropies. We work with the quantum purified query access model, which can handle both classical probability distributions and mixed quantum states, and is the most general input model considered in the literature.
Using the graphical calculus and integration techniques introduced by the authors, we study the statistical properties of outputs of products of random quantum channels for entangled inputs. In particular, we revisit and generalize models of relevance for the recent counterexamples to the minimum output entropy additivity problems. Our main result is a classification of regimes for which the von Neumann entropy is lower on average than the elementary bounds that can be obtained with linear algebra techniques.