Full Content is available to subscribers

Subscribe/Learn More  >
Proceedings Article

Expeditious reconciliation for practical quantum key distribution

[+] Author Affiliations
Anastase Nakassis, Joshua C. Bienfang, Carl J. Williams

National Institute of Standards and Technology (USA)

Proc. SPIE 5436, Quantum Information and Computation II, 28 (August 24, 2004); doi:10.1117/12.541698
Text Size: A A A
From Conference Volume 5436

  • Quantum Information and Computation II
  • Eric Donkor; Andrew R. Pirich; Howard E. Brandt
  • Orlando, FL | April 12, 2004

abstract

The paper proposes algorithmic and environmental modifications to the extant reconciliation algorithms within the BB84 protocol so as to speed up reconciliation and privacy amplification. These algorithms have been known to be a performance bottleneck 1 and can process data at rates that are six times slower than the quantum channel they serve2. As improvements in single-photon sources and detectors are expected to improve the quantum channel throughput by two or three orders of magnitude, it becomes imperative to improve the performance of the classical software. We developed a Cascade-like algorithm that relies on a symmetric formulation of the problem, error estimation through the segmentation process, outright elimination of segments with many errors, Forward Error Correction, recognition of the distinct data subpopulations that emerge as the algorithm runs, ability to operate on massive amounts of data (of the order of 1 Mbit), and a few other minor improvements. The data from the experimental algorithm we developed show that by operating on massive arrays of data we can improve software performance by better than three orders of magnitude while retaining nearly as many bits (typically more than 90%) as the algorithms that were designed for optimal bit retention.

© (2004) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.
Citation

Anastase Nakassis ; Joshua C. Bienfang and Carl J. Williams
"Expeditious reconciliation for practical quantum key distribution", Proc. SPIE 5436, Quantum Information and Computation II, 28 (August 24, 2004); doi:10.1117/12.541698; http://dx.doi.org/10.1117/12.541698


Access This Proceeding
Sign in or Create a personal account to Buy this proceeding ($15 for members, $18 for non-members).

Figures

Tables

NOTE:
Citing articles are presented as examples only. In non-demo SCM6 implementation, integration with CrossRef’s "Cited By" API will populate this tab (http://www.crossref.org/citedby.html).

Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging & repositioning the boxes below.

Related Book Chapters

Topic Collections

Advertisement

 

 

 

  • Don't have an account?
  • Subscribe to the SPIE Digital Library
  • Create a FREE account to sign up for Digital Library content alerts and gain access to institutional subscriptions remotely.
Access This Proceeding
Sign in or Create a personal account to Buy this proceeding ($15 for members, $18 for non-members).
Access This Proceeding
Sign in or Create a personal account to Buy this article ($15 for members, $18 for non-members).
Access This Chapter

Access to SPIE eBooks is limited to subscribing institutions and is not available as part of a personal subscription. Print or electronic versions of individual SPIE books may be purchased via SPIE.org.