Error estimation, error correction and verification in quantum key distribution

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 similar to 5%. The authors also show that for systems with large fluctuations in the error rate, a combination of the two methods is optimal.