Efficient Information Reconciliation for High-Dimensional Quantum Key Distribution
arXiv:2307.02225 · doi:10.1007/s11128-024-04395-w
Abstract
The Information Reconciliation phase in quantum key distribution has significant impact on the range and throughput of any QKD system. We explore this stage for high-dimensional QKD implementations and introduce two novel methods for reconciliation. The methods are based on nonbinary LDPC codes and the Cascade algorithm, and achieve efficiencies close the the Slepian-Wolf bound on q-ary symmetric channels.
arXiv comment17 pages, 5 figures. arXiv admin note: text overlap with arXiv:2305.08631
References in corpus (20)
- Advances in Quantum Cryptography
- Quantum Cryptography using larger alphabets
- High-dimensional quantum communication: benefits, progress, and future challenges
- Overcoming Noise in Entanglement Distribution
- Estimates for practical quantum cryptography
- Reconciliation of a Quantum-Distributed Gaussian Key
- Practical issues in quantum-key-distribution post-processing
- Fast, efficient error reconciliation for quantum cryptography
- Finite-key analysis on the 1-decoy state QKD protocol
- Simple 2.5 GHz time-bin quantum key distribution
- Efficient time-bin encoding for practical high-dimensional quantum key distribution
- Efficient reconciliation protocol for discrete-variable quantum key distribution
- Symmetric blind information reconciliation for quantum key distribution
- Pathways for entanglement based quantum communication in the face of high noise
- Fundamental Finite Key Limits for One-Way Information Reconciliation in Quantum Key Distribution
- Method for decoupling error correction from privacy amplification
- A real-time design based on FPGA for Expeditious Error Reconciliation in QKD system
- Blind information reconciliation with polar codes for quantum key distribution
- Using Cascade in Quantum Key Distribution
- Secure rate-adaptive reconciliation