A simple proof of the strong subadditivity inequality
classification
🪐 quant-ph
keywords
strongsubadditivityinequalityproofquantumsimplealgebraarguably
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.