A Reconciliation Strategy for Real-Time Satellite-Based QKD

In practical Quantum Key Distribution (QKD) deployments we would like to design QKD solutions that provide for a target QKD key rate, in bits/pulse, at a specified upper-limit on the failure probability. However, in the finite-signalling setting, in which all real-world QKD systems exist, the common practice of achieving such a solution fails to deliver the maximum throughput rate of the classical decoder. This in turn means that the possibility that classical reconciliation becomes the bottleneck of the entire QKD protocol is not minimised. A design strategy that minimises this latter possibility, whilst achieving a target QKD rate with a target ceiling on the failure probability has not been developed – a situation we remedy here. Although our new design strategy detailed here is for LDPC codes and applied to two specific QKD protocols, the same strategy is generally applicable to all classical decoders and all QKD protocols. It is also deployable even in circumstances where the quantum bit error is variable, such as in satellite QKD systems.

[1]  Hoi-Kwong Lo,et al.  Quantum key distribution with setting-choice-independently correlated light sources , 2018 .

[2]  Daniel A. Spielman,et al.  Improved low-density parity-check codes using irregular graphs and belief propagation , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[3]  Shie Mannor,et al.  Fully Parallel Stochastic LDPC Decoders , 2008, IEEE Transactions on Signal Processing.

[4]  Hoi-Kwong Lo,et al.  Loss-tolerant quantum cryptography with imperfect sources , 2013, 1312.3514.

[5]  Rüdiger L. Urbanke,et al.  Parity-check density versus performance of binary linear block codes over memoryless symmetric channels , 2003, IEEE Transactions on Information Theory.

[6]  Wei Yu,et al.  Design of irregular LDPC codes with optimized performance-complexity tradeoff , 2010, IEEE Transactions on Communications.

[7]  Evangelos Eleftheriou,et al.  Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.

[8]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[9]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[10]  David Elkouss,et al.  Rate compatible protocol for information reconciliation: An application to QKD , 2010, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

[11]  Marco Tomamichel,et al.  Tight finite-key analysis for quantum cryptography , 2011, Nature Communications.

[12]  Gilles Brassard,et al.  Quantum cryptography: Public key distribution and coin tossing , 2014, Theor. Comput. Sci..

[13]  Hoi-Kwong Lo,et al.  Efficient Quantum Key Distribution Scheme and a Proof of Its Unconditional Security , 2004, Journal of Cryptology.

[14]  Marco Lucamarini,et al.  10-Mb/s Quantum Key Distribution , 2018, Journal of Lightwave Technology.

[15]  S. Litsyn,et al.  An efficient message-passing schedule for LDPC decoding , 2004, 2004 23rd IEEE Convention of Electrical and Electronics Engineers in Israel.

[16]  Yongmei Huang,et al.  Satellite-to-ground quantum key distribution , 2017, Nature.

[17]  Simon Litsyn,et al.  Efficient Serial Message-Passing Schedules for LDPC Decoding , 2007, IEEE Transactions on Information Theory.