Error Estimation, Error Correction and Verification In Quantum Key Distribution

TL;DR

This paper explores improved error estimation and verification methods in quantum key distribution to reduce bit sacrifice and enhance key rate, especially when error rates fluctuate.

Contribution

It introduces a verification approach using Low Density Parity Check codes that reduces the need for sacrificing bits compared to traditional error estimation methods.

Findings

Verification can reduce bit sacrifice by up to 5% in certain systems.

Combining error estimation and verification is optimal for fluctuating error rates.

Verification is effective when error rates are well predicted before error correction.

Abstract

We 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, we 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. This verification can be done by utilizing properties of Low Density Parity Check codes used in the error correction. We compare the 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 approximately 5 percent. We also show that for systems with large fluctuations in the error rate a combination of the two methods is optimal.