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

Science Technology and Engineering

Simulation Analysis of the Performance of Parity-hamming Error-correcting Algorithm and Error Rate Estimation

Jing Min-yin

Published Jan 1, 2014• 2 citations
OpenAlex

Abstract

Quantum key distribution uses quantum and classical channel to complete the growing of a secret key,because of imperfect devices and eavesdropping generate error,need to be corrected relying on classical channel.Use the hamming code in the block codes to achieve error-correcting,simulation analysis of the relationship between generation efficiency of key and the initial error rate,or generation efficiency of key and different codeword length.The results showed that at higher bit error rate,using shorter code,at lower bit error rate,using longer code,can improve the generation efficiency of key,the level of the bit error rate based on the estimated bit error rate.

Related papers

Performance of an improved one-way error reconciliation protocol based on key redistribution

Zhao Feng, Li Jingling

In data post-processing for quantum key distribution, it is essential to have a highly efficient error reconciliation protocol. Based on the key redistribution scheme, we analyze a one-way error reconciliation protocol by data simulation. The relationship between the error correction capability and the key generation efficiency of three kinds of Hamming code are demonstrated. The simulation results indicate that when the initial error rates are (0,1.5%], (1.5,4%], and (4,11%], using the Hamming (31,26), (15,11), and (7,4) codes to correct the error, respectively, the key generation rate will be maximized. Based on this, we propose a modified one-way error reconciliation protocol which employs a mixed Hamming code concatenation scheme. The error correction capability and key generation rate are verified through data simulation. Using the parameters of the posterior distribution based on the tested data, a simple method for estimating the bit error rate (BER) with a given confidence interval is estimated. The simulation results show that when the initial bit error rate is 10.00%, after 7 rounds of error correction, the error bits are eliminated completely, and the key generation rate is 10.36%; the BER expectation is 2.96 × 10-10, and when the confidence is 95% the corresponding BER upper limit is 2.17 × 10-9. By comparison, for the single (7,4) Hamming code error reconciliation scheme at a confidence of 95%, the key generation rate is only 6.09%, while the BER expectation is 5.92 × 10-9, with a BER upper limit of 4.34 × 10-8. Hence, our improved protocol is much better than the original one.

China Communications•Jun 1, 2014•9 citations

Estimates for BER of error correcting on finite quantum key

Zhao Fen

Based on the parameters of posterior distribution of bit error rate(BER) regarding parity checkHamming correction protocol,the BER and its confidence interval of the remaining quantum keys were directly estimated.In experiment,instead of the raw quantum keys,two pseudo-random binary sequences were used which have the length of 1.4×10~(-7) and the BER follow binomial distribution.The error correction process utilizes the parity code and Hamming code for error detection correction respectively.The experimental results showed that when the initial bit error rate at 3%and 0.1%,by one time error detection and error correction,the BER falls to 2.47×10~(-3) and 1.43×10~(-7) respectively,when the confidence at 95%,the corresponding upper limit of BER at 2.77×10~(-3) and 10.57×10~(-7) respectively.These experimental results effectively assessed parity-Hamming error correction performance on the finite quantum keys,and provided reliable data for the post-processing in the quantum key distribution.

Chinese Journal of Quantum Electronics•Jan 1, 2014•0 citations

High-efficiency quantum-key-distribution error-correction algorithm based on the Gilbert-Elliott model and the low-density parity-check code

Ke Cui, Xianglong Xia, Simeng Li +3 more

For the post-processing of the quantum-key-distribution (QKD) system, the error correction is the most important step, whose efficiency significantly influences the final key generation rate. Traditionally, the error-correction algorithm is developed based on the binary symmetrical channel model. However, this may not comply with the actual channel status. For example, for the fiber-based QKD system, differentiable statuses of the fiber (unstable or steady) should exist for some time and cause different bit error rates. If this channel feature can be exploited, it may considerably improve the error-correction efficiency. This paper proposes to introduce the Gilbert-Elliott (GE) model to analyze the QKD channel. The error-correction algorithm adopts the low-density parity-check (LDPC) code. The GE nodes are added into the traditional belief propagation (BP) algorithm of the LDPC decoder. Simulation results showed that the remaining frame error rate could be improved from ${10}^{\ensuremath{-}2}$ (or ${10}^{\ensuremath{-}3}$) to ${10}^{\ensuremath{-}4}$. An actual QKD system with the quantum channel state under manual control was adopted to collect the key bit string. By analyzing the occurrence probability of the $k$ consecutive "1," the key bit string showed closely matched distribution with the GE model prediction. After the error correction, the remaining bit error rate of the modified BP algorithm was significantly smaller than that of the standard BP algorithm with an improvement of more than 2 orders of magnitude. Both simulation and actual experimental results demonstrate that our proposed method can greatly improve the error-correction efficiency if the channel characteristic of the QKD system is accurately exploited, which provides an efficient way to generate a higher key rate.

