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.
@article{arxiv.2408.15758,
title = {Performance of Cascade and LDPC-codes for Information Reconciliation on Industrial Quantum Key Distribution Systems},
author = {Ronny Müller and Claudia De Lazzari and Fernando Chirici and Ilaria Vagniluca and Leif Katsuo Oxenløwe and Søren Forchhammer and Alessandro Zavatta and Davide Bacco},
journal= {arXiv preprint arXiv:2408.15758},
year = {2024}
}