Infinitely Many Constrained Inequalities for the von Neumann Entropy

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 Makarychev for 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.

[1]  D. Petz,et al.  Quantum Entropy and Its Use , 1993 .

[2]  A. Winter,et al.  A New Inequality for the von Neumann Entropy , 2004, quant-ph/0406162.

[3]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[4]  Zhen Zhang,et al.  On Characterization of Entropy Function via Information Inequalities , 1998, IEEE Trans. Inf. Theory.

[5]  T. H. Chan.  Balanced information inequalities , 2003, IEEE Trans. Inf. Theory.

[6]  A. Winter,et al.  Communications in Mathematical Physics Structure of States Which Satisfy Strong Subadditivity of Quantum Entropy with Equality , 2022 .

[7]  E. Lieb,et al.  Proof of the strong subadditivity of quantum‐mechanical entropy , 1973 .

[8]  Nicholas Pippenger,et al.  The inequalities of quantum information theory , 2003, IEEE Trans. Inf. Theory.

[9]  James G. Oxley,et al.  Matroid theory , 1992 .

[10]  Frantisek Matús,et al.  Infinitely Many Information Inequalities , 2007, 2007 IEEE International Symposium on Information Theory.

[11]  Nikolai K. Vereshchagin,et al.  A new class of non-Shannon-type inequalities for entropies , 2002, Commun. Inf. Syst..

[12]  Randall Dougherty,et al.  Six New Non-Shannon Information Inequalities , 2006, 2006 IEEE International Symposium on Information Theory.