Physical Review Letters · 2000 · 632 citations · 18 references
ComputingPhysicsCryptographyInformation TheoryQuantum MechanicsInformation-theoretic CryptographyQuantum BitsQuantum CommunicationQuantum CryptographyQuantum Information TheoryEavesdropping DetectionPhotonic QubitsQuantum Key DistributionQuantum State Discrimination
A theorem by Shannon and the Holevo theorem impose that the efficiency of any protocol for quantum key distribution, E, defined as the number of secret (i.e., allowing eavesdropping detection) bits per transmitted bit plus qubit, is E < or = 1. The problem addressed here is whether the limit E = 1 can be achieved. It is showed that it can be done by splitting the secret bits between several qubits and forcing Eve to have only a sequential access to the qubits, as proposed by Goldenberg and Vaidman. A protocol with E = 1 based on polarized photons and in which Bob's state discrimination can be implemented with linear optical elements is presented.
18
A Mathematical Theory of Communication
Claude E. Shannon · Bell System Technical Journal · 1948 · 80.7K citations
Quantum cryptography based on Bell’s theorem
Artur Ekert · Physical Review Letters · 1991 · 10.7K citations
Computing, Physics, Cryptography +16
Experimental quantum teleportation
Dik Bouwmeester, Jian-Wei Pan, Klaus Mattle et al. · Nature · 1997 · 5.5K citations · Full text
A single quantum cannot be cloned
William K. Wootters, Wojciech H. Zurek · Nature · 1982 · 5.4K citations
Quantum cryptography using any two nonorthogonal states
Charles H. Bennett · Physical Review Letters · 1992 · 3.1K citations