Physical Review A•Aug 11, 2025•0 citations

Application of Hamming Code Based Error Correction Algorithm in Quantum Key Distribution System

Xiaodong Zhong, Ge Jin

In the quantum key distribution system, one party needs to share the quantum state to the other through a quantum channel. However, due to external influences, the quantum state may change during transmission, resulting in a certain error in the original key acquired by the receiver. In this paper, an error correction algorithm based on Hamming code is proposed and verified in the quantum key distribution system. The algorithm can adapt to different bit error rate scenarios by variable length coding. Besides, the algorithm can correct the random error as well as burst error in the original key after combining the key interleaving algorithm.

International Conference on Electronics Technology (ICET)•May 1, 2020•10 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

Research on error-correction algorithm of high-speed QKD system based on FPGA

Shi-Biao Tang, Jie Cheng

In the process of quantum key distribution (QKD), error correction algorithm is used to correct the error bits of the key at both ends. The existing applied QKD system has a low key rate and is generally Kbps of magnitude. Therefore, the performance requirement of data processing such as error correction is not high. In order to cope with the development demand of high-speed QKD system in the future, this paper introduces the Winnow algorithm to realize high-speed parity and hamming error correction based on Field Programmable Gate Array (FPGA), and explores the performance limit of this algorithm. FPGA hardware implementation can achieve the scale of Mbps bandwidth, with choosing different group length of sifted key by different error rate, and can achieve higher error correction efficiency by reducing the information leakage in the process of error correction, and improves the QKD system’s secure key rate, thus helping the future high-speed QKD system.

