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:1705.03521 · IEEE Transactions on Information Theory

Superadditivity of Quantum Relative Entropy for General States

Ángela Capel, Ángelo Lucia, David Pérez-García

Published Nov 13, 2017• 20 citations
arXivHTMLPDF

Abstract

The property of superadditivity of the quantum relative entropy states that, in a bipartite system HAB= HA⊗ HB, for every density operator ρAB, one has D(ρAB||σA⊗ σB)≥ D(ρA||σA) + D(ρB||σB). In this paper, we provide an extension of this inequality for arbitrary density operators σAB. More specifically, we prove that α(σAB)· D(ρAB||σAB)≥D(ρA||σA)+ D(ρB||σB) holds for all bipartite states ρABand σAB, where α(σAB) = 1 + 2||σA-1/2⊗ σABσA-1/2⊗ σB-1/2- ||AB||∞.

DOI
10.1109/tit.2017.2772800

Related papers

Weak super-additivity of relative entropy and weak sub-multiplicativity of fidelity: A numerical study

Lin Zhang, Hongjing He

A conjecture – weak super-additivity inequality of relative entropy – was proposed in [1]: There exist three unitary operators UA ∈ U (HA) , UB ∈ U (HB), and UAB ∈ U (HA ⊗HB) such that S(UABρABU†AB||σAB)> S(UAρAU†A||σA) + S(UBρBU†B||σB), where the reference state σ is required to be full-ranked. A numerical study on the conjec-tured inequality is conducted in this notes. The results obtained indicates that weak super-additivity inequality of relative entropy seems to hold for all qubit pairs. Similarly, the weak sub-multiplicativity of fidelity is also considered. That is, there exist three unitary operators UA ∈ U (HA) , UB ∈ U (HB), and UAB ∈ U (HA ⊗HB) such that F(UABρABU†AB, σAB) 6 F(UAρAU†A, σA)F(UBρBU†B, σB). An attempt is made to give some potential applications in quantum information theory. 1

•May 9, 2013•0 citations

A property of quantum relative entropy with an application to privacy in quantum communication

Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen

We prove the following information-theoretic property about quantum states. Substate theorem: Let ρ and σ be quantum states in the same Hilbert space with relative entropy S (ρ ‖ σ) ≔ Tr ρ (log ρ - log σ) = c . Then for all ϵ > 0, there is a state ρ′ such that the trace distance ‖ρ′ - ρ‖ tr : Tr √(ρ′ - ρ) 2 ≤ ϵ, and ρ′/2 O ( c /ϵ 2 ) ≤ σ. It states that if the relative entropy of ρ and σ is small, then there is a state ρ′ close to ρ, i.e. with small trace distance ‖ρ′ - ρ‖ tr , that when scaled down by a factor 2 O ( c ) ‘sits inside’, or becomes a ‘substate’ of, σ. This result has several applications in quantum communication complexity and cryptography. Using the substate theorem, we derive a privacy trade-off for the set membership problem in the two-party quantum communication model. Here Alice is given a subset A ⊆ [ n ], Bob an input i ∈ [ n ], and they need to determine if i ∈ A . Privacy trade-off for set membership: In any two-party quantum communication protocol for the set membership problem, if Bob reveals only k bits of information about his input, then Alice must reveal at least n /2 O( k ) bits of information about her input. We also discuss relationships between various information theoretic quantities that arise naturally in the context of the substate theorem.

arXiv:0705.2437•Journal of the ACM•Sep 1, 2009•56 citations

Superadditivity of the convex closure of the output entropy of a quantum channel

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

One of the main recent achievements of quantum information theory [1] is the proof of the equivalence of several (sub-, super-) additivity conjectures for finite-dimensional quantum channels and systems [2] (see the survey in [3]). The main purpose of this paper is to give a generalization of this result to the infinite-dimensional case. Let H and H ′ be separable Hilbert spaces. A quantum channel is a linear completely positive trace-preserving map Φ: T(H ) 7→ T(H ′), where T(H ) is the ideal of all trace class operators on H . In particular, Φ generates an affine map of the convex set S(H ) of states (that is, density operators) on the space H to the set S(H ′) of states on the space H ′ [1]. Important characteristics of a quantum channel are the output entropy HΦ(ρ) = H(Φ(ρ)), a lower-semicontinuous concave function on the input state space with values in [0,+∞], and its convex closure (see [4]), denoted by b HΦ(ρ) and called the b H-function of the channel Φ. It was shown in [5] that the convex closure of the output entropy of an arbitrary quantum channel Φ is given by the expression b HΦ(ρ) = inf μ Z

Russian Mathematical Surveys•Dec 31, 2006•3 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•202 citations

Uhlmann’s Theorem for Relative Entropies

Giulia Mazzola, David Sutter, Renato Renner

Uhlmann’s theorem states that, for any two quantum states ρABand σA, there exists an extension σABof σAsuch that the fidelity between ρABand σABequals the fidelity between their reduced states ρAand σA. In this work, we generalize Uhlmann’s theorem to α-R´enyi relative entropies for α ∈ [1/2, ∞], a family of divergences that encompasses fidelity, relative entropy, and max-relative entropy corresponding to α = 1/2, α = 1, and α = ∞, respectively.

arXiv:2502.01749•IEEE Transactions on Information Theory•Jul 23, 2025•5 citations

Strong Superadditive Deficit of Coherence and Quantum Correlations Distribution*

