Quantum key distribution in the Holevo limit

Details Quantum key distribution in the Holevo limit Quantum key distribution in the Holevo limit

2000-07-19

arxiv.org/abs/quant-ph/0007064v4

Phys. Rev. Lett. 85 (2000) 5635-5638

Physics

Quantum Physics

REVTeX, 4 pages, 2 figures

Scientific paper

10.1103/PhysRevLett.85.5635

A theorem by Shannon and the Holevo theorem impose that the efficiency of any protocol for quantum key distribution, $\cal E$, defined as the number of secret (i.e., allowing eavesdropping detection) bits per transmitted bit plus qubit, is ${\cal E} \le 1$. The problem addressed here is whether the limit ${\cal 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 ${\cal E} =1$ based on polarized photons and in which Bob's state discrimination can be implemented with linear optical elements is presented.

Affiliated with

Also associated with

No associations

Rating

Quantum key distribution in the Holevo limit does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum key distribution in the Holevo limit, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum key distribution in the Holevo limit will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-631266