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:2409.13667 · Journal of Lightwave Technology

Information Reconciliation for Continuous-Variable Quantum Key Distribution With $\beta > 1$ Using Short Blocklength Error Correction Codes: Proposal and Open Security Questions

Kadir Gümüş, João Frazão, Aaron Albores-Mejía, Boris Škorić, Gabriele Liga, Yunus Can Gültekin, Thomas D. Bradley, Chigo M. Okonkwo

Published Jan 1, 2026• 1 citation
arXivHTMLPDF

Abstract

In this paper, we introduce a two-step reconciliation protocol that combines a short-blocklength, low-rate code with a long-blocklength, high-rate code. We simulate the protocol using a short-block-length low-density parity-check code and investigate what happens when we operate with reconciliation efficiencies above 1. We identify and discuss the security proof requirements. Furthermore, we discuss the validity of frame rejection, not only for the proposed protocol, but for conventional multi-dimensional reconciliation as well.

DOI
10.1109/jlt.2026.3739162

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

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

Short Blocklength Error Correction Codes for Continuous-Variable Quantum Key Distribution

Kadir Gümüş, João Frazão, Boris Škorić +4 more

We introduce a two-step error correction scheme for reconciliation in continuous-variable quantum key distribution systems. Using this scheme, it is possible to use error correction codes with small blocklengths (1000 bits), increasing secret key rates at a distance of 140km by up to 7.3 times.

arXiv:2507.03529•European Conference on Optical Communication•Sep 28, 2025•0 citations

A novel error correction protocol for continuous variable quantum key distribution

Kadir Gümüş, Tobias A. Eriksson, Masahiro Takeoka +4 more

Reconciliation is a key element of continuous-variable quantum key distribution (CV-QKD) protocols, affecting both the complexity and performance of the entire system. During the reconciliation protocol, error correction is typically performed using low-density parity-check (LDPC) codes with a single decoding attempt. In this paper, we propose a modification to a conventional reconciliation protocol used in four-state protocol CV-QKD systems called the multiple decoding attempts (MDA) protocol. MDA uses multiple decoding attempts with LDPC codes, each attempt having fewer decoding iteration than the conventional protocol. Between each decoding attempt we propose to reveal information bits, which effectively lowers the code rate. MDA is shown to outperform the conventional protocol in regards to the secret key rate (SKR). A 10% decrease in frame error rate and an 8.5% increase in SKR are reported in this paper. A simple early termination for the LDPC decoder is also proposed and implemented. With early termination, MDA has decoding complexity similar to the conventional protocol while having an improved SKR.

Scientific Reports•May 17, 2021•21 citations

Multi-matrix error estimation and reconciliation for quantum key distribution

Chaohui Gao, Dong Jiang, Yu Guo +1 more

Post-processing is a significant step in quantum key distribution (QKD), which is used for correcting the quantum-channel noise errors and distilling identical corrected keys between two distant legitimate parties. Efficient error reconciliation protocol, which can lead to an increase in the secure key generation rate, is one of the main performance indicators of QKD setups. In this paper, we propose a multi-low-density parity-check codes based reconciliation scheme, which can provide remarkable perspectives for highly efficient information reconciliation. By testing our approach through data simulation, we show that the proposed scheme combining multi-syndrome-based error rate estimation allows for a more accurate estimation of the error rate as compared with random sampling and single-syndrome estimation techniques before the error correction, as well as a significant increase in the efficiency of the procedure without compromising security and sacrificing reconciliation efficiency.

arXiv:1902.05263•Optics Express•May 6, 2019•23 citations

Information Reconciliation for Continuous-Variable Quantum Key Distribution using Non-Binary Low-Density Parity-Check Codes

Christoph Pacher, Jesús Martínez-Mateo, Jörg Duhme +2 more

An information reconciliation method for continuous-variable quantum key distribution with Gaussian modulation that is based on non-binary low-density parity-check (LDPC) codes is presented. Sets of regular and irregular LDPC codes with different code rates over the Galois fields $GF(8)$, $GF(16)$, $GF(32)$, and $GF(64)$ have been constructed. We have performed simulations to analyze the efficiency and the frame error rate using the sum-product algorithm. The proposed method achieves an efficiency between $0.94$ and $0.98$ if the signal-to-noise ratio is between $4$ dB and $24$ dB.

arXiv:1602.09140•Feb 29, 2016•13 citations
Information Reconciliation for Continuous-Variable Quantum Key Distribution With β>1\beta > 1β>1 Using Short Blocklength Error Correction Codes: Proposal and Open Security Questions
In this paper, we introduce a two-step reconciliation protocol that combines a short-blocklength, low-rate code with a long-blocklength, high-rate code. We simulate the protocol using a short-block-length low-density parity-check code and investigate what happens when we operate with reconciliation efficiencies above 1. We identify and discuss the security proof requirements. Furthermore, we discuss the validity of frame rejection, not only for the proposed protocol, but for conventional multi-dimensional reconciliation as well.
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.
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.
Reconciliation is a key element of continuous-variable quantum key distribution (CV-QKD) protocols, affecting both the complexity and performance of the entire system. During the reconciliation protocol, error correction is typically performed using low-density parity-check (LDPC) codes with a single decoding attempt. In this paper, we propose a modification to a conventional reconciliation protocol used in four-state protocol CV-QKD systems called the multiple decoding attempts (MDA) protocol. MDA uses multiple decoding attempts with LDPC codes, each attempt having fewer decoding iteration than the conventional protocol. Between each decoding attempt we propose to reveal information bits, which effectively lowers the code rate. MDA is shown to outperform the conventional protocol in regards to the secret key rate (SKR). A 10% decrease in frame error rate and an 8.5% increase in SKR are reported in this paper. A simple early termination for the LDPC decoder is also proposed and implemented. With early termination, MDA has decoding complexity similar to the conventional protocol while having an improved SKR.
Post-processing is a significant step in quantum key distribution (QKD), which is used for correcting the quantum-channel noise errors and distilling identical corrected keys between two distant legitimate parties. Efficient error reconciliation protocol, which can lead to an increase in the secure key generation rate, is one of the main performance indicators of QKD setups. In this paper, we propose a multi-low-density parity-check codes based reconciliation scheme, which can provide remarkable perspectives for highly efficient information reconciliation. By testing our approach through data simulation, we show that the proposed scheme combining multi-syndrome-based error rate estimation allows for a more accurate estimation of the error rate as compared with random sampling and single-syndrome estimation techniques before the error correction, as well as a significant increase in the efficiency of the procedure without compromising security and sacrificing reconciliation efficiency.
An information reconciliation method for continuous-variable quantum key distribution with Gaussian modulation that is based on non-binary low-density parity-check (LDPC) codes is presented. Sets of regular and irregular LDPC codes with different code rates over the Galois fields GF(8)GF(8)GF(8), GF(16)GF(16)GF(16), GF(32)GF(32)GF(32), and GF(64)GF(64)GF(64) have been constructed. We have performed simulations to analyze the efficiency and the frame error rate using the sum-product algorithm. The proposed method achieves an efficiency between 0.940.940.94 and 0.980.980.98 if the signal-to-noise ratio is between 444 dB and 242424 dB.