Entanglement Cost of Quantum Channels

DOI10.1109/TIT.2013.2268533MaRDI QIDQ5346322zbMATH OpenOpenAlexWikidataFDO

Authors Mario Berta, Fernando G. S. L. Brandão, Matthias Christandl, S. Wehner

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1108.5357

Mathematics Subject Classification ID

Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum cryptography (quantum-theoretic aspects) (81P94)

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.

Cited in

(14)

• Quantum Channel Capacities per Unit Cost
• Entanglement cost for sequences of arbitrary quantum states
• Geometric Rényi divergence and its applications in quantum channel capacities
• The energy cost of quantum information losses
• Entanglement cost of antisymmetric states and additivity of capacity of some quantum channels
• Computable lower bounds on the entanglement cost of quantum channels
• Capacity estimates via comparison with TRO channels
• Quantum cryptography beyond quantum key distribution
• Strong converse for the classical capacity of the pure-loss bosonic channel
• Quantum broadcast channels with cooperating decoders: an information-theoretic perspective on quantum repeaters
• Relative entropy bounds on quantum, private and repeater capacities
• Entanglement-saving channels
• Necessary and sufficient conditions on measurements of quantum channels
• The zero-error entanglement cost is highly non-additive

This page was built for publication: Entanglement Cost of Quantum Channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346322)