Blind Reconciliation
Jesus Martinez-Mateo, David Elkouss, Vicente Martin

TL;DR
This paper explores the use of short-length LDPC codes in a low-interactivity, blind reconciliation protocol for quantum key distribution, aiming to improve efficiency and practicality in real-world QKD systems.
Contribution
It introduces a blind reconciliation method using 2000-bit LDPC codes that do not require prior error rate estimation, suitable for high-throughput hardware implementation.
Findings
2000-bit LDPC codes are effective for blind reconciliation.
The proposed method reduces the need for error rate estimation.
It enables high-throughput, practical QKD system implementations.
Abstract
Information reconciliation is a crucial procedure in the classical post-processing of quantum key distribution (QKD). Poor reconciliation efficiency, revealing more information than strictly needed, may compromise the maximum attainable distance, while poor performance of the algorithm limits the practical throughput in a QKD device. Historically, reconciliation has been mainly done using close to minimal information disclosure but heavily interactive procedures, like Cascade, or using less efficient but also less interactive -just one message is exchanged- procedures, like the ones based in low-density parity-check (LDPC) codes. The price to pay in the LDPC case is that good efficiency is only attained for very long codes and in a very narrow range centered around the quantum bit error rate (QBER) that the code was designed to reconcile, thus forcing to have several codes if a broad…
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.
