Efficient reconciliation protocol for discrete-variable quantum key distribution
David Elkouss, Anthony Leverrier, Romain Alleaume, Joseph J. Boutros · 2009
Reconciliation is an essential part of any secret-key agreement protocol and hence of a quantum key distribution (QKD) protocol, where two legitimate parties are given correlated data and want to agree on a common string in the presence of an adversary, while revealing a minimum amount of information. In this paper, we show that for discrete-variable QKD protocols, this problem can be advantageously solved with low density parity check (LDPC) codes optimized for the binary symmetric channel (BSC). In particular, we demonstrate that our method leads to a significant improvement of the achievable secret key rate, with respect to earlier interactive reconciliation methods used in QKD.