Efficient reconciliation protocol for discrete-variable quantum key distribution
- 1 June 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1879-1883
Abstract
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.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Tomography increases key rates of quantum-key-distribution protocolsPhysical Review A, 2008
- Quantum Cryptography with Finite Resources: Unconditional Security Bound for Discrete-Variable Protocols with One-Way PostprocessingPhysical Review Letters, 2008
- Multidimensional reconciliation for a continuous-variable quantum key distributionPhysical Review A, 2008
- Low cost and compact quantum key distributionNew Journal of Physics, 2006
- Information-theoretic security proof for quantum-key-distribution protocolsPhysical Review A, 2005
- Minimizing the real functions of the ICEC'96 contest by differential evolution2002
- Design of efficient erasure codes with differential evolution2002
- On the design of low-density parity-check codes within 0.0045 dB of the Shannon limitIEEE Communications Letters, 2001
- Design of capacity-approaching irregular low-density parity-check codesIEEE Transactions on Information Theory, 2001
- Low-density parity-check codesIEEE Transactions on Information Theory, 1962