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

arXiv:2408.08581

Parameter Optimization of Rate-Adaptive Continuous-Variable Quantum Key Distribution Systems

Cil, Erdem Eray, Jonas Berl, Laurent Schmalen

Published Aug 16, 2024• 0 citations
arXivHTMLPDF

Abstract

We propose an optimization method for rate-adaptive CV-QKD systems, improving the SKR by up to 15%. A single information reconciliation setup can generate secret keys up to a distance of 112 km. This enables a unified reconciliation system, thereby facilitating the commercialization of CV-QKD.
DOI
10.48550/arxiv.2408.08581

Related papers

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

A feasible two-step optimization method for continuous-variable quantum key distribution

Li Ma, Yang Li, Jie Yang +8 more

Continuous-variable quantum key distribution (CV-QKD) offers the advantages of high secret key rates in metropolitan areas. Optimization of modulation variance is an efficient method to improve the secret key rate of CVQKD system. However, in practical CV-QKD system, inevitable slight parameter fluctuation could occur after the modification of modulation variance, and controlling the modulation variance with arbitrary accuracy is also difficult. In this paper, we propose a two-step optimization for practical CV-QKD. The first step is to determine the optimal working state by combining the modulation variance optimization with error correction matrix optimization. The second step is to optimize the rate-adaptive reconciliation parameters to compensate the loss of secret key rate caused by inaccuracy modulation variance. Our results show that the secret key rate can be improved by 17.8% in comparison to one-step optimization method. Our method can be conveniently applied to CV-QKD protocol with homodyne and heterodyne detection, which will pave the way to the deployment of high stable and high performance for CV-QKD.

SPIE Conference on Quantum and Nonlinear Optics•Nov 27, 2022•0 citations

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

WangXiangyu, ZhangYichen, Yusong +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...

Quantum Information and Computation•Nov 1, 2017•0 citations

Practical Methods for Distance-Adaptive Continuous-Variable Quantum Key Distribution

Jonas Berl, Utku Akin, Erdem Eray Cil +2 more

Continuous-variable quantum key distribution (CV-QKD) is a promising quantum-safe alternative to classical asymmetric cryptography that enables two authenticated parties to establish a shared secret over a potentially eavesdropped quantum channel. A key step in CV-QKD post-processing is information reconciliation, which leverages forward error correction (FEC) techniques to extract identical bit strings from noisy correlated data. In this work, we analyze the strict limitations on operating distance that are imposed by constant-rate FEC, severely limiting the practicability of CV-QKD systems in deployed optical networks. To overcome the distance limitations, we evaluate three strategies: (i) tuning modulation variance, (ii) adding controlled amounts of trusted detector loss, and (iii) the use of rate-adaptive FEC. All approaches are validated experimentally, compared in terms of performance, and we discuss implementation aspects. Our results show that while methods (i) and (ii) extend the operational distance of constant-rate FEC without the need for additional hardware components, they incur a significant penalty in secret key rate (SKR). In contrast, rate-adaptive FEC enables CV-QKD operation with performance close to the asymptotic SKR over a wide range of distances, provided that the reconciliation efficiency is chosen appropriately.

quant-pharXiv:2603.10480•Journal of Lightwave Technology•Mar 12, 2026•0 citations

Rate-Adaptive Information Reconciliation for CV-QKD Systems at Low Signal-to-Noise Ratios

Huiting Fu, Jisheng Dai, Yan Feng +4 more

In continuous-variable quantum key distribution (CV-QKD) systems, information reconciliation (IR) is a crucial step that significantly affects the secret key rate (SKR). The fixed-rate error-correcting codes used in IR are highly sensitive to changes in the signal-to-noise ratio (SNR) and cannot maintain a high reconciliation efficiency in practical CV-QKD systems. To address this issue, we first propose a rate-adaptive IR protocol, namely Threshold-based IR (TIR), which changes the code rate of low-density parity-check (LDPC) codes by selectively revealing bits with lower reliability and adjusting their log-likelihood ratios (LLRs). Then, we propose a rate-adaptive IR protocol, namely Sorting-based IR (SIR), which not only adjusts the code rate according to variations in SNR, but also enables the CV-QKD systems to achieve high reconciliation efficiency over a wide range of SNRs. Furthermore, we perform an analysis of the protocols in terms of code rate, reconciliation efficiency, and complexity. The simulation results demonstrate that the proposed protocols outperform other rate-adaptive IR protocols, achieving a reconciliation efficiency higher than 98.5% in the SNR range below -20 dB and maintaining a certain SKR in long-distance transmission.

