2010/04/20 by Fernando G. S. L. Brandão, Jonathan Oppenheim · 29 citations
Computer Science · Physics and Astronomy · #Algorithm #Channel (broadcasting) #Computer science #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum capacity #Quantum channel #Quantum entanglement #Quantum information science #Quantum mechanics #Quantum network #Quantum state #State (computer science) #Telecommunications #quant-ph
paper · pdf · doi:10.1103/physrevlett.108.040504
published in Physical Review Letters 108(4), 040504 (American Physical Society)
arxiv created 2010/04/20 · openalex publication_date 2012/01/27 · arxiv updated 2012/01/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
A classical one-time pad allows two parties to send private messages over a public classical channel-an eavesdropper who intercepts the communication learns nothing about the message. A quantum one-time pad is a shared quantum state which allows two parties to send private messages or private quantum states over a public quantum channel. If the eavesdropper intercepts the quantum communication she learns nothing about the message. In the classical case, a one-time pad can be created using shared and partially private correlations. Here we consider the quantum case in the presence of an eavesdropper, and find the single-letter formula for the rate at which the two parties can send messages using a general quantum state as a quantum one-time pad. Surprisingly, the formula coincides with the distillable entanglement assisted by a symmetric channel, an important quantity in quantum information theory, but which lacked a clear operational meaning.