2009/01/14 by David Elkouss, Anthony Leverrier, Romain Alléaume +3 · 98 citations
Computer Science · Mathematics · Physics and Astronomy · #Binary number #Channel (broadcasting) #Key (lock) #Key distribution #Protocol (science) #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum channel #Quantum cryptography #Quantum key distribution #cs.IT #math.IT #quant-ph
paper · pdf · doi:10.1109/isit.2009.5205475
arxiv created 2009/01/14 · openalex publication_date 2009/06/01 · arxiv updated 2011/04/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05
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.