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:1209.5545 · Communications in Theoretical Physics

The Saturation of Several Universal Inequalities in Information-Processing*

Lin 林 Zhang 张, Jun-De 俊德 Wu 武, Shao-Ming 少明 Fei 费

Published Apr 1, 2015• 1 citation
arXivHTMLPDF

Abstract

Abstract In this paper, we characterize the saturation of four universal inequalities in quantum information theory, including a variant version of strong subadditivity inequality for von Neumann entropy, the coherent information inequality, the Holevo quantity, and average entropy inequalities. These results shed new light on quantum information inequalities.

DOI
10.1088/0253-6102/63/4/427

Related papers

The Saturation of Several Universal Inequalities in Information-Processing

Lin Zhang, 武俊德, 费少明

Abstract In this paper, we characterize the saturation of four universal inequalities in quantum information theory, including a variant version of strong subadditivity inequality for von Neumann entropy, the coherent information inequality, the Holevo quantity, and average entropy inequalities. These results shed new light on quantum information inequalities.

理论物理通讯：英文版•Jan 1, 2015•1 citation

The Saturation of Several Universal Inequalities in Information-Processing

Zhang Li

In this paper, we characterize the saturation of four universal inequalities in quantum information theory, including a variant version of strong subadditivity inequality for von Neumann entropy, the coherent information inequality, the Holevo quantity, and average entropy inequalities. These results shed new light on quantum information inequalities.

理论物理通讯：英文版•Jan 1, 2015•0 citations

Structure of states saturating an another version of strong subadditivity

Lin Zhang

Strong subadditivity inequality of quantum entropy, proved by Lieb and Ruskai, is a powerful tool in quantum information theory. The fact that the strong subadditivity inequality saturated only by a so-called Markov states is obtained in the recent literature [P. Hayden et al., Commun. Math. Phys. 246, 359 (2004).]. In this report, we will give a characterization to an another equivalent version of strong subadditivity inequality. The possible applications are discussed.

•Sep 25, 2012•0 citations

A simple proof of the strong subadditivity inequality

A NielsenMichael, PetzDénes

Arguably the deepest fact known about the von Neumann entropy, the strong subadditivity inequality is a potent hammer in the quantum information theorist's toolkit. This short tutorial describes a ...

Quantum Information and Computation•Sep 1, 2005•1 citation

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

Infinitely Many Constrained Inequalities for the von Neumann Entropy

Josh Cadney, Noah Linden, Andreas Winter

We exhibit infinitely many new, constrained inequalities for the von Neumann entropy, and show that they are independent of each other and the known inequalities obeyed by the von Neumann entropy (basically strong subadditivity). The new inequalities were proved originally by Makarychevfor the Shannon entropy, using properties of probability distributions. Our approach extends the proof of the inequalities to the quantum domain, and includes their independence for the quantum and also the classical cases.

arXiv:1107.0624•IEEE Transactions on Information Theory•Jan 18, 2012•41 citations
Abstract In this paper, we characterize the saturation of four universal inequalities in quantum information theory, including a variant version of strong subadditivity inequality for von Neumann entropy, the coherent information inequality, the Holevo quantity, and average entropy inequalities. These results shed new light on quantum information inequalities.
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.
We exhibit infinitely many new, constrained inequalities for the von Neumann entropy, and show that they are independent of each other and the known inequalities obeyed by the von Neumann entropy (basically strong subadditivity). The new inequalities were proved originally by Makarychevfor the Shannon entropy, using properties of probability distributions. Our approach extends the proof of the inequalities to the quantum domain, and includes their independence for the quantum and also the classical cases.