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

TL;DR

This paper compares Cascade and LDPC codes for information reconciliation in industrial quantum key distribution, analyzing their performance, optimization, and validation on real systems to improve practical QKD security.

Contribution

It provides a comprehensive analysis and comparison of Cascade and LDPC algorithms in realistic industrial QKD environments, including optimization and live system validation.

Findings

LDPC codes outperform Cascade in certain conditions

Optimized LDPC codes improve reconciliation efficiency

Validation on a live industrial QKD system confirms practical applicability

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.