2008/09/30 by Stefano Pirandola, Raúl García−Patrón, Raul Garcia-Patron +2 · 3 citations
Computer Science · Mathematics · Physics and Astronomy · #Channel (broadcasting) #Classical capacity #Combinatorics #Computer network #Computer science #Computer security #Cryptography #Encryption #Gaussian #Key (lock) #Key distribution #Key generation #Mathematics #Physics #Public-key cryptography #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum capacity #Quantum channel #Quantum entanglement #Quantum information science #Quantum key distribution #Quantum mechanics #Quantum network #Topology (electrical circuits) #cs.CR #cs.IT #math.IT #physics.optics #quant-ph
paper · pdf · doi:10.1103/physrevlett.102.050503
published as Phys. Rev. Lett. 102, 050503 (2009) · 4 pages, 5 figures, REVteX
openalex publication_date 2009/02/04 · arxiv created 2009/02/09 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We define the direct and reverse secret-key capacities of a memoryless quantum channel as the optimal rates that entanglement-based quantum-key-distribution protocols can reach by using a single forward classical communication (direct reconciliation) or a single feedback classical communication (reverse reconciliation). In particular, the reverse secret-key capacity can be positive for antidegradable channels, where no forward strategy is known to be secure. This property is explicitly shown in the continuous variable framework by considering arbitrary one-mode Gaussian channels.