2007
DOI: 10.1016/s0034-4877(07)00019-5
|View full text |Cite
|
Sign up to set email alerts
|

Another short and elementary proof of strong subadditivity of quantum entropy

Abstract: A short and elementary proof of the joint convexity of relative entropy is presented, using nothing beyond linear algebra. The key ingredients are an easily verified integral representation and the strategy used to prove the Cauchy-Schwarz inequality in elementary courses. Several consequences are proved in a way which allow an elementary proof of strong subadditivity in a few more lines. Some expository material on Schwarz inequalities for operators and the Holevo bound for partial measurements is also includ… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
32
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 30 publications
(32 citation statements)
references
References 28 publications
0
32
0
Order By: Relevance
“…It was subsequently used by Narnhofer and Thirring ( [29]) to give a new proof of SSA. The argument given here is similar to that in [18,31,37]; however, the unified treatment for 0 < p < 2 leading to equality conditions, is new. Moreover, a dual treatment can be given for −1 < p < 1 allowing extension to the full range (−1, 2).…”
Section: Introductionmentioning
confidence: 75%
“…It was subsequently used by Narnhofer and Thirring ( [29]) to give a new proof of SSA. The argument given here is similar to that in [18,31,37]; however, the unified treatment for 0 < p < 2 leading to equality conditions, is new. Moreover, a dual treatment can be given for −1 < p < 1 allowing extension to the full range (−1, 2).…”
Section: Introductionmentioning
confidence: 75%
“…The original proof is based on Lieb's theorem [106]. Simpler proofs were subsequently presented by Nielsen and Petz [126] and Ruskai [143], amongst others. In this book we proved this statement indirectly via the data-processing inequality for the relative entropy, which in turns follows by continuity from the data-processing inequality for the Rényi divergence in Chapter 4.…”
Section: Background and Further Readingmentioning
confidence: 99%
“…According to eq. (20), write |η k AB = (1 1 A ⊗ R k ) |φ + AA and |θ k CD = (1 1 C ⊗ S k ) |φ + CC . Then we have…”
Section: New Rank Inequalitiesmentioning
confidence: 99%