A simple proof of the strong subadditivity inequality

Michael A. Nielsen, D. Petz

Research output: Contribution to journalArticle

31 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)507-513
Number of pages7
JournalQuantum Information and Computation
Volume5
Issue number6
Publication statusPublished - Sep 2005

Fingerprint

Subadditivity
hammers
Linear algebra
Quantum theory
Hammers
quantum mechanics
algebra
Entropy
entropy
Quantum Information
Quantum Mechanics
Knowledge

Keywords

  • Entropy
  • Monotonicity
  • Relative entropy
  • Strong subadditivity

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Mathematical Physics
  • Theoretical Computer Science
  • Physics and Astronomy(all)
  • Nuclear and High Energy Physics
  • Statistical and Nonlinear Physics

Cite this

A simple proof of the strong subadditivity inequality. / Nielsen, Michael A.; Petz, D.

In: Quantum Information and Computation, Vol. 5, No. 6, 09.2005, p. 507-513.

Research output: Contribution to journalArticle

@article{f21ade38cc3a4bfb91a5215ee94583ed,
title = "A simple proof of the strong subadditivity inequality",
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.",
keywords = "Entropy, Monotonicity, Relative entropy, Strong subadditivity",
author = "Nielsen, {Michael A.} and D. Petz",
year = "2005",
month = "9",
language = "English",
volume = "5",
pages = "507--513",
journal = "Quantum Information and Computation",
issn = "1533-7146",
publisher = "Rinton Press Inc.",
number = "6",

}

TY - JOUR

T1 - A simple proof of the strong subadditivity inequality

AU - Nielsen, Michael A.

AU - Petz, D.

PY - 2005/9

Y1 - 2005/9

N2 - 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.

AB - 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.

KW - Entropy

KW - Monotonicity

KW - Relative entropy

KW - Strong subadditivity

UR - http://www.scopus.com/inward/record.url?scp=23744514592&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=23744514592&partnerID=8YFLogxK

M3 - Article

VL - 5

SP - 507

EP - 513

JO - Quantum Information and Computation

JF - Quantum Information and Computation

SN - 1533-7146

IS - 6

ER -