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.
@article{arxiv.2307.02225,
title = {Efficient Information Reconciliation for High-Dimensional Quantum Key Distribution},
author = {Ronny Müller and Domenico Ribezzo and Mujtaba Zahidy and Leif Katsuo Oxenløwe and Davide Bacco and Søren Forchhammer},
journal= {arXiv preprint arXiv:2307.02225},
year = {2025}
}
Comments
17 pages, 5 figures. arXiv admin note: text overlap with arXiv:2305.08631