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

Monotonicity of Quantum Relative Entropy Revisited

Huzihiro Araki, Dénes Petz

Published Jan 1, 2002• 148 citations
OpenAlex

Abstract

Monotonicity under coarse-graining is a crucial property of the quantum relative entropy. The aim of this paper is to investigate the condition of equality in the monotonicity theorem and in its consequences as the strong sub-additivity of von Neumann entropy, the Golden-Thompson trace inequality and the monotonicity of the Holevo quantitity. The relation to quantum Markov states is briefly indicated.

Related papers

MONOTONICITY OF QUANTUM RELATIVE ENTROPY REVISITED

DÉNES PETZ

Monotonicity under coarse-graining is a crucial property of the quantum relative entropy. The aim of this paper is to investigate the condition of equality in the monotonicity theorem and in its consequences as the strong sub-additivity of von Neumann entropy, the Golden–Thompson trace inequality and the monotonicity of the Holevo quantitity. The relation to quantum Markov states is briefly indicated.

arXiv:quant-ph/0209053•Reviews in Mathematical Physics•Feb 26, 2003•164 citations

Inequalities for Quantum Entropy: A Review with Conditions for Equality

Mary Beth Ruskai

This paper presents self-contained proofs of the strong subadditivity inequality for quantum entropy 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 one of Lieb's less well-known concave trace functions, allows one to obtain conditions for equality. 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 paper concludes with an Appendix giving a short description of Epstein's elegant proof of the relevant concavity theorem of Lieb.

•May 13, 2002•159 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

Monotonicity of quantum relative entropy under nonlinear coarse graining

Jochen Rau

I show the monotonicity of quantum relative entropy under arbitrary coarse grainings, even nonlinear ones that cannot be represented by completely positive maps. The proof uses the quantum Stein lemma and properties of the Kawasaki-Gunton projector.

•Apr 26, 2010•0 citations

Quantum Entropy and Correlations in Quantum Information

Reinhold A. Bertlmann, Nicolai Friis

Abstract Chapter 20 provides a discussion of entropies and entropic quantities in quantum information theory, briefly considering the generalizations of the Rényi entropy to the quantum regime, but mainly focusing on the von Neumann entropy and its properties such as concavity, the Araki-Lieb inequality, and subadditivity. We introduce the quantum relative entropy, quantum joint entropy, quantum conditional entropy, and quantum mutual information, and prove key properties and results for these quantities, including Klein’s inequality, joint convexity, additivity, and monotonicity under completely positive and trace-preserving maps of the relative entropy, as well as weak monotonicity and strong subadditivity of the von Neumann entropy. We then analyse the relation of (negative) conditional entropy and entanglement. In this context we discuss the conditional amplitude operator and the mutual amplitude operator, as well as conditional Rényi entropies and their role for entanglement detection.

•Sep 7, 2023•0 citations

Monotonicity of quantum relative entropy and recoverability

Mario Berta, Marius Lemm, Mark M. Wilde

The relative entropy is a principal measure of distinguishability in quantum information theory, with its most important property being that it is non-increasing with respect to noisy quantum operations. Here, we establish a remainder term for this inequality that quantifies how well one can recover from a loss of information by employing a rotated Petz recovery map. The main approach for proving this refinement is to combine the methods of [Fawzi and Renner, 2014] with the notion of a relative typical subspace from [Bjelakovic and Siegmund-Schultze, 2003]. Our paper constitutes partial progress towards a remainder term which features just the Petz recovery map (not a rotated Petz map), a conjecture which would have many consequences in quantum information theory. A well known result states that the monotonicity of relative entropy with respect to quantum operations is equivalent to each of the following inequalities: strong subadditivity of entropy, concavity of conditional entropy, joint convexity of relative entropy, and monotonicity of relative entropy with respect to partial trace. We show that this equivalence holds true for refinements of all these inequalities in terms of the Petz recovery map. So either all of these refinements are true or all are false.

Quantum Information and Computation•Nov 1, 2015•21 citations
Monotonicity under coarse-graining is a crucial property of the quantum relative entropy. The aim of this paper is to investigate the condition of equality in the monotonicity theorem and in its consequences as the strong sub-additivity of von Neumann entropy, the Golden-Thompson trace inequality and the monotonicity of the Holevo quantitity. The relation to quantum Markov states is briefly indicated.
This paper presents self-contained proofs of the strong subadditivity inequality for quantum entropy 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 one of Lieb's less well-known concave trace functions, allows one to obtain conditions for equality. 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 paper concludes with an Appendix giving a short description of Epstein's elegant proof of the relevant concavity theorem of Lieb.
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.
Abstract Chapter 20 provides a discussion of entropies and entropic quantities in quantum information theory, briefly considering the generalizations of the Rényi entropy to the quantum regime, but mainly focusing on the von Neumann entropy and its properties such as concavity, the Araki-Lieb inequality, and subadditivity. We introduce the quantum relative entropy, quantum joint entropy, quantum conditional entropy, and quantum mutual information, and prove key properties and results for these quantities, including Klein’s inequality, joint convexity, additivity, and monotonicity under completely positive and trace-preserving maps of the relative entropy, as well as weak monotonicity and strong subadditivity of the von Neumann entropy. We then analyse the relation of (negative) conditional entropy and entanglement. In this context we discuss the conditional amplitude operator and the mutual amplitude operator, as well as conditional Rényi entropies and their role for entanglement detection.
The relative entropy is a principal measure of distinguishability in quantum information theory, with its most important property being that it is non-increasing with respect to noisy quantum operations. Here, we establish a remainder term for this inequality that quantifies how well one can recover from a loss of information by employing a rotated Petz recovery map. The main approach for proving this refinement is to combine the methods of [Fawzi and Renner, 2014] with the notion of a relative typical subspace from [Bjelakovic and Siegmund-Schultze, 2003]. Our paper constitutes partial progress towards a remainder term which features just the Petz recovery map (not a rotated Petz map), a conjecture which would have many consequences in quantum information theory. A well known result states that the monotonicity of relative entropy with respect to quantum operations is equivalent to each of the following inequalities: strong subadditivity of entropy, concavity of conditional entropy, joint convexity of relative entropy, and monotonicity of relative entropy with respect to partial trace. We show that this equivalence holds true for refinements of all these inequalities in terms of the Petz recovery map. So either all of these refinements are true or all are false.