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

International Symposium on Communications and Information Technologies

Rate-adaptive reconciliation and its estimator for quantum bit error rate

Patcharapong Treeviriyanupab, Tharathorn Phromsa‐ard, Chun-Mei Zhang, Mo Li, Paramin Sangwongngam, Tomeyot Sanevong Na Ayutaya, Nattapong Songneam, Ronnagorn Rattanatamma, Chanvate Ingkavet, Wasana Sanor, Wei Chen, Zheng‐Fu Han, Keattisak Sripimanwat

Published Sep 1, 2014• 12 citations
Publisher

Abstract

The purpose of reconciliation, one of classical aspects of quantum key distribution (QKD) protocol, is to mitigate errors after the distribution of quantum information over a quantum channel. In this paper, a rate-adaptive method is proposed by means of a channel coding scheme where specific low-density parity-check (LDPC) codes are adapted in the Slepian-Wolf coding system. Puncturing and shortening techniques are adopted to optimize their coding rates with all possible cases of error in QKD. This successful method utilizes the knowledge of the quantum bit error rate (QBER) based on the maximum-likelihood estimator with respect to the syndrome information. Its benefit is that avoids wasting sample keys in the traditional channel estimation and thus increases the size of the final secret key. Evidently, simulation results confirm an improvement in the reconciliation efficiency with minimal interaction that suitable for high QKD throughput applications.

DOI
10.1109/iscit.2014.7011930

Related papers

Efficient Rate-Adaptive Reconciliation Based on LDPC Accumulate Codes for Quantum Key Distribution

Tharathorn Phromsa‐ard, Patcharapong Treeviriyanupab, Paramin Sangwongngam +4 more

In this paper, a rate-adaptive method is proposed an alternative reconciliation protocol by employing the LDPC-accumulate codes to the practical implementation in the quantum key distribution (QKD). The proposed rate-adaptive reconciliation is adapted in the Slepian-Wolf scheme where specific low-density parity-check (LDPC) codes are constructed by accumulated syndrome encoding/decoding. Its objective is to skip the step of quantum bit error rate (QBER) estimation by the traditional key sampling that increases the final secret key length in practice. From the numerical results, the proposed method achieves a good performance in terms of the number of disclosed bits and reconciliation efficiency comparable to the conventional Winnow, Cascade, and fixed-rate compatible LDPC based protocols. Moreover, it can cover the possible cases of error rates in the QKD system. Therefore, method is suitable for the highspeed discrete-variable QKD applications.

International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC)•Jun 1, 2015•0 citations

การประมาณคาชองสญญาณดวยภาวะนาจะเปนสงสดสำหรบการไกลเกลยความผดพลาดแบบปรบอตราเขารหสเหมาะสมกบการกระจายกญแจรหสลบเชงควอนตม

พัชรพงษ์ ตรีวิริยานุภาพ, ธราธร พรมสะอาด

