Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

npj Quantum Information

Rate-compatible multi-edge type low-density parity-check code ensembles for continuous-variable quantum key distribution systems

Suhwang Jeong, Hyun-Woo Jung, Jeongseok Ha

Published Jan 21, 2022• 27 citations
Publisher

Abstract

Abstract In this paper, we propose a design rule of rate-compatible punctured multi-edge type low-density parity-check (MET-LDPC) code ensembles with degree-one variable nodes for the information reconciliation (IR) of continuous-variable quantum key distribution (CV-QKD) systems. In addition to the rate compatibility, the design rule effectively resolves the high error-floor issue which has been known as a technical challenge of MET-LDPC codes at low rates. Thus, the proposed design rule allows one to implement rate-compatible MET-LDPC codes with good performances both in the threshold and low-error-rate regions. The rate compatibility and the improved error-rate performances significantly enhance the efficiency of IR for CV-QKD systems. The performance improvements are confirmed by comparing complexities and secret key rates of IR schemes with MET-LDPC codes whose ensembles are optimized with the proposed and existing design rules. In particular, the SNR range of positive secrecy rate increases by 1.44 times, and the maximum secret key rate improves by 2.10 times as compared to the existing design rules. The comparisons clearly show that an IR scheme can achieve drastic performance improvements in terms of both the complexity and secret key rate by employing rate-compatible MET-LDPC codes constructed with code ensembles optimized with the proposed design rule.

DOI
10.1038/s41534-021-00509-9

Related papers

Rate-Compatible LDPC Codes for Continuous-Variable Quantum Key Distribution in Wide Range of SNRs Regime

Xiaodong Fan, Quanhao Niu, Tao Zhao +1 more

Long block length rate-compatible low-density parity-compatible (LDPC) codes are designed to solve the problems of great variation of quantum channel noise and extremely low signal-to-noise ratio in continuous-variable quantum key distribution (CV-QKD). The existing rate-compatible methods for CV-QKD inevitably cost abundant hardware resources and waste secret key resources. In this paper, we propose a design rule of rate-compatible LDPC codes that can cover all potential SNRs with single check matrix. Based on this long block length LDPC code, we achieve high efficiency continuous-variable quantum key distribution information reconciliation with a reconciliation efficiency of 91.80% and we have higher hardware processing efficiency and lower frame error rate than other schemes. Our proposed LDPC code can obtain a high practical secret key rate and a long transmission distance in an extremely unstable channel.

Entropy•Oct 13, 2022•7 citations

A Comprehensive Survey on LDPC Code Design for CV-QKD

Mauro Q. Nooblath Neto, Guilherme Vergne de Oliveira, Micael Andrade Dias +3 more

Continuous-Variable Quantum Key Distribution (CV-QKD) represents a promising technology for secure communication, but its practical implementation heavily relies on highly efficient information reconciliation (IR) to extract a secret key from correlated quantum data shared over noisy channels. Low-density parity-check codes (LDPC) have emerged as the state-of-the-art solution for this task due to their capacity-approaching performance. However, designing LDPC codes that perform reliably in the very low signal-to-noise ratio (SNR) regime of CV-QKD, while preserving practical implementation complexity, remains a major challenge. This work presents a comprehensive survey of LDPC code design methodologies for CV-QKD, with particular emphasis on three key structural classes: Quasi-Cyclic (QC-LDPC), Multi-Edge Type (MET-LDPC), and their hybrid form (QC-MET-LDPC).

Journal of Bioengineering, Technologies and Health•Jul 8, 2026•0 citations

High-efficiency rate-adaptive reconciliation in continuous-variable quantum key distribution

Hongzhao Yang, Shuaishuai Liu, Shenshen Yang +3 more

