arXiv:2611.09182
A Tutorial on Practical QKD Post-Processing Algorithms Using a GUI-Based Simulation Framework
Ushnik Nath, Neha Sharma, Ramniwas Meena, Neel Kanth Kundu
Abstract
Recent experimental demonstrations of Quantum Key Distribution (QKD) have attracted significant attention for their ability to establish information-theoretically secure encryption keys for next-generation communication systems. As practical deployment accelerates, the realization of compact, scalable, and high-throughput discrete-variable (DV) QKD systems has become increasingly important. While advances in photonic integration are enabling low-size, low-weight, and low-power QKD hardware, the security and performance of these systems rely heavily on efficient post-processing techniques to generate identical, secure keys. This tutorial presents a comprehensive algorithm-level review of practical post-processing techniques for DV-QKD, with particular emphasis on information reconciliation methods based on Cascade, Winnow, low-density parity-check (LDPC), and polar codes. We also analyze the theoretical asymptotic and finite-size secret key rates (SKRs) of DV-QKD and benchmark these bounds against the practical SKRs achieved using actual post-processing algorithms. Furthermore, we present a server-client model to implement the entire QKD post-processing pipeline. The performance is evaluated in terms of QBER and SKR across various system parameters, considering the complete post-processing pipeline, including sifting, information reconciliation, privacy amplification, and authentication. This tutorial also presents a graphical user interface (GUI) for the QKD post-processing methods, enabling researchers, industry practitioners, and academic users to visualize and analyze the impact of different post-processing techniques and system parameters, such as QBER, on the SKR performance of DV-QKD systems.