On the quantum f-relative entropy and generalized data processing inequalities

We study the fundamental properties of the quantum f -relative entropy, where f(·) is an operator convex function. We give the equality conditions under various properties including monotonicity and joint convexity, and these conditions are more general than, since they hold for a class of operator convex functions, and different for f(t) = − ln(t) from, the previously known conditions. The quantum f -entropy is defined in terms of the quantum f -relative entropy and we study its properties giving the equality conditions in some cases. We then show that the f -generalizations of the Holevo information, the entanglement-assisted capacity, and the coherent information also satisfy the data processing inequality, and give the equality conditions for the f -coherent information.

[1]  G. Lindblad.  Completely positive maps and entropy inequalities , 1975 .

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

[3]  F. Hansen,et al.  Jensen's inequality for operators and Löwner's theorem , 1982 .

[4]  Schumacher,et al.  Quantum data processing and error correction. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[5]  M. Ruskai,et al.  A UNIFIED TREATMENT OF CONVEXITY OF RELATIVE ENTROPY AND RELATED TRACE FUNCTIONS, WITH CONDITIONS FOR EQUALITY , 2009, 0903.2895.

[6]  D. Petz.  Quasi-entropies for finite quantum systems , 1986 .

[7]  Schumacher,et al.  Quantum coding. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[8]  D. Petz.  Sufficient subalgebras and the relative entropy of states of a von Neumann algebra , 1986 .

[9]  Elliott H. Lieb,et al.  A Fundamental Property of Quantum-Mechanical Entropy , 1973 .

[10]  Peter W. Shor,et al.  Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem , 2001, IEEE Trans. Inf. Theory.

[11]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[12]  M. Ruskai.  Inequalities for quantum entropy: A review with conditions for equality , 2002, quant-ph/0205064.

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

[14]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[15]  E. Effros.  A matrix convexity approach to some celebrated quantum inequalities , 2008, Proceedings of the National Academy of Sciences.

[16]  Andreas J. Winter,et al.  All Inequalities for the Relative Entropy , 2006, 2006 IEEE International Symposium on Information Theory.

[17]  I. Csiszár.  A class of measures of informativity of observation channels , 1972 .

[18]  Alexander S. Holevo,et al.  The Capacity of the Quantum Channel with General Signal States , 1996, IEEE Trans. Inf. Theory.

[19]  Michael A. Nielsen,et al.  A simple proof of the strong subadditivity inequality , 2005, Quantum Inf. Comput..