1999/11/12 by Gilles Brassard, Norbert Lütkenhaus, Tal Mor +1 · 13 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Channel (broadcasting) #Communication source #Computer science #Computer security #Cryptography #Key (lock) #Key generation #Mathematics #Parametric statistics #Physics #Process (computing) #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum cryptography #Quantum information #Quantum key distribution #Quantum mechanics #Qubit #Statistical physics #Telecommunications #Topology (electrical circuits) #quant-ph
paper · pdf · doi:10.1103/physrevlett.85.1330
published as Phys. Rev. Lett. Vol 85, 1330-1333 (2000). · 5 pages, uses multicol
arxiv created 1999/11/12 · openalex publication_date 2000/08/07 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05
We provide limits to practical quantum key distribution, taking into account channel losses, a realistic detection process, and imperfections in the "qubits" sent from the sender to the receiver. As we show, even quantum key distribution with perfect qubits might not be achievable over long distances when the other imperfections are taken into account. Furthermore, existing experimental schemes (based on weak pulses) currently do not offer unconditional security for the reported distances and signal strength. Finally we show that parametric down-conversion offers enhanced performance compared to its weak coherent pulse counterpart.