2001/07/26 by Nicolas J. Cerf, Mohamed Bourennane, Anders Karlsson +1 · 32 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #BB84 #Computer science #Computer security #Cryptography #Cryptosystem #Discrete mathematics #Hilbert space #Key (lock) #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum computer #Quantum cryptography #Quantum information #Quantum key distribution #Quantum mechanics #Qubit #Theoretical computer science #Upper and lower bounds #quant-ph
paper · pdf · doi:10.1103/physrevlett.88.127902
published as Phys. Rev. Lett. 88, 127902 (2002). · 4 pages RevTex
arxiv created 2001/07/26 · openalex publication_date 2002/03/08 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05
We consider two quantum cryptographic schemes relying on encoding the key into qudits, i.e., quantum states in a d-dimensional Hilbert space. The first cryptosystem uses two mutually unbiased bases (thereby extending the BB84 scheme), while the second exploits all d+1 available such bases (extending the six-state protocol for qubits). We derive the information gained by a potential eavesdropper applying a cloning-based individual attack, along with an upper bound on the error rate that ensures unconditional security against coherent attacks.