In continuous-variable (CV) quantum key distribution (QKD), the reconciliation efficiency and frame error rate of the information reconciliation have a significant impact on the secret key rate. For a fixed-rate multiedge-type low-density parity-check (LDPC) code, the reconciliation efficiency and frame error rate will inevitably vary due to the fluctuations of the signal-to-noise ratio (SNR) of the CV QKD system, which degrades the performance of the system. We propose a high-efficiency rate-adaptive information reconciliation scheme by combining raptorlike (RL) LDPC codes with the addition of trusted noises. We establish the model of adding trusted noises and combine it with the RL LDPC codes to optimize the secret key rate under the time-varying channel. The simulation results show that our scheme can maintain a high reconciliation efficiency of more than 94.4% and a low frame error rate within 15% fluctuation range of the SNR. Furthermore, we implement the hardware acceleration of the proposed rate-adaptive scheme on a graphics processing unit and achieve a decoding throughput of 65.5 Mbits/s by optimizing the storage of the parity-check matrix. Our results are useful for the practical CV QKD under the realistic time-varying channel.

Physical Review A•Jan 4, 2024•19 citations

Multiedge-type low-density parity-check codes for continuous-variable quantum key distribution

Hossein Mani, Tobias Gehring, Philipp Grabenweger +3 more

Continuous-variable quantum key distribution (QKD) utilizes an ensemble of coherent states of light to distribute secret encryption keys between two parties. An essential ingredient of the QKD protocol is highly efficient information reconciliation. To achieve highly efficient reconciliation, error-correcting codes with a low channel coding rate are inevitable in the most common schemes of multilevel coding and multistage decoding (MLC-MSD) and multidimensional reconciliation. Multiedge-type (MET) low-density parity-check (LDPC) codes are well suited for highly efficient reconciliation at low rates. Here, we calculate the optimal channel coding rates in the MLC-MSD scheme for reverse reconciliation, introduce the concept of generalized extrinsic information transfer charts for MET-LDPC codes, which constitute a simple and fast asymptotic analysis tool, and present a set of MET-LDPC codes with asymptotic efficiency $>97%$ for channel coding rates 0.1, 0.05, 0.02, and 0.01. We believe that our codes will find wide application in implementations of continuous-variable quantum key distribution based on Gaussian modulation.

arXiv:1812.05867•Physical Review A•Jun 25, 2021•37 citations

Efficient rate-adaptive reconciliation for continuous-variable quantum key distribution

Xiangyu Wang, Yichen Zhang, Zhengyu Li +3 more

Information reconciliation protocol has a significant effect on the secret key rate and maximal transmission distance of continuous-variable quantum key distribution (CV-QKD) systems. We propose an efficient rate-adaptive reconciliation protocol suitable for practical CV-QKD systems with time-varying quantum channel. This protocol changes the code rate of multi-edge type low density parity check codes, by puncturing (increasing the code rate) and shortening (decreasing the code rate) techniques, to enlarge the correctable signal-to-noise ratios regime, thus improves the overall reconciliation efficiency comparing to the original fixed rate reconciliation protocol. We verify our rate-adaptive reconciliation protocol with three typical code rate, i.e., 0.1, 0.05 and 0.02, the reconciliation efficiency keep around 93.5%, 95.4% and 96.4% for different signal-to-noise ratios, which shows the potential of implementing high-performance CV-QKD systems using single code rate matrix.

arXiv:1703.04916•Mar 15, 2017•32 citations

Rate-Compatible Polar- and LDPC-Coded Hybrid ARQ Aided Reverse Reconciliation in CV-QKD

Dingzhao Wang, Xin Liu, Chao Xu +2 more

