Multidimensional Reconciliation in Continuous-Variable QKD: Review, Coding Schemes, and Open Source Simulation

arXiv:2606.023236.3Has Code
Predicted impact top 89% in IT · last 90 daysOriginality Synthesis-oriented
AI Analysis

For researchers and engineers designing CV-QKD systems, this provides a practical guide and open-source tool for optimizing reconciliation at low SNR and long distances.

This work reviews multidimensional reconciliation for CV-QKD, focusing on high-dimensional constructions beyond dimensions 1, 2, 4, 8, and presents an open-source simulation framework (HDirac) to evaluate LDPC codes, highlighting trade-offs between dimension, efficiency, and frame error rate.

Continuous-variable quantum key distribution (CV-QKD) requires highly efficient reconciliation techniques to operate at low signal-to-noise ratios and long distances. Multidimensional reconciliation addresses this challenge by transforming the physical Gaussian quantum channel into a virtual binary-input additive white Gaussian noise (BIAWGN) channel, enabling the use of modern errorcorrecting codes. In this work, we review the principles of multidimensional reconciliation, with a particular focus on high-dimensional constructions beyond the algebraic dimensions 1, 2, 4, 8. We describe the construction of the virtual channel, discuss practical coding schemes for reverse reconciliation, and analyse their integration with linear error-correcting codes. We also present an opensource simulation framework, HDirac, implementing multidimensional reconciliation for arbitrary dimensions, and use it to evaluate state-of-the-art LDPC codes. The results highlight key trade-offs between dimension, reconciliation efficiency, and frame error rate, providing practical guidance for CV-QKD system design.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes