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

Conference on Lasers and Electro-Optics

A High Efficiency Reconciliation Method for Free-space Continuous-Variable QKD

Chao Zhou, Xiangyu Wang, Yichen Zhang, Zhiguo Zhang, Song Yu

Published Jan 1, 2020• 0 citations
Publisher

Abstract

We propose a high efficiency reconciliation method for continuous-variable quantum key distribution over free-space channel, which achieves stable reconciliation efficiency of more than 95% under the fluctuation of the SNR (as low as -16 dB).
DOI
10.1364/cleo_at.2020.ath1i.5

Related papers

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•23 citations

Adaptive Reconciliation for Experimental Continuous-Variable Quantum Key Distribution Over a Turbulent Free-Space Optical Channel

Kadir Gümüş, João Frazão, Vincent van Vliet +5 more

We experimentally demonstrate adaptive reconciliation for continuous-variable quantum key distribution over a turbulent free-space optical channel. Additionally, we propose a method for optimising the reconciliation efficiency, increasing secret key rates by up to 8.1%.

arXiv:2312.13835•Optical Fiber Communication Conference•Jan 1, 2024•4 citations

Continuous-Variable Quantum Key Distribution with Rateless Reconciliation Protocol

Chao Zhou, Xiangyu Wang, Yichen Zhang +3 more

Can encrypted communication be secure at practical speeds? The authors propose a $r\phantom{\rule{0}{0ex}}a\phantom{\rule{0}{0ex}}t\phantom{\rule{0}{0ex}}e\phantom{\rule{0}{0ex}}l\phantom{\rule{0}{0ex}}e\phantom{\rule{0}{0ex}}s\phantom{\rule{0}{0ex}}s$ $r\phantom{\rule{0}{0ex}}e\phantom{\rule{0}{0ex}}c\phantom{\rule{0}{0ex}}o\phantom{\rule{0}{0ex}}n\phantom{\rule{0}{0ex}}c\phantom{\rule{0}{0ex}}i\phantom{\rule{0}{0ex}}l\phantom{\rule{0}{0ex}}i\phantom{\rule{0}{0ex}}a\phantom{\rule{0}{0ex}}t\phantom{\rule{0}{0ex}}i\phantom{\rule{0}{0ex}}o\phantom{\rule{0}{0ex}}n$ $p\phantom{\rule{0}{0ex}}r\phantom{\rule{0}{0ex}}o\phantom{\rule{0}{0ex}}t\phantom{\rule{0}{0ex}}o\phantom{\rule{0}{0ex}}c\phantom{\rule{0}{0ex}}o\phantom{\rule{0}{0ex}}l$ to overcome the technical difficulties for efficient error correction at different signal-to-noise ratios (SNRs), and therefore to significantly improve the performance of continuous-variable quantum key distribution (CV-QKD). Using this method, highly efficient key extraction can be maintained even at ultralow SNR. This method remarkably reduces the complexity of reconciliation, improves the robustness of practical systems, and can significantly improve the post-processing performance of CV-QKD, bringing secure quantum communication one step closer to everyday use.

arXiv:1908.04526•Physical Review Applied•Nov 6, 2019•75 citations

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

Lucien Martial, Alexis Rosio, Eleni Diamanti +2 more

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.

cs.ITCross-listedarXiv:2606.02323•Jun 2, 2026•0 citations

High Efficiency Error Correction for Continuous-Variable Quantum Key Distribution using Raptor-Like LDPC Codes

Chao Zhou, Xiangyu Wang, Yichen Zhang +2 more

We introduce a simple but high efficient raptor-like LDPC code for the long distance continuous-variable quantum key distribution system, which achieves stable reconciliation efficiency of more than 90% under low SNR regions.

Asia Communications and Photonics Conference•Jan 1, 2020•0 citations

High-efficiency reconciliation for continuous variable quantum key distribution

Zengliang Bai, Shenshen Yang, Yongmin Li

Abstract Quantum key distribution (QKD) is the most mature application of quantum information technology. Information reconciliation is a crucial step in QKD and significantly affects the final secret key rates shared between two legitimate parties. We analyze and compare various construction methods of low-density parity-check (LDPC) codes and design high-performance irregular LDPC codes with a block length of 10 6 . Starting from these good codes and exploiting the slice reconciliation technique based on multilevel coding and multistage decoding, we realize high-efficiency Gaussian key reconciliation with efficiency higher than 95% for signal-to-noise ratios above 1. Our demonstrated method can be readily applied in continuous variable QKD.

Japanese Journal of Applied Physics•Mar 13, 2017•34 citations
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.
Can encrypted communication be secure at practical speeds? The authors propose a $r\phantom{\rule{0}{0ex}}a\phantom{\rule{0}{0ex}}t\phantom{\rule{0}{0ex}}e\phantom{\rule{0}{0ex}}l\phantom{\rule{0}{0ex}}e\phantom{\rule{0}{0ex}}s\phantom{\rule{0}{0ex}}s$ $r\phantom{\rule{0}{0ex}}e\phantom{\rule{0}{0ex}}c\phantom{\rule{0}{0ex}}o\phantom{\rule{0}{0ex}}n\phantom{\rule{0}{0ex}}c\phantom{\rule{0}{0ex}}i\phantom{\rule{0}{0ex}}l\phantom{\rule{0}{0ex}}i\phantom{\rule{0}{0ex}}a\phantom{\rule{0}{0ex}}t\phantom{\rule{0}{0ex}}i\phantom{\rule{0}{0ex}}o\phantom{\rule{0}{0ex}}n$ $p\phantom{\rule{0}{0ex}}r\phantom{\rule{0}{0ex}}o\phantom{\rule{0}{0ex}}t\phantom{\rule{0}{0ex}}o\phantom{\rule{0}{0ex}}c\phantom{\rule{0}{0ex}}o\phantom{\rule{0}{0ex}}l$ to overcome the technical difficulties for efficient error correction at different signal-to-noise ratios (SNRs), and therefore to significantly improve the performance of continuous-variable quantum key distribution (CV-QKD). Using this method, highly efficient key extraction can be maintained even at ultralow SNR. This method remarkably reduces the complexity of reconciliation, improves the robustness of practical systems, and can significantly improve the post-processing performance of CV-QKD, bringing secure quantum communication one step closer to everyday use.
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.
Abstract Quantum key distribution (QKD) is the most mature application of quantum information technology. Information reconciliation is a crucial step in QKD and significantly affects the final secret key rates shared between two legitimate parties. We analyze and compare various construction methods of low-density parity-check (LDPC) codes and design high-performance irregular LDPC codes with a block length of 10 6 . Starting from these good codes and exploiting the slice reconciliation technique based on multilevel coding and multistage decoding, we realize high-efficiency Gaussian key reconciliation with efficiency higher than 95% for signal-to-noise ratios above 1. Our demonstrated method can be readily applied in continuous variable QKD.