การกระจายกุญแจรหัสลับเชิงควอนตัมถือเป็นหนึ่งในเทคโนโลยีความปลอดภัยด้านการสื่อสาร โดยอาศัยหลักกลศาสตร์ควอนตัมเพื่อกำเนิดและแลกเปลี่ยนข้อมูลกุญแจรหัสลับระหว่างคู่สื่อสารให้มีความปลอดภัยสูงสุดสำหรับระบบวิทยาการรหัสลับ ซึ่งต้องอาศัยกระบวนการไกล่เกลี่ยความผิดพลาดเพื่อจุดประสงค์ในการยืนยันความถูกต้องของข้อมูลกุญแจรหัสลับระหว่างคู่สื่อสารให้มีค่าที่ตรงกัน ในบทความนี้ นำเสนอวิธีการประมาณค่าอัตราความผิดพลาดของช่องสัญญาณเชิงควอนตัมบนพื้นฐานของการประมาณค่าภาวะน่าจะเป็นสูงสุดจากชุดข้อมูลซินโดรมในระหว่างขั้นตอนการไกล่เกลี่ยความผิดพลาดสำหรับการปรับค่าอัตราการเข้ารหัสให้เหมาะสมกับความผิดพลาดของบิตข้อมูลกุญแจเชิงควอนตัมที่เกิดขึ้นในแต่ละช่วงเวลาด้วยรหัสตรวจสอบพาริตี้แบบความหนาแน่นต่ำ ตลอดจนการนำมาประยุกต์ใช้แทนขั้นตอนการเปิดเผยบิตข้อมูลกุญแจบางส่วนที่สูญเสียไปในการประมาณค่าความผิดพลาดแบบดั้งเดิม นำไปสู่ผลลัพธ์ของขนาดบิตข้อมูลกุญแจที่เพิ่มสูงขึ้น โดยจากการวิเคราะห์และทดสอบผลพบว่า วิธีการที่นำเสนอให้ความแม่นยำในการประมาณค่าอัตราความผิดพลาดครอบคลุมเงื่อนไขของการกระจายกุญแจรหัสลับเชิงควอนตัม นำไปสู่การเพิ่มประสิทธิภาพการไกล่เกลี่ยความผิดพลาดที่สูงขึ้นทั้งในด้านความปลอดภัยและอัตราการกำเนิดกุญแจรหัสลับ สนับสนุนการประยุกต์ใช้งานจริงในระบบการกระจายกุญแจรหัสลับเชิงควอนตัมความเร็วสูงQuantum Key Distribution (QKD), one of the communication security technologies, employs the properties of quantum mechanics to guarantee and exchange the perfectly-secured key generation between two legitimate parties for cryptographic purposes. The reconciliation process is required to correct the transmission error after the distribution of quantum objects. In this paper, the channel parameter estimation is proposed to estimate the error rate in the quantum channel by using the Maximum-Likelihood Estimation (MLE) based on the syndrome information for rate-adaptive reconciliation. The specific Low-Density Parity-Check (LDPC) codes are adapted to optimize their coding rates responding to the possible cases of error in QKD. The proposed method can be applied to avoid wasting sample keys in the traditional channel estimation, and led to increase the final secret key length. The simulation results show an accuracy of the estimated quantum bit error rate (QBER) for covering the range in QKD system. The gain of rate-adaptive reconciliation based on MLE confirms an improvement in the reconciliation efficiency that significantly impacts on the achievable secret key generation rate for high QKD throughput applications.

The Journal of King Mongkut s University of Technology North Bangkok•Nov 1, 2016•0 citations

Simple rate-adaptive LDPC coding for quantum key distribution

Li, Mo, Chun-Mei Zhang, Zhen−Qiang Yin +3 more

Although quantum key distribution (QKD) comes from the development of quantum theory, the implementation of a practical QKD system does involve a lot of classical process, such as key reconciliation and privacy amplification, which is called post-processing. Post-processing has been a crucial element to high speed QKD systems, even the bottleneck of it because of its relatively high time consumption. Low density parity check (LDPC) is now becoming a promising approach of overcoming the bottleneck due to its good performance in processing throughput. In this article we propose and simulate an easily implemented but efficiently rate-adaptive LDPC coding approach of reconciliation, different from the previously proposed puncturing- and shortening-based approach. We also give a measure for choosing the optimal LDPC parameter for our rate-adaptive approach according to error rates.

arXiv:1505.06423•May 24, 2015•2 citations

Sampling Rate Optimization for LDPC-Based Information Reconciliation Protocol in QKD

Vladimir Morozov, Oleg Olegovich Evsutin, Nikita Yarygin

Quantum Key Distribution (QKD) is a promising field in modern cryptography where the security of key information is guaranteed by the laws of quantum mechanics. One of the key stages in QKD protocols is error estimation and reconciliation in the secret key. This procedure requires the transmission of a certain number of secret key bits over a public channel. Such transmission leads to disclosing these bits to a potential eavesdropper. The fraction of disclosed bits—the sampling rate-largely depends on the chosen approach for preliminary error estimation in the channel. This work is devoted to the optimization of the sampling rate for an LDPC code from the $\mathbf{5 G}$ standard. The results of our experiments show that for a QBER below 0.2 and key lengths of 264, 528, 792, and 1056 bits, it is necessary to disclose no more than $18 \%, 11 \%, 10 \%$, and $7 \%$ of the key bits for error estimation, respectively. Furthermore, the proposed algorithm allows for similar optimization for any information reconciliation protocols and actual quantum bit error rates.

International Symposium on Problems of Redundancy in Information and Control Systems (REDUNDANCY)•Nov 5, 2025•1 citation

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

Efficient Integration of Rate-Adaptive Reconciliation with Syndrome-Based Error Estimation and Subblock Confirmation for Quantum Key Distribution

Patcharapong Treeviriyanupab, Chun-Mei Zhang

