Performance of Cascade and LDPC-codes for Information Reconciliation on Industrial Quantum Key Distribution Systems

2024/08/28 by Ronny Müller, Müller, Ronny, Claudia De Lazzari +13 · 1 citation
Computer Science · Engineering · #FOS: Physical sciences #Molecular Communication and Nanonetworks #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata

paper · pdf · doi:10.48550/arxiv.2408.15758

openalex publication_date 2024/08/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/31

Abstract

Information Reconciliation is a critical component of Quantum Key Distribution, ensuring that mismatches between Alice's and Bob's keys are corrected. In this study, we analyze, simulate, optimize, and compare the performance of two prevalent algorithms used for Information Reconciliation: Cascade and LDPC codes in combination with the Blind protocol. We focus on their applicability in practical and industrial settings, operating in realistic and application-close conditions. The results are further validated through evaluation on a live industrial QKD system.

Cited by

• Bell state measurements in quantum optics: a review of recent progress and open challenges

Related

• High Performance Information Reconciliation for QKD with CASCADE
• Problems in application of LDPC codes to information reconciliation in quantum key distribution protocols
• Efficient Information Reconciliation for High-Dimensional Quantum Key Distribution
• A Polynomial Interpolation based Quantum Key Reconciliation Protocol: Error Correction without Information Leakage
• LDPC for QKD Reconciliation