当前位置: X-MOL 学术Quantum Inf. Process. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Novel reconciliation protocol based on spinal code for continuous-variable quantum key distribution
Quantum Information Processing ( IF 2.5 ) Pub Date : 2020-09-22 , DOI: 10.1007/s11128-020-02853-9
Xuan Wen , Qiong Li , Haokun Mao , Yi Luo , Bingze Yan , Furong Huang

Reconciliation is a crucial procedure in post-processing of continuous-variable quantum key distribution (CV-QKD) system, which is used to make two distant legitimate parties share identical corrected keys. The adaptive reconciliation is necessary for practical systems to cope with the variable channel. Many researchers adopt fixed-rate error correction codes to implement adaptive reconciliation, such as the punctured LDPC code; however such protocol can achieve high efficiency only in a small range of signal-to-noise ratios (SNRs). In this paper, the spinal-based rateless reconciliation protocol for CV-QKD is first proposed. The proposed adaptive reconciliation protocol can achieve high efficiency in a much larger range of SNRs. Because the protocol we propose uses the code with short length and simple encoding/decoding structure, the design and implementation complexities of our protocol are greatly decreased. Meanwhile, its parallel attribute makes it suitable for hardware implementation, which means it has the potential of achieving high-throughput reconciliation. Moreover, the security of proposed protocol is investigated and proved. Experimental results show that the reconciliation efficiency of the spinal-based protocol maintains around \(95\%\) in a larger SNR range (0,0.5), and even exceeds \(96.5\%\) at extremely low SNR (\(\le 0.032\)) with quite low frame error rate (FER) (\(\le 5.2\%\)). Both the theoretical analysis and experimental results demonstrate that the proposed adaptive reconciliation protocol is a suitable candidate for the long-distance CV-QKD systems.



中文翻译:

基于脊柱码的连续变量量子密钥分配新和解协议

和解是连续变量量子密钥分配(CV-QKD)系统的后处理中的关键程序,该系统用于使两个遥远的合法方共享相同的校正密钥。对于实际系统来说,自适应调节是必须的,以应对可变信道。许多研究人员采用固定速率的纠错码来实现自适应对账,例如穿孔的LDPC码。但是,这种协议只能在较小的信噪比(SNR)范围内实现高效率。本文首先提出了基于脊柱的无速率CV-QKD和解协议。所提出的自适应和解协议可以在更大的SNR范围内实现高效率。由于我们提出的协议使用的是长度较短且编码/解码结构简单的代码,我们协议的设计和实现复杂度大大降低了。同时,其并行属性使其适用于硬件实现,这意味着它具有实现高吞吐量协调的潜力。此外,对所提出协议的安全性进行了研究和证明。实验结果表明,基于脊柱协议的和解效率保持在\(95 \%\)在较大的SNR范围(0,0.5)中,甚至在极低的SNR(\(\ le 0.032 \))且具有相当低的帧错误率(FER)时甚至超过\(96.5 \%\) (\(\ le 5.2 \%\))。理论分析和实验结果均表明,所提出的自适应和解协议是长距离CV-QKD系统的合适候选者。

更新日期:2020-09-22
down
wechat
bug