Rate compatible reconciliation for continuous-variable quantum key distribution using Raptor-like LDPC codes
Chao Zhou, Xiangyu Wang, Zhiguo Zhang, Song Yu, Ziyang Chen, Hong Guo

TL;DR
This paper introduces Raptor-like LDPC codes for continuous-variable quantum key distribution, enabling efficient, rate-compatible error correction that maintains high reconciliation efficiency across varying SNRs, facilitating practical CV-QKD deployment.
Contribution
The paper proposes a novel RL-LDPC code design that combines rate compatibility with capacity-approaching performance for CV-QKD error correction.
Findings
Achieves over 98% reconciliation efficiency across a range of code rates.
Supports high-speed decoding at SNRs below -16.45 dB.
Enables adaptable key extraction rates for different transmission distances.
Abstract
In the practical continuous-variable quantum key distribution (CV-QKD) system, the postprocessing process, particularly the error correction part, significantly impacts the system performance. Multi-edge type low-density parity-check (MET-LDPC) codes are suitable for CV-QKD systems because of their Shannon-limit-approaching performance at a low signal-to-noise ratio (SNR). However, the process of designing a low-rate MET-LDPC code with good performance is extremely complicated. Thus, we introduce Raptor-like LDPC (RL-LDPC) codes into the CV-QKD system, exhibiting both the rate compatible property of the Raptor code and capacity-approaching performance of MET-LDPC codes. Moreover, this technique can significantly reduce the cost of constructing a new matrix. We design the RL-LDPC matrix with a code rate of 0.02 and easily and effectively adjust this rate from 0.016 to 0.034. Simulation…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