An effective post-processing algorithm is essential for achieving high rates of secret key generation in quantum key distribution. This work introduces an approach to quantum key distribution post-processing by integrating the three main steps into a unified procedure: syndrome-based error estimation, rate-adaptive reconciliation, and subblock confirmation. The proposed scheme employs low-density parity-check codes to estimate the quantum bit error rate using the syndrome information, and to optimize the channel coding rates based on the Slepian-Wolf coding scheme for the rate-adaptive method. Additionally, this scheme incorporates polynomial-based hash verification in the subblock confirmation process. The numerical results show that the syndrome-based estimation significantly enhances the accuracy and consistency of the estimated quantum bit error rate, enabling effective code rate optimization for rate-adaptive reconciliation. The unified approach, which integrates rate-adaptive reconciliation with syndrome-based estimation and subblock confirmation, exhibits superior efficiency, minimizes practical information leakage, reduces communication rounds, and guarantees convergence to the identical key. Furthermore, the simulations indicate that the secret key throughput of this approach achieves the theoretical limit in the context of a BB84 quantum key distribution system.

Entropy•Jan 7, 2024•7 citations
The purpose of reconciliation, one of classical aspects of quantum key distribution (QKD) protocol, is to mitigate errors after the distribution of quantum information over a quantum channel. In this paper, a rate-adaptive method is proposed by means of a channel coding scheme where specific low-density parity-check (LDPC) codes are adapted in the Slepian-Wolf coding system. Puncturing and shortening techniques are adopted to optimize their coding rates with all possible cases of error in QKD. This successful method utilizes the knowledge of the quantum bit error rate (QBER) based on the maximum-likelihood estimator with respect to the syndrome information. Its benefit is that avoids wasting sample keys in the traditional channel estimation and thus increases the size of the final secret key. Evidently, simulation results confirm an improvement in the reconciliation efficiency with minimal interaction that suitable for high QKD throughput applications.
In this paper, a rate-adaptive method is proposed an alternative reconciliation protocol by employing the LDPC-accumulate codes to the practical implementation in the quantum key distribution (QKD). The proposed rate-adaptive reconciliation is adapted in the Slepian-Wolf scheme where specific low-density parity-check (LDPC) codes are constructed by accumulated syndrome encoding/decoding. Its objective is to skip the step of quantum bit error rate (QBER) estimation by the traditional key sampling that increases the final secret key length in practice. From the numerical results, the proposed method achieves a good performance in terms of the number of disclosed bits and reconciliation efficiency comparable to the conventional Winnow, Cascade, and fixed-rate compatible LDPC based protocols. Moreover, it can cover the possible cases of error rates in the QKD system. Therefore, method is suitable for the highspeed discrete-variable QKD applications.
การกระจายกุญแจรหัสลับเชิงควอนตัมถือเป็นหนึ่งในเทคโนโลยีความปลอดภัยด้านการสื่อสาร โดยอาศัยหลักกลศาสตร์ควอนตัมเพื่อกำเนิดและแลกเปลี่ยนข้อมูลกุญแจรหัสลับระหว่างคู่สื่อสารให้มีความปลอดภัยสูงสุดสำหรับระบบวิทยาการรหัสลับ ซึ่งต้องอาศัยกระบวนการไกล่เกลี่ยความผิดพลาดเพื่อจุดประสงค์ในการยืนยันความถูกต้องของข้อมูลกุญแจรหัสลับระหว่างคู่สื่อสารให้มีค่าที่ตรงกัน ในบทความนี้ นำเสนอวิธีการประมาณค่าอัตราความผิดพลาดของช่องสัญญาณเชิงควอนตัมบนพื้นฐานของการประมาณค่าภาวะน่าจะเป็นสูงสุดจากชุดข้อมูลซินโดรมในระหว่างขั้นตอนการไกล่เกลี่ยความผิดพลาดสำหรับการปรับค่าอัตราการเข้ารหัสให้เหมาะสมกับความผิดพลาดของบิตข้อมูลกุญแจเชิงควอนตัมที่เกิดขึ้นในแต่ละช่วงเวลาด้วยรหัสตรวจสอบพาริตี้แบบความหนาแน่นต่ำ ตลอดจนการนำมาประยุกต์ใช้แทนขั้นตอนการเปิดเผยบิตข้อมูลกุญแจบางส่วนที่สูญเสียไปในการประมาณค่าความผิดพลาดแบบดั้งเดิม นำไปสู่ผลลัพธ์ของขนาดบิตข้อมูลกุญแจที่เพิ่มสูงขึ้น โดยจากการวิเคราะห์และทดสอบผลพบว่า วิธีการที่นำเสนอให้ความแม่นยำในการประมาณค่าอัตราความผิดพลาดครอบคลุมเงื่อนไขของการกระจายกุญแจรหัสลับเชิงควอนตัม นำไปสู่การเพิ่มประสิทธิภาพการไกล่เกลี่ยความผิดพลาดที่สูงขึ้นทั้งในด้านความปลอดภัยและอัตราการกำเนิดกุญแจรหัสลับ สนับสนุนการประยุกต์ใช้งานจริงในระบบการกระจายกุญแจรหัสลับเชิงควอนตัมความเร็วสูงQuantum Key Distribution (QKD), one of the communication security technologies, employs the properties of quantum mechanics to guarantee and exchange the perfectly-secured key generation between two legitimate parties for cryptographic purposes. The reconciliation process is required to correct the transmission error after the distribution of quantum objects. In this paper, the channel parameter estimation is proposed to estimate the error rate in the quantum channel by using the Maximum-Likelihood Estimation (MLE) based on the syndrome information for rate-adaptive reconciliation. The specific Low-Density Parity-Check (LDPC) codes are adapted to optimize their coding rates responding to the possible cases of error in QKD. The proposed method can be applied to avoid wasting sample keys in the traditional channel estimation, and led to increase the final secret key length. The simulation results show an accuracy of the estimated quantum bit error rate (QBER) for covering the range in QKD system. The gain of rate-adaptive reconciliation based on MLE confirms an improvement in the reconciliation efficiency that significantly impacts on the achievable secret key generation rate for high QKD throughput applications.
Although quantum key distribution (QKD) comes from the development of quantum theory, the implementation of a practical QKD system does involve a lot of classical process, such as key reconciliation and privacy amplification, which is called post-processing. Post-processing has been a crucial element to high speed QKD systems, even the bottleneck of it because of its relatively high time consumption. Low density parity check (LDPC) is now becoming a promising approach of overcoming the bottleneck due to its good performance in processing throughput. In this article we propose and simulate an easily implemented but efficiently rate-adaptive LDPC coding approach of reconciliation, different from the previously proposed puncturing- and shortening-based approach. We also give a measure for choosing the optimal LDPC parameter for our rate-adaptive approach according to error rates.
Quantum Key Distribution (QKD) is a promising field in modern cryptography where the security of key information is guaranteed by the laws of quantum mechanics. One of the key stages in QKD protocols is error estimation and reconciliation in the secret key. This procedure requires the transmission of a certain number of secret key bits over a public channel. Such transmission leads to disclosing these bits to a potential eavesdropper. The fraction of disclosed bits—the sampling rate-largely depends on the chosen approach for preliminary error estimation in the channel. This work is devoted to the optimization of the sampling rate for an LDPC code from the 5G\mathbf{5 G}5G standard. The results of our experiments show that for a QBER below 0.2 and key lengths of 264, 528, 792, and 1056 bits, it is necessary to disclose no more than 18%,11%,10%18 \%, 11 \%, 10 \%18%,11%,10%, and 7%7 \%7% of the key bits for error estimation, respectively. Furthermore, the proposed algorithm allows for similar optimization for any information reconciliation protocols and actual quantum bit error rates.
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.
An effective post-processing algorithm is essential for achieving high rates of secret key generation in quantum key distribution. This work introduces an approach to quantum key distribution post-processing by integrating the three main steps into a unified procedure: syndrome-based error estimation, rate-adaptive reconciliation, and subblock confirmation. The proposed scheme employs low-density parity-check codes to estimate the quantum bit error rate using the syndrome information, and to optimize the channel coding rates based on the Slepian-Wolf coding scheme for the rate-adaptive method. Additionally, this scheme incorporates polynomial-based hash verification in the subblock confirmation process. The numerical results show that the syndrome-based estimation significantly enhances the accuracy and consistency of the estimated quantum bit error rate, enabling effective code rate optimization for rate-adaptive reconciliation. The unified approach, which integrates rate-adaptive reconciliation with syndrome-based estimation and subblock confirmation, exhibits superior efficiency, minimizes practical information leakage, reduces communication rounds, and guarantees convergence to the identical key. Furthermore, the simulations indicate that the secret key throughput of this approach achieves the theoretical limit in the context of a BB84 quantum key distribution system.