Entropy•Dec 20, 2025•1 citation

Increased-Efficiency Multiple-Decoding-Attempts Error Correction for Continuous-Variable Quantum Key Distribution

Lukas Eisemann, Ömer Bayraktar, Stefan Richter +3 more

In continuous-variable quantum key distribution (CV-QKD), the performance of the information reconciliation (IR) step is critical for the achievable secret key rate (SKR) and transmission distance. We show how to improve on the recently introduced implementation of an IR-protocol involving multiple decoding attempts (MDA) and validate the method on simulated data in different application scenarios. Throughout, we demonstrate meaningful SKR-gains compared to both the standard protocol of a single decoding attempt and to the original MDA-implementation, even at given decoding complexity.

quant-pharXiv:2512.24387•Dec 31, 2025•0 citations
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) offers the advantages of high secret key rates in metropolitan areas. Optimization of modulation variance is an efficient method to improve the secret key rate of CVQKD system. However, in practical CV-QKD system, inevitable slight parameter fluctuation could occur after the modification of modulation variance, and controlling the modulation variance with arbitrary accuracy is also difficult. In this paper, we propose a two-step optimization for practical CV-QKD. The first step is to determine the optimal working state by combining the modulation variance optimization with error correction matrix optimization. The second step is to optimize the rate-adaptive reconciliation parameters to compensate the loss of secret key rate caused by inaccuracy modulation variance. Our results show that the secret key rate can be improved by 17.8% in comparison to one-step optimization method. Our method can be conveniently applied to CV-QKD protocol with homodyne and heterodyne detection, which will pave the way to the deployment of high stable and high performance for CV-QKD.
Continuous-variable quantum key distribution (CV-QKD) is a promising quantum-safe alternative to classical asymmetric cryptography that enables two authenticated parties to establish a shared secret over a potentially eavesdropped quantum channel. A key step in CV-QKD post-processing is information reconciliation, which leverages forward error correction (FEC) techniques to extract identical bit strings from noisy correlated data. In this work, we analyze the strict limitations on operating distance that are imposed by constant-rate FEC, severely limiting the practicability of CV-QKD systems in deployed optical networks. To overcome the distance limitations, we evaluate three strategies: (i) tuning modulation variance, (ii) adding controlled amounts of trusted detector loss, and (iii) the use of rate-adaptive FEC. All approaches are validated experimentally, compared in terms of performance, and we discuss implementation aspects. Our results show that while methods (i) and (ii) extend the operational distance of constant-rate FEC without the need for additional hardware components, they incur a significant penalty in secret key rate (SKR). In contrast, rate-adaptive FEC enables CV-QKD operation with performance close to the asymptotic SKR over a wide range of distances, provided that the reconciliation efficiency is chosen appropriately.
In continuous-variable quantum key distribution (CV-QKD) systems, information reconciliation (IR) is a crucial step that significantly affects the secret key rate (SKR). The fixed-rate error-correcting codes used in IR are highly sensitive to changes in the signal-to-noise ratio (SNR) and cannot maintain a high reconciliation efficiency in practical CV-QKD systems. To address this issue, we first propose a rate-adaptive IR protocol, namely Threshold-based IR (TIR), which changes the code rate of low-density parity-check (LDPC) codes by selectively revealing bits with lower reliability and adjusting their log-likelihood ratios (LLRs). Then, we propose a rate-adaptive IR protocol, namely Sorting-based IR (SIR), which not only adjusts the code rate according to variations in SNR, but also enables the CV-QKD systems to achieve high reconciliation efficiency over a wide range of SNRs. Furthermore, we perform an analysis of the protocols in terms of code rate, reconciliation efficiency, and complexity. The simulation results demonstrate that the proposed protocols outperform other rate-adaptive IR protocols, achieving a reconciliation efficiency higher than 98.5% in the SNR range below -20 dB and maintaining a certain SKR in long-distance transmission.
In continuous-variable quantum key distribution (CV-QKD), the performance of the information reconciliation (IR) step is critical for the achievable secret key rate (SKR) and transmission distance. We show how to improve on the recently introduced implementation of an IR-protocol involving multiple decoding attempts (MDA) and validate the method on simulated data in different application scenarios. Throughout, we demonstrate meaningful SKR-gains compared to both the standard protocol of a single decoding attempt and to the original MDA-implementation, even at given decoding complexity.