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

EPJ Quantum Technology

Information reconciliation of continuous-variables quantum key distribution: principles, implementations and applications

Shenshen Yang, Zhilei Yan, Hongzhao Yang, Qing Hua Lu, Zhenguo Lu, Liu‐Yong Cheng, Xiangyang Miao, Yongmin Li

Published Oct 6, 2023• 36 citations
Publisher

Abstract

Abstract Quantum key distribution (QKD) can provide information-theoretically secure keys for two parties of legitimate communication, and information reconciliation, as an indispensable component of QKD systems, can correct errors present in raw keys based on error-correcting codes. In this paper, we first describe the basic knowledge of information reconciliation and its impact on continuous variable QKD. Then we introduce the information schemes and the corresponding error correction codes employed. Next, we introduce the rate-compatible codes, the hardware acceleration of the reconciliation algorithm, the research progress of information reconciliation, and its application in continuous variable QKD. Finally, we discuss the future challenges and conclude.

DOI
10.1140/epjqt/s40507-023-00197-8

Related papers

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

An Open-Source Library for Information Reconciliation in Continuous-Variable QKD

Cil, Erdem Eray, Laurent Schmalen

This paper presents an easy-to-use open-source software library for continuous-variable quantum key distribution (CV-QKD) systems. The library, written in C++, simplifies the crucial task of information reconciliation, ensuring that both communicating parties share the same secret key despite the noise. It offers a comprehensive set of tools, including modules for multidimensional reconciliation, error correction, and data integrity checks. Designed with user-friendliness in mind, the library hides the complexity of error correction, making it accessible even to users without knowledge of error-correcting codes.

arXiv:2408.00569•Aug 1, 2024•2 citations

Information reconciliation (IR) for continuous variable quantum key distribution (QKD) over free space optics (FSO) channel

F. Daneshgaran, M. Mondin, Shlomi Arnon +2 more

Quantum Key Distribution (QKD) is a communication method which exchanges secret keys using cryptographic protocols involving elements from quantum science. Continuous Variable (CV) QKD is a method to implement key exchange using sampling of Gaussian signals. Reconciliation in CV-QKD is fundamentally realized via coding of the Alice or Bob binary labels of the Gaussian samples using either one-way or interactive communications between the parties, Alice and Bob, over a public authenticated channel. We assume that the communication is performed through an Optical Wireless (OW) or Free Space Optics (FSO) channel. In that case the received signal suffers from stochastic fading due to pointing jitter or atmospheric turbulence. As a result of the channel fading and noise Alice and Bob Gaussian samples will not match. Information Reconciliation (IR) is the phase of the CV-QKD protocol that makes sure that Alice and Bob agree on a common and identical labeling of their samples, i.e. agree on a common stream of bits that we denote as “reconciled key.” The information reconciliation in CV-QKD could be done by one-way or two-way channel coding to correct the actual labels so that they do match. To do so Bob generates a sequence of parity bits using a systematic code. These bits are sent to Alice over an authenticated public channel. Alice then uses her own sequence of labels she obtains after quantization with the redundancy provided by Bob to recover Bob’s binary sequence. In this work we analyze the problem of information reconciliation for continuous variable quantum key distribution over a free space optics channel.

Free-space laser communication technologies. Conference•Mar 4, 2019•2 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

Rate compatible protocol for information reconciliation: An application to QKD

David Elkouss, Jesús Martínez-Mateo, Daniel Lancho Lancho +1 more

Information Reconciliation is a mechanism that allows to weed out the discrepancies between two correlated variables. It is an essential component in every key agreement protocol where the key has to be transmitted through a noisy channel. The typical case is in the satellite scenario described by Maurer in the early 90's. Recently the need has arisen in relation with Quantum Key Distribution (QKD) protocols, where it is very important not to reveal unnecessary information in order to maximize the shared key length. In this paper we present an information reconciliation protocol based on a rate compatible construction of Low Density Parity Check codes. Our protocol improves the efficiency of the reconciliation for the whole range of error rates in the discrete variable QKD context. Its adaptability together with its low interactivity makes it specially well suited for QKD reconciliation.

