2014/08/31 by F. S. Luiz, Gustavo Rigolin · 8 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Alice and Bob #Computer science #Computer security #Continuous variable #Cryptography #Key (lock) #Mathematics #Photon #Physics #Postselection #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum channel #Quantum computer #Quantum cryptography #Quantum entanglement #Quantum information #Quantum key distribution #Quantum mechanics #Quantum teleportation #Qubit #Teleportation #quant-ph
paper · pdf · doi:10.1007/s11128-016-1504-8
published in Quantum Information Processing 16(3) (Springer Science+Business Media) · 13 pages, 10 figures, two-column, RevTex4; v2: published version
openalex publication_date 2017/01/21 · arxiv created 2017/01/30 · arxiv updated 2017/01/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We present a continuous variable (CV) quantum key distribution (QKD) scheme based on the CV quantum teleportation of coherent states that yields a raw secret key made up of discrete variables for both Alice and Bob. This protocol preserves the efficient detection schemes of current CV technology (no single-photon detection techniques) and, at the same time, has efficient error correction and privacy amplification schemes due to the binary modulation of the key. We show that for a certain type of incoherent attack it is secure for almost any value of the transmittance of the optical line used by Alice to share entangled two-mode squeezed states with Bob (no 3 dB or 50% loss limitation characteristic of beam splitting attacks). The present CVQKD protocol works deterministically (no postselection needed) with efficient direct reconciliation techniques (no reverse reconciliation) in order to generate a secure key and beyond the 50% loss case at the incoherent attack level.