Elements of information theory
Elements of information theory
Quantum computation and quantum information
Quantum computation and quantum information
Equality conditions for the quantum f-relative entropy and generalized data processing inequalities
Quantum Information Processing
An intuitive proof of the data processing inequality
Quantum Information & Computation
| Hi-index | 0.00 |
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 simple proof of strong subadditivity due to Petz [Rep. on Math. Phys. 23 (1), 57-65 (1986)]. It assumes only knowledge of elementary linear algebra and quantum mechanics.