International Journal of Quantum Information•Mar 1, 2019•2 citations
Quantum key distribution uses quantum and classical channel to complete the growing of a secret key,because of imperfect devices and eavesdropping generate error,need to be corrected relying on classical channel.Use the hamming code in the block codes to achieve error-correcting,simulation analysis of the relationship between generation efficiency of key and the initial error rate,or generation efficiency of key and different codeword length.The results showed that at higher bit error rate,using shorter code,at lower bit error rate,using longer code,can improve the generation efficiency of key,the level of the bit error rate based on the estimated bit error rate.
In data post-processing for quantum key distribution, it is essential to have a highly efficient error reconciliation protocol. Based on the key redistribution scheme, we analyze a one-way error reconciliation protocol by data simulation. The relationship between the error correction capability and the key generation efficiency of three kinds of Hamming code are demonstrated. The simulation results indicate that when the initial error rates are (0,1.5%], (1.5,4%], and (4,11%], using the Hamming (31,26), (15,11), and (7,4) codes to correct the error, respectively, the key generation rate will be maximized. Based on this, we propose a modified one-way error reconciliation protocol which employs a mixed Hamming code concatenation scheme. The error correction capability and key generation rate are verified through data simulation. Using the parameters of the posterior distribution based on the tested data, a simple method for estimating the bit error rate (BER) with a given confidence interval is estimated. The simulation results show that when the initial bit error rate is 10.00%, after 7 rounds of error correction, the error bits are eliminated completely, and the key generation rate is 10.36%; the BER expectation is 2.96 × 10-10, and when the confidence is 95% the corresponding BER upper limit is 2.17 × 10-9. By comparison, for the single (7,4) Hamming code error reconciliation scheme at a confidence of 95%, the key generation rate is only 6.09%, while the BER expectation is 5.92 × 10-9, with a BER upper limit of 4.34 × 10-8. Hence, our improved protocol is much better than the original one.
Based on the parameters of posterior distribution of bit error rate(BER) regarding parity checkHamming correction protocol,the BER and its confidence interval of the remaining quantum keys were directly estimated.In experiment,instead of the raw quantum keys,two pseudo-random binary sequences were used which have the length of 1.4×10~(-7) and the BER follow binomial distribution.The error correction process utilizes the parity code and Hamming code for error detection correction respectively.The experimental results showed that when the initial bit error rate at 3%and 0.1%,by one time error detection and error correction,the BER falls to 2.47×10~(-3) and 1.43×10~(-7) respectively,when the confidence at 95%,the corresponding upper limit of BER at 2.77×10~(-3) and 10.57×10~(-7) respectively.These experimental results effectively assessed parity-Hamming error correction performance on the finite quantum keys,and provided reliable data for the post-processing in the quantum key distribution.
For the post-processing of the quantum-key-distribution (QKD) system, the error correction is the most important step, whose efficiency significantly influences the final key generation rate. Traditionally, the error-correction algorithm is developed based on the binary symmetrical channel model. However, this may not comply with the actual channel status. For example, for the fiber-based QKD system, differentiable statuses of the fiber (unstable or steady) should exist for some time and cause different bit error rates. If this channel feature can be exploited, it may considerably improve the error-correction efficiency. This paper proposes to introduce the Gilbert-Elliott (GE) model to analyze the QKD channel. The error-correction algorithm adopts the low-density parity-check (LDPC) code. The GE nodes are added into the traditional belief propagation (BP) algorithm of the LDPC decoder. Simulation results showed that the remaining frame error rate could be improved from ${10}^{\ensuremath{-}2}$ (or ${10}^{\ensuremath{-}3}$) to ${10}^{\ensuremath{-}4}$. An actual QKD system with the quantum channel state under manual control was adopted to collect the key bit string. By analyzing the occurrence probability of the kkk consecutive "1," the key bit string showed closely matched distribution with the GE model prediction. After the error correction, the remaining bit error rate of the modified BP algorithm was significantly smaller than that of the standard BP algorithm with an improvement of more than 2 orders of magnitude. Both simulation and actual experimental results demonstrate that our proposed method can greatly improve the error-correction efficiency if the channel characteristic of the QKD system is accurately exploited, which provides an efficient way to generate a higher key rate.
In the quantum key distribution system, one party needs to share the quantum state to the other through a quantum channel. However, due to external influences, the quantum state may change during transmission, resulting in a certain error in the original key acquired by the receiver. In this paper, an error correction algorithm based on Hamming code is proposed and verified in the quantum key distribution system. The algorithm can adapt to different bit error rate scenarios by variable length coding. Besides, the algorithm can correct the random error as well as burst error in the original key after combining the key interleaving algorithm.
การกระจายกุญแจรหัสลับเชิงควอนตัมถือเป็นหนึ่งในเทคโนโลยีความปลอดภัยด้านการสื่อสาร โดยอาศัยหลักกลศาสตร์ควอนตัมเพื่อกำเนิดและแลกเปลี่ยนข้อมูลกุญแจรหัสลับระหว่างคู่สื่อสารให้มีความปลอดภัยสูงสุดสำหรับระบบวิทยาการรหัสลับ ซึ่งต้องอาศัยกระบวนการไกล่เกลี่ยความผิดพลาดเพื่อจุดประสงค์ในการยืนยันความถูกต้องของข้อมูลกุญแจรหัสลับระหว่างคู่สื่อสารให้มีค่าที่ตรงกัน ในบทความนี้ นำเสนอวิธีการประมาณค่าอัตราความผิดพลาดของช่องสัญญาณเชิงควอนตัมบนพื้นฐานของการประมาณค่าภาวะน่าจะเป็นสูงสุดจากชุดข้อมูลซินโดรมในระหว่างขั้นตอนการไกล่เกลี่ยความผิดพลาดสำหรับการปรับค่าอัตราการเข้ารหัสให้เหมาะสมกับความผิดพลาดของบิตข้อมูลกุญแจเชิงควอนตัมที่เกิดขึ้นในแต่ละช่วงเวลาด้วยรหัสตรวจสอบพาริตี้แบบความหนาแน่นต่ำ ตลอดจนการนำมาประยุกต์ใช้แทนขั้นตอนการเปิดเผยบิตข้อมูลกุญแจบางส่วนที่สูญเสียไปในการประมาณค่าความผิดพลาดแบบดั้งเดิม นำไปสู่ผลลัพธ์ของขนาดบิตข้อมูลกุญแจที่เพิ่มสูงขึ้น โดยจากการวิเคราะห์และทดสอบผลพบว่า วิธีการที่นำเสนอให้ความแม่นยำในการประมาณค่าอัตราความผิดพลาดครอบคลุมเงื่อนไขของการกระจายกุญแจรหัสลับเชิงควอนตัม นำไปสู่การเพิ่มประสิทธิภาพการไกล่เกลี่ยความผิดพลาดที่สูงขึ้นทั้งในด้านความปลอดภัยและอัตราการกำเนิดกุญแจรหัสลับ สนับสนุนการประยุกต์ใช้งานจริงในระบบการกระจายกุญแจรหัสลับเชิงควอนตัมความเร็วสูง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.
In the process of quantum key distribution (QKD), error correction algorithm is used to correct the error bits of the key at both ends. The existing applied QKD system has a low key rate and is generally Kbps of magnitude. Therefore, the performance requirement of data processing such as error correction is not high. In order to cope with the development demand of high-speed QKD system in the future, this paper introduces the Winnow algorithm to realize high-speed parity and hamming error correction based on Field Programmable Gate Array (FPGA), and explores the performance limit of this algorithm. FPGA hardware implementation can achieve the scale of Mbps bandwidth, with choosing different group length of sifted key by different error rate, and can achieve higher error correction efficiency by reducing the information leakage in the process of error correction, and improves the QKD system’s secure key rate, thus helping the future high-speed QKD system.