Problems in application of LDPC codes to information reconciliation in quantum key distribution protocols

Abstract

The information reconciliation in a quantum key distribution protocol can be studied separately from other steps in the protocol. The problem of information reconciliation can be reduced to that of distributed source coding. Its solution by LDPC codes is reviewed. We list some obstacles preventing the LDPC-based distributed source coding from becoming a more favorable alternative to the Cascade protocol for information reconciliation in quantum key distribution protocols. This exposition does not require knowledge of the quantum theory.

10 pages, 1 figure. short survey article

References in corpus (14)

• Simple Proof of Security of the BB84 Quantum Key Distribution Protocol
• Quantum key distribution using gaussian-modulated coherent states
• An information-theoretic security proof for QKD protocols
• Unconditional security proof of long-distance continuous-variable quantum key distribution with discrete modulation
• Multidimensional reconciliation for continuous-variable quantum key distribution
• Secure quantum key distribution with an uncharacterized source
• Upper bounds of eavesdropper's performances in finite-length code with decoy method
• Practical Evaluation of Security for Quantum Key Distribution
• Tomography increases key rates of quantum-key-distribution protocols
• Key rate of quantum key distribution with hashed two-way classical communication
• Method for decoupling error correction from privacy amplification
• Side-Information Coding with Turbo Codes and its Application to Quantum Key Distribution
• Noise Tolerance of the BB84 Protocol with Random Privacy Amplification
• Efficiently implementable codes for quantum key expansion