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

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, Boris Škorić, Gabriele Liga, Yunus Can Gültekin, Thomas D. Bradley, Chigo M. Okonkwo

Published Sep 20, 2024• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2409.13667

Related papers

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

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

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

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 +5 more

Journal of Lightwave Technology•Jan 1, 2026•0 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•4 citations

Spherical reconciliation for a continuous-variable quantum key distribution

Lu Zhao, Jianhong Shi, Feng‐Guang Li

Information reconciliation is a significant step for a continuous-variable quantum key distribution (CV-QKD) system. We propose a reconciliation method that allows two authorized parties to extract a consistent and secure binary key in a CV-QKD protocol, which is based on Gaussian-modulated coherent states and homodyne detection. This method named spherical reconciliation is based on spherical quantization and non-binary low-density parity-check (LDPC) codes. With the suitable signal-to-noise ratio (SNR) and code rate of non-binary LDPC codes, spherical reconciliation algorithm has a high efficiency and can extend the transmission distance of CV-QKD.

Chinese Physics B•Apr 1, 2017•3 citations
Information Reconciliation for Continuous-Variable Quantum Key Distribution with β>1β> 1β>1 Using Short Blocklength Error Correction Codes: Proposal and Concerns
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.
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.
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.
Information Reconciliation for Continuous-Variable Quantum Key Distribution With β>1\beta > 1β>1 Using Short Blocklength Error Correction Codes: Proposal and Open Security Questions
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.
Information reconciliation is a significant step for a continuous-variable quantum key distribution (CV-QKD) system. We propose a reconciliation method that allows two authorized parties to extract a consistent and secure binary key in a CV-QKD protocol, which is based on Gaussian-modulated coherent states and homodyne detection. This method named spherical reconciliation is based on spherical quantization and non-binary low-density parity-check (LDPC) codes. With the suitable signal-to-noise ratio (SNR) and code rate of non-binary LDPC codes, spherical reconciliation algorithm has a high efficiency and can extend the transmission distance of CV-QKD.