Siyuan Liu, Feng-Lin Wu, Yao-Zhong Zhang +1 more

The definitions of strong superadditive deficit for relative entropy coherence and monogamy deficit of measurement-dependent global quantum discord are proposed. The equivalence between them is proved, which provides a useful criterion for the validity of the strong superadditive inequality of relative entropy coherence. In addition, the strong superadditive deficit of relative entropy coherence is proved to be greater than or equal to zero under the condition that bipartite measurement-dependent global quantum discord (GQD) does not increase under the discarding of subsystems. Using the Monte Carlo method, it is shown that both the strong superadditive inequality of relative entropy coherence and the monogamy inequality of measurement-dependent GQD are established under general circumstances. The bipartite measurement-dependent GQD does not increase under the discarding of subsystems. The multipartite situation is also discussed in detail.

Chinese Physics Letters•Aug 1, 2019•2 citations
The property of superadditivity of the quantum relative entropy states that, in a bipartite system HAB= HA⊗ HB, for every density operator ρAB, one has D(ρAB||σA⊗ σB)≥ D(ρA||σA) + D(ρB||σB). In this paper, we provide an extension of this inequality for arbitrary density operators σAB. More specifically, we prove that α(σAB)· D(ρAB||σAB)≥D(ρA||σA)+ D(ρB||σB) holds for all bipartite states ρABand σAB, where α(σAB) = 1 + 2||σA-1/2⊗ σABσA-1/2⊗ σB-1/2- ||AB||∞.
A conjecture – weak super-additivity inequality of relative entropy – was proposed in [1]: There exist three unitary operators UA ∈ U (HA) , UB ∈ U (HB), and UAB ∈ U (HA ⊗HB) such that S(UABρABU†AB||σAB)> S(UAρAU†A||σA) + S(UBρBU†B||σB), where the reference state σ is required to be full-ranked. A numerical study on the conjec-tured inequality is conducted in this notes. The results obtained indicates that weak super-additivity inequality of relative entropy seems to hold for all qubit pairs. Similarly, the weak sub-multiplicativity of fidelity is also considered. That is, there exist three unitary operators UA ∈ U (HA) , UB ∈ U (HB), and UAB ∈ U (HA ⊗HB) such that F(UABρABU†AB, σAB) 6 F(UAρAU†A, σA)F(UBρBU†B, σB). An attempt is made to give some potential applications in quantum information theory. 1
We prove the following information-theoretic property about quantum states. Substate theorem: Let ρ and σ be quantum states in the same Hilbert space with relative entropy S (ρ ‖ σ) ≔ Tr ρ (log ρ - log σ) = c . Then for all ϵ > 0, there is a state ρ′ such that the trace distance ‖ρ′ - ρ‖ tr : Tr √(ρ′ - ρ) 2 ≤ ϵ, and ρ′/2 O ( c /ϵ 2 ) ≤ σ. It states that if the relative entropy of ρ and σ is small, then there is a state ρ′ close to ρ, i.e. with small trace distance ‖ρ′ - ρ‖ tr , that when scaled down by a factor 2 O ( c ) ‘sits inside’, or becomes a ‘substate’ of, σ. This result has several applications in quantum communication complexity and cryptography. Using the substate theorem, we derive a privacy trade-off for the set membership problem in the two-party quantum communication model. Here Alice is given a subset A ⊆ [ n ], Bob an input i ∈ [ n ], and they need to determine if i ∈ A . Privacy trade-off for set membership: In any two-party quantum communication protocol for the set membership problem, if Bob reveals only k bits of information about his input, then Alice must reveal at least n /2 O( k ) bits of information about her input. We also discuss relationships between various information theoretic quantities that arise naturally in the context of the substate theorem.
One of the main recent achievements of quantum information theory [1] is the proof of the equivalence of several (sub-, super-) additivity conjectures for finite-dimensional quantum channels and systems [2] (see the survey in [3]). The main purpose of this paper is to give a generalization of this result to the infinite-dimensional case. Let H and H ′ be separable Hilbert spaces. A quantum channel is a linear completely positive trace-preserving map Φ: T(H ) 7→ T(H ′), where T(H ) is the ideal of all trace class operators on H . In particular, Φ generates an affine map of the convex set S(H ) of states (that is, density operators) on the space H to the set S(H ′) of states on the space H ′ [1]. Important characteristics of a quantum channel are the output entropy HΦ(ρ) = H(Φ(ρ)), a lower-semicontinuous concave function on the input state space with values in [0,+∞], and its convex closure (see [4]), denoted by b HΦ(ρ) and called the b H-function of the channel Φ. It was shown in [5] that the convex closure of the output entropy of an arbitrary quantum channel Φ is given by the expression b HΦ(ρ) = inf μ Z
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.
The definitions of strong superadditive deficit for relative entropy coherence and monogamy deficit of measurement-dependent global quantum discord are proposed. The equivalence between them is proved, which provides a useful criterion for the validity of the strong superadditive inequality of relative entropy coherence. In addition, the strong superadditive deficit of relative entropy coherence is proved to be greater than or equal to zero under the condition that bipartite measurement-dependent global quantum discord (GQD) does not increase under the discarding of subsystems. Using the Monte Carlo method, it is shown that both the strong superadditive inequality of relative entropy coherence and the monogamy inequality of measurement-dependent GQD are established under general circumstances. The bipartite measurement-dependent GQD does not increase under the discarding of subsystems. The multipartite situation is also discussed in detail.