Efficiently implementable codes for quantum key expansion

Details Efficiently implementable codes for quantum key expansion Efficiently implementable codes for quantum key expansion

2006-08-02

arxiv.org/abs/quant-ph/0608029v2

Physics

Quantum Physics

4 pages, 1 figure. The new version has the title changed, the abstract, introduction and conclusion rewritten. To appear in PR

Scientific paper

10.1103/PhysRevA.75.010303

The Shor-Preskill proof of the security of the BB84 quantum key distribution protocol relies on the theoretical existence of good classical error-correcting codes with the ``dual-containing'' property. A practical implementation of BB84 thus requires explicit and efficiently decodable constructions of such codes, which are not known. On the other hand, modern coding theory abounds with non-dual-containing codes with excellent performance and efficient decoding algorithms. We show that the dual-containing constraint can be lifted at a small price: instead of a key distribution protocol, an efficiently implementable key expansion protocol is obtained, capable of increasing the size of a pre-shared key by a constant factor.

Affiliated with

Also associated with

No associations

Rating

Efficiently implementable codes for quantum key expansion 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 Efficiently implementable codes for quantum key expansion, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficiently implementable codes for quantum key expansion will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-50704