High Performance Error Correction for Quantum Key Distribution using Polar Codes
arXiv:1204.5882
Abstract
We study the use of polar codes for both discrete and continuous variables Quantum Key Distribution (QKD). Although very large blocks must be used to obtain the efficiency required by quantum key distribution, and especially continuous variables quantum key distribution, their implementation on generic x86 CPUs is practical. Thanks to recursive decoding, they exhibit excellent decoding speed, much higher than large, irregular Low Density Parity Check (LDPC) codes implemented on similar hardware, and competitive with implementations of the same codes on high-end Graphic Processing Units (GPUs).
11 pages, 2 figures, 3 tables
References in corpus (8)
- Quantum key distribution over 25 km with an all-fiber continuous-variable system
- Long Distance Continuous-Variable Quantum Key Distribution with a Gaussian Modulation
- Multidimensional reconciliation for continuous-variable quantum key distribution
- Polar coding to achieve the Holevo capacity of a pure-loss optical channel
- Rate Compatible Protocol for Information Reconciliation: An application to QKD
- Performance and Construction of Polar Codes on Symmetric Binary-Input Memoryless Channels
- List Decoding of Polar Codes
- Interactive Reconciliation with Low-Density Parity-Check Codes