arXiv:1006.2660•IEEE Information Theory Workshop (ITW)•Jan 1, 2010•46 citations

Information Reconciliation for Continuous-Variable Quantum Key Distribution with $β> 1$ Using Short Blocklength Error Correction Codes: Proposal and Concerns

Kadir Gümüş, João Frazão, Aaron Albores-Mejía +5 more

In this paper, we introduce a reconciliation protocol with a two-step error correction scheme that uses a short-blocklength, low-rate code and a long-blocklength, high-rate code. We simulate the protocol using a short-block-length low-density parity-check code and show that we can achieve reconciliation efficiencies above 1 using this method. We discuss the necessary steps required regarding security proofs before this protocol can be securely implemented.

arXiv:2409.13667•Sep 20, 2024•0 citations
Abstract Quantum key distribution (QKD) can provide information-theoretically secure keys for two parties of legitimate communication, and information reconciliation, as an indispensable component of QKD systems, can correct errors present in raw keys based on error-correcting codes. In this paper, we first describe the basic knowledge of information reconciliation and its impact on continuous variable QKD. Then we introduce the information schemes and the corresponding error correction codes employed. Next, we introduce the rate-compatible codes, the hardware acceleration of the reconciliation algorithm, the research progress of information reconciliation, and its application in continuous variable QKD. Finally, we discuss the future challenges and conclude.
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.
This paper presents an easy-to-use open-source software library for continuous-variable quantum key distribution (CV-QKD) systems. The library, written in C++, simplifies the crucial task of information reconciliation, ensuring that both communicating parties share the same secret key despite the noise. It offers a comprehensive set of tools, including modules for multidimensional reconciliation, error correction, and data integrity checks. Designed with user-friendliness in mind, the library hides the complexity of error correction, making it accessible even to users without knowledge of error-correcting codes.
Quantum Key Distribution (QKD) is a communication method which exchanges secret keys using cryptographic protocols involving elements from quantum science. Continuous Variable (CV) QKD is a method to implement key exchange using sampling of Gaussian signals. Reconciliation in CV-QKD is fundamentally realized via coding of the Alice or Bob binary labels of the Gaussian samples using either one-way or interactive communications between the parties, Alice and Bob, over a public authenticated channel. We assume that the communication is performed through an Optical Wireless (OW) or Free Space Optics (FSO) channel. In that case the received signal suffers from stochastic fading due to pointing jitter or atmospheric turbulence. As a result of the channel fading and noise Alice and Bob Gaussian samples will not match. Information Reconciliation (IR) is the phase of the CV-QKD protocol that makes sure that Alice and Bob agree on a common and identical labeling of their samples, i.e. agree on a common stream of bits that we denote as “reconciled key.” The information reconciliation in CV-QKD could be done by one-way or two-way channel coding to correct the actual labels so that they do match. To do so Bob generates a sequence of parity bits using a systematic code. These bits are sent to Alice over an authenticated public channel. Alice then uses her own sequence of labels she obtains after quantization with the redundancy provided by Bob to recover Bob’s binary sequence. In this work we analyze the problem of information reconciliation for continuous variable quantum key distribution over a free space optics channel.
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.
Information Reconciliation is a mechanism that allows to weed out the discrepancies between two correlated variables. It is an essential component in every key agreement protocol where the key has to be transmitted through a noisy channel. The typical case is in the satellite scenario described by Maurer in the early 90's. Recently the need has arisen in relation with Quantum Key Distribution (QKD) protocols, where it is very important not to reveal unnecessary information in order to maximize the shared key length. In this paper we present an information reconciliation protocol based on a rate compatible construction of Low Density Parity Check codes. Our protocol improves the efficiency of the reconciliation for the whole range of error rates in the discrete variable QKD context. Its adaptability together with its low interactivity makes it specially well suited for QKD reconciliation.
Information Reconciliation for Continuous-Variable Quantum Key Distribution with β>1β> 1β>1 Using Short Blocklength Error Correction Codes: Proposal and Concerns