Min- and max-relative entropies and a new entanglement monotone
IEEE Transactions on Information Theory
The operational meaning of min- and max-entropy
IEEE Transactions on Information Theory
A fully quantum asymptotic equipartition property
IEEE Transactions on Information Theory
Duality between smooth min- and max-entropies
IEEE Transactions on Information Theory
Universally composable privacy amplification against quantum adversaries
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
The capacity of the quantum channel with general signal states
IEEE Transactions on Information Theory
Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
IEEE Transactions on Information Theory
The private classical capacity and quantum capacity of a quantum channel
IEEE Transactions on Information Theory
| Hi-index | 0.01 |
The Quantum Reverse Shannon Theorem states that any quantum channel can be simulated by an unlimited amount of shared entanglement and an amount of classical communication equal to the channel's entanglement assisted classical capacity. In this extended abstract, we summarize a new and conceptually simple proof of this theorem [journal reference: arXiv.org:quant-ph/0912.3805], which has previously been proved in [Bennett et al., arXiv.org:quant-ph/0912.5537]. Our proof is based on optimal one-shot Quantum State Merging and the Post-Selection Technique for quantum channels.