Can encrypted communication be secure at practical speeds? The authors propose a $r\phantom{\rule{0}{0ex}}a\phantom{\rule{0}{0ex}}t\phantom{\rule{0}{0ex}}e\phantom{\rule{0}{0ex}}l\phantom{\rule{0}{0ex}}e\phantom{\rule{0}{0ex}}s\phantom{\rule{0}{0ex}}s$ $r\phantom{\rule{0}{0ex}}e\phantom{\rule{0}{0ex}}c\phantom{\rule{0}{0ex}}o\phantom{\rule{0}{0ex}}n\phantom{\rule{0}{0ex}}c\phantom{\rule{0}{0ex}}i\phantom{\rule{0}{0ex}}l\phantom{\rule{0}{0ex}}i\phantom{\rule{0}{0ex}}a\phantom{\rule{0}{0ex}}t\phantom{\rule{0}{0ex}}i\phantom{\rule{0}{0ex}}o\phantom{\rule{0}{0ex}}n$ $p\phantom{\rule{0}{0ex}}r\phantom{\rule{0}{0ex}}o\phantom{\rule{0}{0ex}}t\phantom{\rule{0}{0ex}}o\phantom{\rule{0}{0ex}}c\phantom{\rule{0}{0ex}}o\phantom{\rule{0}{0ex}}l$ to overcome the technical difficulties for efficient error correction at different signal-to-noise ratios (SNRs), and therefore to significantly improve the performance of continuous-variable quantum key distribution (CV-QKD). Using this method, highly efficient key extraction can be maintained even at ultralow SNR. This method remarkably reduces the complexity of reconciliation, improves the robustness of practical systems, and can significantly improve the post-processing performance of CV-QKD, bringing secure quantum communication one step closer to everyday use.
Can encrypted communication be secure at practical speeds? The authors propose a r\phantom{\rule{0}{0ex}}a\phantom{\rule{0}{0ex}}t\phantom{\rule{0}{0ex}}e\phantom{\rule{0}{0ex}}l\phantom{\rule{0}{0ex}}e\phantom{\rule{0}{0ex}}s\phantom{\rule{0}{0ex}}sr\phantom{\rule{0}{0ex}}e\phantom{\rule{0}{0ex}}c\phantom{\rule{0}{0ex}}o\phantom{\rule{0}{0ex}}n\phantom{\rule{0}{0ex}}c\phantom{\rule{0}{0ex}}i\phantom{\rule{0}{0ex}}l\phantom{\rule{0}{0ex}}i\phantom{\rule{0}{0ex}}a\phantom{\rule{0}{0ex}}t\phantom{\rule{0}{0ex}}i\phantom{\rule{0}{0ex}}o\phantom{\rule{0}{0ex}}np\phantom{\rule{0}{0ex}}r\phantom{\rule{0}{0ex}}o\phantom{\rule{0}{0ex}}t\phantom{\rule{0}{0ex}}o\phantom{\rule{0}{0ex}}c\phantom{\rule{0}{0ex}}o\phantom{\rule{0}{0ex}}l to overcome the technical difficulties for efficient error correction at different signal-to-noise ratios (SNRs), and therefore to significantly improve the performance of continuous-variable quantum key distribution (CV-QKD). Using this method, highly efficient key extraction can be maintained even at ultralow SNR. This method remarkably reduces the complexity of reconciliation, improves the robustness of practical systems, and can significantly improve the post-processing performance of CV-QKD, bringing secure quantum communication one step closer to everyday use.
In continuous-variable (CV) quantum key distribution (QKD), the reconciliation efficiency and frame error rate of the information reconciliation have a significant impact on the secret key rate. For a fixed-rate multiedge-type low-density parity-check (LDPC) code, the reconciliation efficiency and frame error rate will inevitably vary due to the fluctuations of the signal-to-noise ratio (SNR) of the CV QKD system, which degrades the performance of the system. We propose a high-efficiency rate-adaptive information reconciliation scheme by combining raptorlike (RL) LDPC codes with the addition of trusted noises. We establish the model of adding trusted noises and combine it with the RL LDPC codes to optimize the secret key rate under the time-varying channel. The simulation results show that our scheme can maintain a high reconciliation efficiency of more than 94.4% and a low frame error rate within 15% fluctuation range of the SNR. Furthermore, we implement the hardware acceleration of the proposed rate-adaptive scheme on a graphics processing unit and achieve a decoding throughput of 65.5 Mbits/s by optimizing the storage of the parity-check matrix. Our results are useful for the practical CV QKD under the realistic time-varying channel.
Information reconciliation significantly impacts the performance of the practical continuous-variable quantum key distribution (CV QKD) system. Fixed-rate error-correction codes limit the potential applications of the CV QKD because they lead to reduced reconciliation efficiency when the signal-to-noise ratio of the quantum channel changes, further deteriorating the system's performance. Therefore, we propose a rate-adaptive polar-coding-based reconciliation scheme for practical CV QKD systems with the time-variant quantum channel. Experimental results verify that the proposed scheme can successfully extract secret keys within the range of signal-to-noise ratios from $\ensuremath{-}0.5$ to $\ensuremath{-}4.5$ dB, and the minimum frame-error rate can be less than ${10}^{\ensuremath{-}3}$. Moreover, the proposed scheme can promote the application of the CV QKD system in a realistic environment.
Information reconciliation protocol has a significant effect on the secret key rate and maximal transmission distance of continuous-variable quantum key distribution (CVQKD) systems. We propose an efficient rate-adaptive reconciliation protocol suitable for practical CV-QKD systems with time-varying quantum channel. This protocol changes the code rate of multi-edge type low density parity check codes, by puncturing (increasing the code rate) and shortening (decreasing the code rate) techniques, to enlarge the correctable signal-to-noise ratios regime, thus improves the overall reconciliation efficiency comparing to the original fixed rate reconciliation protocol. We verify our rate-adaptive reconciliation protocol with three typical code rate, i.e., 0.1, 0.05 and 0.02, the reconciliation efficiency keep around 93.5%, 95.4% and 96.4% for different signal-to-noise ratios, which shows the potential of implementing high-performance CV-QKD systems using single code rate matrix.
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.
Continuous-variable quantum key distribution (CV-QKD) is a promising quantum-safe alternative to classical asymmetric cryptography that enables two authenticated parties to establish a shared secret over a potentially eavesdropped quantum channel. A key step in CV-QKD post-processing is information reconciliation, which leverages forward error correction (FEC) techniques to extract identical bit strings from noisy correlated data. In this work, we analyze the strict limitations on operating distance that are imposed by constant-rate FEC, severely limiting the practicability of CV-QKD systems in deployed optical networks. To overcome the distance limitations, we evaluate three strategies: (i) tuning modulation variance, (ii) adding controlled amounts of trusted detector loss, and (iii) the use of rate-adaptive FEC. All approaches are validated experimentally, compared in terms of performance, and we discuss implementation aspects. Our results show that while methods (i) and (ii) extend the operational distance of constant-rate FEC without the need for additional hardware components, they incur a significant penalty in secret key rate (SKR). In contrast, rate-adaptive FEC enables CV-QKD operation with performance close to the asymptotic SKR over a wide range of distances, provided that the reconciliation efficiency is chosen appropriately.
Continuous Variable Quantum Key Distribution (CV-QKD) is currently experiencing rapid and significant growth. This can be attributed to its capacity to increase resilience to noise and its ease of integration into current optical communication networks. In this article, we review and survey existing work on CV-QKD post-processing techniques, privacy amplification, and key reconciliation. We also classify protocols based on transmission, preparation, and measurement, which allows for a more systematic and organized understanding of protocols, as well as identifying potential vulnerabilities or weaknesses in each component and allowing for targeted improvements to enhance the overall security and efficiency of protocols. Finally, we outline potential research directions and future challenges that require attention to advance the optimization of CV-QKD technology.