Quantum Key Distribution in the Holevo Limit

Adán Cabello
Phys. Rev. Lett. 85, 5635 – Published 25 December 2000
PDFExport Citation

Abstract

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 E1. 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.

  • Received 20 July 2000

DOI:https://doi.org/10.1103/PhysRevLett.85.5635

©2000 American Physical Society

Authors & Affiliations

Adán Cabello*

  • Departamento de Física Aplicada II, Universidad de Sevilla, 41012 Sevilla, Spain

  • *Electronic address: adan@cica.es

Comments & Replies

Comment on “Quantum Key Distribution in the Holevo Limit”

A. Fahmi and M. Golshani
Phys. Rev. Lett. 100, 018901 (2008)

Cabello Replies:

Adán Cabello
Phys. Rev. Lett. 100, 018902 (2008)

References (Subscription Required)

Click to Expand
Issue

Vol. 85, Iss. 26 — 25 December 2000

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review Letters

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×