Quantum Reverse Shannon Theorem
Charles H. Bennett, Igor Devetak, Aram W. Harrow, Peter W. Shor, and, Andreas Winter

TL;DR
This paper explores the quantum reverse Shannon theorem, detailing how quantum channels can be simulated using various auxiliary resources, and establishes new bounds and expressions for the resources needed in different scenarios.
Contribution
It provides a comprehensive analysis of resource requirements for quantum channel simulation, including a new single-letter expression for feedback simulation costs and a strong converse for entanglement-assisted capacity.
Findings
Entanglement suffices for tensor power sources
Additional resources needed for general sources
New single-letter formula for feedback simulation cost
Abstract
Dual to the usual noisy channel coding problem, where a noisy (classical or quantum) channel is used to simulate a noiseless one, reverse Shannon theorems concern the use of noiseless channels to simulate noisy ones, and more generally the use of one noisy channel to simulate another. For channels of nonzero capacity, this simulation is always possible, but for it to be efficient, auxiliary resources of the proper kind and amount are generally required. In the classical case, shared randomness between sender and receiver is a sufficient auxiliary resource, regardless of the nature of the source, but in the quantum case the requisite auxiliary resources for efficient simulation depend on both the channel being simulated, and the source from which the channel inputs are coming. For tensor power sources (the quantum generalization of classical IID sources), entanglement in the form of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum-Dot Cellular Automata
