Comprehensive high-speed reconciliation for continuous-variable quantum key distribution

Guo, Dabo; He, Chao; Guo, Tianhao; Xue, Zhe; Feng, Qiang; Mu, Jianjian

doi:10.1007/s11128-020-02832-0

Cited by 16 publications

(5 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, we find for ǫ = 10 −9 , N = 10 9 and m = 5, the inequality 24 holds for any combination of the remaining parameters selected from the ranges V A ∈ [1,34], T ∈ [0, 1] and ξ = [0, 0.05]. 13 The values of ξ ch and ξ d in the standard CV-QKD settings are predicted values after accounting for all noise terms [17].…”

Section: B Optimised Ldpc Blocklength For Cv-qkd Reconciliationmentioning

confidence: 98%

“…However, through detailed numerical search we find that the inequality 24 holds for the range of parameters anticipated for realistic CV-QKD deployments. 12 For example, if we consider the following CV-QKD settings (in the following we refer to these as the standard CV-QKD settings); N = 10 9 , m = 5, ǫ EC = 2ǫ s = ǫ P A = ǫ P E = 2.5 × 10 −10 , V A = 5, T = 0.9, ξ ch = 0.0186 and ξ d = 0.0133 13 , we find that the LHS of the inequality is greater than 10 12 and the RHS of the inequality is less than 10 11 .…”

Section: B Optimised Ldpc Blocklength For Cv-qkd Reconciliationmentioning

confidence: 99%

“…However, as alluded to above, reconciling mN bits within a limited time frame can be challenging. State-of-the-art LDPCbased reconciliation schemes for CV-QKD systems involve parallelised computation on a Graphics Processing Unit (GPU) [13], [24] or Field-Programmable Gate Arrays (FPGAs) [25], [26]. Reconciliation schemes implemented on FPGAs offer more programmable flexibility, but sometimes at the cost of reduced memory access relative to GPUs.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Optimised Multithreaded CV-QKD Reconciliation for Global Quantum Networks

Ai¹,

Malaney²

2021

Preprint

View full text Add to dashboard Cite

Designing a practical Continuous Variable (CV) Quantum Key Distribution (QKD) system requires an estimation of the quantum channel characteristics and the extraction of secure key bits based on a large number of distributed quantum signals. Meeting this requirement in short timescales is difficult. On standard processors, it can take several hours to reconcile the required number of quantum signals. This problem is exacerbated in the context of Low Earth Orbit (LEO) satellite CV-QKD, in which the satellite flyover time is constrained to be less than a few minutes. A potential solution to this problem is massive parallelisation of the classical reconciliation process in which a large-code block is subdivided into many shorter blocks for individual decoding. However, the penalty of this procedure on the important final secured key rate is non-trivial to determine and hitherto has not been formally analysed. Ideally, a determination of the optimal reduced block size, maximising the final key rate, would be forthcoming in such an analysis. In this work, we fill this important knowledge gap via detailed analyses and experimental verification of a CV-QKD sliced reconciliation protocol that uses large block-length low-density parity-check decoders. Our new solution results in a significant increase in the final key rate relative to non-optimised reconciliation. In addition, it allows for the acquisition of quantum secured messages between terrestrial stations and LEO satellites within a flyover timescale even using off-the-shelf processors. Our work points the way to optimised global quantum networks secured via fundamental physics.

show abstract

Section: B Optimised Ldpc Blocklength For Cv-qkd Reconciliationmentioning

confidence: 98%

Section: B Optimised Ldpc Blocklength For Cv-qkd Reconciliationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Optimised Multithreaded CV-QKD Reconciliation for Global Quantum Networks

Ai¹,

Malaney²

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…Subsequently, Cardinal et al have proposed SEC which chooses a set of quantization functions to convert a continuous variable into binary-value slices and then executes error correction on the quantized slices [22], [23]. Soon after, many researchers apply code-modulated techniques including multilevel coding (MLC) and multistage decoding (MSD) in SEC with Low Density Parity Check (LDPC) codes to improve the reconciliation performance at high SNRs [33], [34]. The SEC scheme allows one to extract more than 1 bit of key from per pulse, especially at the high SNRs, but its quantization performance is poor at the low SNR of long-distance CV-QKD, which limits its secure distance to about 30 km.…”

Section: Introductionmentioning

confidence: 99%

Rotation Based Slice Error Correction Protocol for Continuous-variable Quantum Key Distribution and its Implementation with Polar Codes

Wen,

Li,

Mao

et al. 2021

Preprint

View full text Add to dashboard Cite

Reconciliation is an essential procedure for continuous-variable quantum key distribution (CV-QKD). As the most commonly used reconciliation protocol in short-distance CV-QKD, the slice error correction (SEC) allows a system to distill more than 1 bit from each pulse. However, its quantization efficiency is greatly affected by the noisy channel with a low signal-to-noise ratio (SNR), which usually limits the secure distance to about 30 km. In this paper, an improved SEC protocol, named Rotation-based SEC (RSEC), is proposed through performing a random orthogonal rotation on the raw data before quantization, and deducing a new estimator for quantized sequences. Moreover, the RSEC protocol is implemented with polar codes. Experimental results show that the proposed protocol can reach up to a quantization efficiency of about 99%, and maintains at around 96% even at the relatively low SNRs (0.5, 1), which theoretically extends the secure distance to about 45 km. When implemented with the polar codes with block length of 16 Mb, the RSEC can achieve a reconciliation efficiency of above 95%, which outperforms all previous SEC schemes. In terms of finite-size effects, we achieve a secret key rate of 7.83 × 10 −3 bits/pulse at a distance of 33.93 km (the corresponding SNR value is 1). These results indicate that the proposed protocol significantly improves the performance of SEC and is a competitive reconciliation scheme for the CV-QKD system.

show abstract

“…If QBER is higher than the determined threshold, because of the nocloning theorem [10], it shows that Eve spoofs the connection and the key is not safe anymore. Otherwise, the next step is begun, 3-B uses a reconciliation algorithm [11][12][13][14][15][45][46][47] to correct the errors and then uses some privacy amplification methods [16,17] to remove the disclosed information along the reconciliation step. Key reconciliation is important because using an efficient approach with minimum information leakage, in addition to increase secure key generation rate, it impacts on the security of the communication between two sides.…”

Section: -Introductionmentioning

confidence: 99%

Error Reconciliation based on Integer Linear Programming in Quantum Key Distribution

Eskandari¹,

Mohammad²

2021

jist

View full text Add to dashboard Cite

Quantum telecommunication has received a lot of attention today by providing unconditional security because of the inherent nature of quantum channels based on the no-cloning theorem. In this mode of communication, first, the key is sent through a quantum channel that is resistant to eavesdropping, and then secure communication is established using the exchanged key. Due to the inevitability of noise, the received key needs to be distilled. One of the vital steps in key distillation is named key reconciliation which corrects the occurred errors in the key. Different solutions have been presented for this issue, with different efficiency and success rate. One of the most notable works is LDPC decoding which has higher efficiency compared to the others, but unfortunately, this method does not work well in the codes with a high rate. In this paper, we present an approach to correct the errors in the high rate LDPC code-based reconciliation algorithm. The proposed algorithm utilizes Integer Linear Programming to model the error correction problem to an optimization problem and solve it. Testing the proposed approach through simulation, we show it has high efficiency in high rate LDPC codes as well as a higher success rate compared with the LDPC decoding method -belief propagationin a reasonable time.

show abstract

Comprehensive high-speed reconciliation for continuous-variable quantum key distribution

Cited by 16 publications

References 34 publications

Optimised Multithreaded CV-QKD Reconciliation for Global Quantum Networks

Optimised Multithreaded CV-QKD Reconciliation for Global Quantum Networks

Rotation Based Slice Error Correction Protocol for Continuous-variable Quantum Key Distribution and its Implementation with Polar Codes

Error Reconciliation based on Integer Linear Programming in Quantum Key Distribution

Contact Info

Product

Resources

About