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.
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.
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.
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.
Quantum key distribution protocols (QKD) identify eavesdroppers on quantum channel based on laws of quantum mechanics. In the original BB84 protocol, unauthorized measurements on qubits are discovered after Alice and Bob sacrifice some random resulting key bits as a test and find out a mismatch rate. Decoy state protocol alerts photon number splitting attack when the decoy multiphoton pulses deliberately positioned by Alice are registered abnormally higher at Bob’s detectors than the single photon pulses are. E91 protocol is the first QKD protocol that ever brought about entangled atoms. Based on Bell’s theorem, a probability coefficient is constrained within a fixed range under the circumstances of interception. While in practice, bit error rate (BER) is not necessarily associated with vicious eavesdropping. Detection inefficiency, transmission loss, imperfect entanglement sources and many other factors contribute as false alarms. Error correction is an essential post-processing procedure to tolerate implementation limits, yet secure the accuracy of the transmitted key. Quantifying third party contaminations also helps setting an optimal BER threshold to decide if one should abandon all previous communications. In this work, we summarize major causes of bit error in various practical QKD protocols mentioned above and study whether error correction models, such as low-density parity-check code (LDPC), perform accordingly to different kinds of errors.
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.
The authors consider error correction in quantum key distribution. To avoid that Alice and Bob unwittingly end up with different keys, precautions must be taken. Before running the error correction protocol, Bob and Alice normally sacrifice some bits to estimate the error rate. To reduce the probability that they end up with different keys to an acceptable level, the authors show that a large number of bits must be sacrificed. Instead, if Alice and Bob can make a good guess about the error rate before the error correction, they can verify that their keys are similar after the error correction protocol. In this study, the authors show that this verification can be done by utilising properties of low‐density parity check codes used in the error correction. The authors compare the different methods and show that by verification it is often possible to sacrifice less bits without compromising security. The improvement is heavily dependent on the error rate and the block length, but for a key produced by the IdQuantique system Clavis 2 , the increase in the key rate is ∼5%. The authors also show that for systems with large fluctuations in the error rate, a combination of the two methods is optimal.
Error correction is a crucial stage in quantum key distribution (QKD) protocols—a promising field of modern cryptography where the secrecy of the shared key information is guaranteed by the laws of quantum mechanics. Currently, there are many effective approaches to error correction in QKD. However, most of them, due to their generic nature, fail to leverage the specific features of particular protocol implementations. This work demonstrates that accounting for the hardware specifics of a QKD system implementing the time-bin protocol enables a significant increase in error correction performance. For the considered QKD system, we have experimentally obtained estimates of the Quantum Bit Error Rate (QBER) observed for each combination of bit and detector. The differences in the obtained estimates reveal that the quantum channel can be modeled as a non-uniform binary channel. Furthermore, based on computational experiments with a model of the quantum channel, it was established that adapting the error correction procedure to its properties can achieve up to a 2.7-fold reduction in the LDPC code decoding failure rate at low error levels.