Entanglement Cost of Quantum Channels
arXiv:1108.5357 · doi:10.1109/TIT.2013.2268533
Abstract
The entanglement cost of a quantum channel is the minimal rate at which entanglement (between sender and receiver) is needed in order to simulate many copies of a quantum channel in the presence of free classical communication. In this paper we show how to express this quantity as a regularised optimisation of the entanglement formation over states that can be generated between sender and receiver. Our formula is the channel analog of a well-known formula for the entanglement cost of quantum states in terms of the entanglement of formation; and shares a similar relation to the recently shattered hope for additivity. The entanglement cost of a quantum channel can be seen as the analog of the quantum reverse Shannon theorem in the case where free classical communication is allowed. The techniques used in the proof of our result are then also inspired by a recent proof of the quantum reverse Shannon theorem and feature the one-shot formalism for quantum information theory, the post-selection technique for quantum channels as well as Sion's minimax theorem. We discuss two applications of our result. First, we are able to link the security in the noisy-storage model to a problem of sending quantum rather than classical information through the adversary's storage device. This not only improves the range of parameters where security can be shown, but also allows us to prove security for storage devices for which no results were known before. Second, our result has consequences for the study of the strong converse quantum capacity. Here, we show that any coding scheme that sends quantum information through a quantum channel at a rate larger than the entanglement cost of the channel has an exponentially small fidelity.
arXiv commentv3: error in proof of Lemma 13 corrected, corrected Figure 5, 24 pages, 5 figures
References in corpus (47)
- Entanglement of Formation of an Arbitrary State of Two Qubits
- Mixed State Entanglement and Quantum Error Correction
- Separability Criterion for Density Matrices
- Separability of Mixed States: Necessary and Sufficient Conditions
- The capacity of the noisy quantum channel
- Unconditionally secure quantum bit commitment is impossible
- The operational meaning of min- and max-entropy
- Is Quantum Bit Commitment Really Possible?
- Superadditivity of communication capacity using entangled inputs
- Min- and Max- Relative Entropies and a New Entanglement Monotone
- Insecurity of Quantum Secure Computations
- Coding Theorem and Strong Converse for Quantum Channels
- Information transmission through a noisy quantum channel
- Capacities of Quantum Erasure Channels
- Randomizing quantum states: Constructions and applications
- Post-selection technique for quantum channels with applications to quantum cryptography
- The asymptotic entanglement cost of preparing a quantum state
- Leftover Hashing Against Quantum Side Information
- A Sharp Fannes-type Inequality for the von Neumann Entropy
- A Fully Quantum Asymptotic Equipartition Property
- The entanglement of purification
- Continuity of quantum conditional information
- Duality Between Smooth Min- and Max-Entropies
- Local filtering operations on two qubits
- The Quantum Reverse Shannon Theorem based on One-Shot Information Theory
- Strong Converse to the Quantum Channel Coding Theorem
- Unconditional security from noisy quantum storage
- A Factorization Law for Entanglement Decay
- Why Quantum Bit Commitment And Ideal Quantum Coin Tossing Are Impossible
- Irreversibility for all bound entangled states
- Cryptography from Noisy Storage
- Capacity Theorems for Quantum Multiple Access Channels: Classical-Quantum and Quantum-Quantum Capacity Regions
- On the strong converses for the quantum channel capacity theorems
- Fundamental bound on the reliability of quantum information transmission
- Tema Con Variazioni: Quantum Channel Capacity
- Continuity bounds for entanglement
- Entanglement sampling and applications
- A strong converse for classical channel coding using entangled inputs
- On the communication cost of entanglement transformations
- The Trouble with Quantum Bit Commitment
- Entanglement cost in practical scenarios
- Implementation of two-party protocols in the noisy-storage model
- A smooth entropy approach to quantum hypothesis testing and the classical capacity of quantum channels
- Simple Protocols for Oblivious Transfer and Secure Identification in the Noisy-Quantum-Storage Model
- Cryptography in a Quantum World
- Achieving the physical limits of the bounded-storage model
- The invalidity of a strong capacity for a quantum channel with memory
Cited by in corpus (52)
- Entropic Uncertainty Relations and their Applications
- Fundamental rate-loss tradeoff for optical quantum key distribution
- Quantum channels and memory effects
- Quantum Cryptography Beyond Quantum Key Distribution
- Fundamental limits of quantum error mitigation
- Operational Resource Theory of Quantum Channels
- The squashed entanglement of a quantum channel
- Entanglement sampling and applications
- Using and reusing coherence to realize quantum processes
- The information-theoretic costs of simulating quantum measurements
- Relative Entropy Bounds on Quantum, Private and Repeater Capacities
- Application of the Resource Theory of Channels to Communication Scenarios
- Experimental implementation of bit commitment in the noisy-storage model
- Resource theory of asymmetric distinguishability for quantum channels
- Strong converse rates for quantum communication
- Quantum Channel Simulation and the Channel's Smooth Max-Information
- Dynamical Entanglement
- Entanglement of a bipartite channel
- No second law of entanglement manipulation after all
- Entropy of a quantum channel
- Entanglement cost and quantum channel simulation
- Identifying the Information Gain of a Quantum Measurement
- Semidefinite programming converse bounds for quantum communication
- Practical distributed quantum information processing with LOCCNet
- Potential capacities of quantum channels
- "Pretty strong" converse for the quantum capacity of degradable channels
- Amortization does not enhance the max-Rains information of a quantum channel
- Continuous-Variable Protocol for Oblivious Transfer in the Noisy-Storage Model
- Nonadditivity of Rains' bound for distillable entanglement
- Operational applications of the diamond norm and related measures in quantifying the non-physicality of quantum maps
- Quantum to Classical Randomness Extractors
- Strong converse for the classical capacity of the pure-loss bosonic channel
- -Logarithmic negativity
- Device-independence for two-party cryptography and position verification
- Quantum Broadcast Channels with Cooperating Decoders: An Information-Theoretic Perspective on Quantum Repeaters
- Pursuing the fundamental limits for quantum communication
- Capacity Estimates via comparison with TRO channels
- The Communication Value of a Quantum Channel
- Quantum Side Information: Uncertainty Relations, Extractors, Channel Simulations
- A solution of the generalised quantum Stein's lemma
- Necessary and Sufficient Conditions on Measurements of Quantum Channels
- Simulating noisy quantum channels via quantum state preparation algorithms
- Geometric Rényi Divergence and its Applications in Quantum Channel Capacities
- Exact entanglement cost of quantum states and channels under PPT-preserving operations
- Quantum resource theory of coding for error correction
- Reliable Simulation of Quantum Channels: the Error Exponent
- Computable lower bounds on the entanglement cost of quantum channels
- Composability of partially entanglement breaking channels via entanglement assisted local operations and classical communication
- Certifying high-dimensional quantum channels
- One-Shot Static Entanglement Cost of Bipartite Quantum Channels
- On coherence of quantum operations by using Choi-Jamiołkowski isomorphism
- Single-shot entanglement manipulation of states and channels revisited