Efficient Reconciliation of Continuous Variable Quantum Key Distribution with Multiplicatively Repeated Non-Binary LDPC Codes

Abstract

Continuous variable quantum key distribution bears the promise of simple quantum key distribution directly compatible with commercial off the shelf equipment. However, for a long time its performance was hindered by the absence of good classical postprocessing capable of distilling secret-keys in the noisy regime. Advanced coding solutions in the past years have partially addressed this problem enabling record transmission distances of up to 165 km, and 206 km over ultra-low loss fiber. In this paper, we show that a very simple coding solution with a single code is sufficient to extract keys at all noise levels. This solution has performance competitive with prior results for all levels of noise, and we show that non-zero keys can be distilled up to a record distance of 192 km assuming the standard loss of a single-mode optical fiber, and 240 km over ultra-low loss fibers. Low-rate codes are constructed using multiplicatively repeated non-binary low-density parity-check codes over a finite field of characteristic two. This construction only makes use of a (2,k)-regular non-binary low-density parity-check code as mother code, such that code design is in fact not required, thus trivializing the code construction procedure. The construction is also inherently rate-adaptive thereby allowing to easily create codes of any rate. Rate-adaptive codes are of special interest for the efficient reconciliation of errors over time or arbitrary varying channels, as is the case with quantum key distribution. In short, these codes are highly efficient when reconciling errors over a very noisy communication channel, and perform well even for short block-length codes. Finally, the proposed solution is known to be easily amenable to hardware implementations, thus addressing also the requirements for practical reconciliation in continuous variable quantum key distribution.

31 pages, 12 figures

References in corpus (21)

• Quantum Cryptography
• Quantum cryptography: Public key distribution and coin tossing
• Overcoming the rate-distance barrier of quantum key distribution without using quantum repeaters
• Quantum key distribution over 25 km with an all-fiber continuous-variable system
• Finite-size analysis of continuous-variable quantum key distribution
• Long-Distance Continuous-Variable Quantum Key Distribution over 202.81 km of Fiber
• Sending-or-Not-Sending with Independent Lasers: Secure Twin-Field Quantum Key Distribution Over 509 km
• Experimental Twin-Field Quantum Key Distribution Over 1000 km Fiber Distance
• Long Distance Continuous-Variable Quantum Key Distribution with a Gaussian Modulation
• Multidimensional reconciliation for continuous-variable quantum key distribution
• Reconciliation of a Quantum-Distributed Gaussian Key
• Key Reconciliation with Low-Density Parity-Check Codes for Long-Distance Quantum Cryptography
• High Bit Rate Continuous-Variable Quantum Key Distribution
• High speed error correction for continuous-variable quantum key distribution with multi-edge type LDPC code
• Continuous-Variable Quantum Key Distribution with Rateless Reconciliation Protocol
• Symmetric blind information reconciliation for quantum key distribution
• Fundamental Finite Key Limits for One-Way Information Reconciliation in Quantum Key Distribution
• Multi-edge-type LDPC code design with G-EXIT charts for continuous-variable quantum key distribution
• Design of Raptor Codes in the Low SNR Regime with Applications in Quantum Key Distribution
• On the problem of non-zero word error rates for fixed-rate error correction codes in continuous variable quantum key distribution
• Efficient Information Reconciliation for High-Dimensional Quantum Key Distribution

Cited by in corpus (1)

• Continuous-Variable Quantum Key Distribution with Composable Security and Tight Error Correction Bound towards Constrained-Device Implementations