Phys. Rev. Lett. 85, 5635–5638 (2000)Quantum Key Distribution in the Holevo LimitReceived 20 July 2000; published in the issue dated 25 December 2000 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≤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. © 2000 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevLett.85.5635
DOI:
10.1103/PhysRevLett.85.5635
PACS:
03.67.Dd, 03.67.Hk, 03.65.Bz
See AlsoComment: A. Fahmi and M. Golshani, Comment on “Quantum Key Distribution in the Holevo Limit”, Phys. Rev. Lett. 100, 018901 (2008). Reply: Adán Cabello, Cabello Replies:, Phys. Rev. Lett. 100, 018902 (2008). |
|
About | Terms and Conditions | Subscriptions | Search | Help
Use of the American Physical Society websites and journals implies that the user has read and agrees to our Terms and Conditions and any applicable Subscription Agreement. Physical Review®, Physical Review Letters®, Reviews of Modern Physics®, and Physical Review Special Topics® are trademarks of the American Physical Society.