Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published October 2013 | Submitted
Journal Article Open

Entanglement Cost of Quantum Channels

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 regularized optimization 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 postselection 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.

Additional Information

© 2013 IEEE. Manuscript received March 23, 2012; revised December 22, 2012; accepted April 06, 2013. Date of publication July 10, 2013; date of current version September 11, 2013. M. Berta, F. G. S. L. Brandão, and M. Christandl were supported in part by the German Science Foundation under Grant CH 843/2-1, in part by the Swiss National Science Foundation under Grants PP00P2 128455, 20CH21 138799 (CHIST-ERA project CQC), in part by the Swiss National Center of Competence in Research "Quantum Science and Technology (QSIT)," and in part by the Swiss State Secretariat for Education and Research supporting COST action MP1006. F. G. S. L. Brandão was also supported by an EPSRC Early Career fellowship. S. Wehner was supported by the National Research Foundation and Ministry of Education, Singapore and MOE Tier 3 Grant MOE2012-T3-1-009. This paper was presented in part at the 2012 IEEE International Symposium on Information Theory. We acknowledge discussions with J. Oppenheim, M. Walter, R. Werner, M. Wilde, and A. Winter. M. Berta, F. G. S. L. Brandão, and S. Wehner would like to thank the Institute Mittag-Leffler (Djursholm, Sweden), where part of this work was done.

Attached Files

Submitted - 1108.5357v3.pdf

Files

1108.5357v3.pdf
Files (770.9 kB)
Name Size Download all
md5:beb62f8b37f744ae4be1314ac383205a
770.9 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 18, 2023