A Simple Approach to Error Reconciliation in Quantum Key Distribution
Richard P. Brent

TL;DR
This paper analyzes a straightforward error reconciliation method in quantum key distribution where blocks with odd errors are discarded, demonstrating through simulation that the predicted performance aligns with actual results.
Contribution
It introduces and evaluates a simple error reconciliation scheme for QKD, providing predictive analysis validated by simulation.
Findings
The scheme effectively reduces errors in QKD.
Predicted performance matches simulation results.
Discarding blocks with bad parity improves key quality.
Abstract
We discuss the error reconciliation phase in quantum key distribution (QKD) and analyse a simple scheme in which blocks with bad parity (that is, blocks containing an odd number of errors) are discarded. We predict the performance of this scheme and show, using a simulation, that the prediction is accurate.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Computing Algorithms and Architecture · Quantum Mechanics and Applications
