Continuous-variable quantum key distribution with low-complexity information reconciliation
Xiangyu Wang, Hongjie Wang, Chao Zhou, Ziyang Chen, Song Yu, Hong Guo
Abstract
Information reconciliation is an essential step of continuous-variable quantum key distribution (CV-QKD) because its efficiency affects both the maximum transmission distance and the final secret key rate of the whole system. Slice reconciliation can achieve high secret key rates for the CV-QKD systems under high signal-to-noise ratios (SNRs). However, it suffers from the high designing cost of the error-correcting codes in the multi-level coding and multi-stage decoding step. To reconcile one set of data with fixed SNR, multiple error-correcting codes with different code rates need to be designed. If the channel environment changed, the code rates need to change along to maintain high reconciliation efficiency, making it complicated and costly. In this paper, we introduce polar codes into slice reconciliation and proposed a scheme that is simply constructed, effectively performed, and well adapted to the systems with wide-range and variational SNRs. Simulation results show that the proposed scheme offers reconciliation efficiency over 95% for the systems with SNRs range from 1 to 10, which can support the systems with high secret key rates. The decrease of complexity and the increase of secret key rate have great significance for a practical CV-QKD system.