Continuous-variable quantum key distribution (CV-QKD) systems face challenges in maintaining efficient reconciliation over long distances due to the time variant signal-to-noise ratio (SNR) imposed by channel quality fluctuations. Hence fixed-rate error-correction schemes using low-density parity-check (LDPC) or Polar codes lead to high block-error rates (BLER) and degraded secret key rates (SKR). To overcome this, we propose an incremental redundancy aided hybrid automatic repeat request (IR-HARQ) protocol using rate-compatible Polar and LDPC codes. Explicitly, by puncturing a mother code and progressively transmitting additional redundant bits, our method dynamically adapts the effective coding rate to the prevalent channel conditions, achieving 2–3 dB SNR gains per retransmission. This adaptive strategy avoids unnecessary redundancy in good channels and strengthens protection in poor channels, thereby improving reconciliation efficiency. Simulation results show that our IR-HARQ scheme significantly enhances the BLER, throughput, and secure transmission distance compared with single-transmission schemes. Moreover, our study highlights that Polar IR-HARQ achieves superior performance in short block-length and low-SNR scenarios, while LDPC IR-HARQ is more competitive for longer codes and higher SNR. These findings confirm IR-HARQ as an attractive and versatile reconciliation solution for real-world CV-QKD deployments.

IEEE Open Journal of Vehicular Technology•Jan 1, 2026•0 citations
Abstract In this paper, we propose a design rule of rate-compatible punctured multi-edge type low-density parity-check (MET-LDPC) code ensembles with degree-one variable nodes for the information reconciliation (IR) of continuous-variable quantum key distribution (CV-QKD) systems. In addition to the rate compatibility, the design rule effectively resolves the high error-floor issue which has been known as a technical challenge of MET-LDPC codes at low rates. Thus, the proposed design rule allows one to implement rate-compatible MET-LDPC codes with good performances both in the threshold and low-error-rate regions. The rate compatibility and the improved error-rate performances significantly enhance the efficiency of IR for CV-QKD systems. The performance improvements are confirmed by comparing complexities and secret key rates of IR schemes with MET-LDPC codes whose ensembles are optimized with the proposed and existing design rules. In particular, the SNR range of positive secrecy rate increases by 1.44 times, and the maximum secret key rate improves by 2.10 times as compared to the existing design rules. The comparisons clearly show that an IR scheme can achieve drastic performance improvements in terms of both the complexity and secret key rate by employing rate-compatible MET-LDPC codes constructed with code ensembles optimized with the proposed design rule.
Long block length rate-compatible low-density parity-compatible (LDPC) codes are designed to solve the problems of great variation of quantum channel noise and extremely low signal-to-noise ratio in continuous-variable quantum key distribution (CV-QKD). The existing rate-compatible methods for CV-QKD inevitably cost abundant hardware resources and waste secret key resources. In this paper, we propose a design rule of rate-compatible LDPC codes that can cover all potential SNRs with single check matrix. Based on this long block length LDPC code, we achieve high efficiency continuous-variable quantum key distribution information reconciliation with a reconciliation efficiency of 91.80% and we have higher hardware processing efficiency and lower frame error rate than other schemes. Our proposed LDPC code can obtain a high practical secret key rate and a long transmission distance in an extremely unstable channel.
Continuous-Variable Quantum Key Distribution (CV-QKD) represents a promising technology for secure communication, but its practical implementation heavily relies on highly efficient information reconciliation (IR) to extract a secret key from correlated quantum data shared over noisy channels. Low-density parity-check codes (LDPC) have emerged as the state-of-the-art solution for this task due to their capacity-approaching performance. However, designing LDPC codes that perform reliably in the very low signal-to-noise ratio (SNR) regime of CV-QKD, while preserving practical implementation complexity, remains a major challenge. This work presents a comprehensive survey of LDPC code design methodologies for CV-QKD, with particular emphasis on three key structural classes: Quasi-Cyclic (QC-LDPC), Multi-Edge Type (MET-LDPC), and their hybrid form (QC-MET-LDPC).
In continuous-variable (CV) quantum key distribution (QKD), the reconciliation efficiency and frame error rate of the information reconciliation have a significant impact on the secret key rate. For a fixed-rate multiedge-type low-density parity-check (LDPC) code, the reconciliation efficiency and frame error rate will inevitably vary due to the fluctuations of the signal-to-noise ratio (SNR) of the CV QKD system, which degrades the performance of the system. We propose a high-efficiency rate-adaptive information reconciliation scheme by combining raptorlike (RL) LDPC codes with the addition of trusted noises. We establish the model of adding trusted noises and combine it with the RL LDPC codes to optimize the secret key rate under the time-varying channel. The simulation results show that our scheme can maintain a high reconciliation efficiency of more than 94.4% and a low frame error rate within 15% fluctuation range of the SNR. Furthermore, we implement the hardware acceleration of the proposed rate-adaptive scheme on a graphics processing unit and achieve a decoding throughput of 65.5 Mbits/s by optimizing the storage of the parity-check matrix. Our results are useful for the practical CV QKD under the realistic time-varying channel.
Continuous-variable quantum key distribution (QKD) utilizes an ensemble of coherent states of light to distribute secret encryption keys between two parties. An essential ingredient of the QKD protocol is highly efficient information reconciliation. To achieve highly efficient reconciliation, error-correcting codes with a low channel coding rate are inevitable in the most common schemes of multilevel coding and multistage decoding (MLC-MSD) and multidimensional reconciliation. Multiedge-type (MET) low-density parity-check (LDPC) codes are well suited for highly efficient reconciliation at low rates. Here, we calculate the optimal channel coding rates in the MLC-MSD scheme for reverse reconciliation, introduce the concept of generalized extrinsic information transfer charts for MET-LDPC codes, which constitute a simple and fast asymptotic analysis tool, and present a set of MET-LDPC codes with asymptotic efficiency >97>97%>97 for channel coding rates 0.1, 0.05, 0.02, and 0.01. We believe that our codes will find wide application in implementations of continuous-variable quantum key distribution based on Gaussian modulation.
Information reconciliation protocol has a significant effect on the secret key rate and maximal transmission distance of continuous-variable quantum key distribution (CV-QKD) systems. We propose an efficient rate-adaptive reconciliation protocol suitable for practical CV-QKD systems with time-varying quantum channel. This protocol changes the code rate of multi-edge type low density parity check codes, by puncturing (increasing the code rate) and shortening (decreasing the code rate) techniques, to enlarge the correctable signal-to-noise ratios regime, thus improves the overall reconciliation efficiency comparing to the original fixed rate reconciliation protocol. We verify our rate-adaptive reconciliation protocol with three typical code rate, i.e., 0.1, 0.05 and 0.02, the reconciliation efficiency keep around 93.5%, 95.4% and 96.4% for different signal-to-noise ratios, which shows the potential of implementing high-performance CV-QKD systems using single code rate matrix.
Continuous-variable quantum key distribution (CV-QKD) systems face challenges in maintaining efficient reconciliation over long distances due to the time variant signal-to-noise ratio (SNR) imposed by channel quality fluctuations. Hence fixed-rate error-correction schemes using low-density parity-check (LDPC) or Polar codes lead to high block-error rates (BLER) and degraded secret key rates (SKR). To overcome this, we propose an incremental redundancy aided hybrid automatic repeat request (IR-HARQ) protocol using rate-compatible Polar and LDPC codes. Explicitly, by puncturing a mother code and progressively transmitting additional redundant bits, our method dynamically adapts the effective coding rate to the prevalent channel conditions, achieving 2–3 dB SNR gains per retransmission. This adaptive strategy avoids unnecessary redundancy in good channels and strengthens protection in poor channels, thereby improving reconciliation efficiency. Simulation results show that our IR-HARQ scheme significantly enhances the BLER, throughput, and secure transmission distance compared with single-transmission schemes. Moreover, our study highlights that Polar IR-HARQ achieves superior performance in short block-length and low-SNR scenarios, while LDPC IR-HARQ is more competitive for longer codes and higher SNR. These findings confirm IR-HARQ as an attractive and versatile reconciliation solution for real-world CV-QKD deployments.