Continuous-variable quantum key distribution (CVQKD) offers the specific advantage of sharing keys remotely by the use of standard telecom components, thereby promoting cost-effective and high-performance metropolitan applications. Nevertheless, the introduction of high-rate spectrum broadening has pushed CVQKD from a single-mode to a continuous-mode region, resulting in the adoption of modern digital signal processing (DSP) technologies to recover quadrature information from continuous-mode quantum states. However, the security proof of DSP involving multi-point processing is a missing step. Here, we propose a generalized method of analyzing continuous-mode state processing by linear DSP via temporal modes theory. The construction of temporal modes is key in reducing the security proof to single-mode scenarios. The proposed practicality oriented security analysis method paves the way for building classical compatible digital CVQKD.

Quantum key distribution (QKD), which enables the secure distribution of symmetric keys between two legitimate parties, is highly useful in future network security. An access network that connects multiple end users with one network backbone can be combined with QKD to build security for end users in a scalable and cost-effective way. In this paper, we show that a downstream-access network can be implemented using continuous-variable (CV) QKD. The security analysis is conducted independently with other network nodes, which greatly relax the trustfulness requirement on the network nodes. The security is then obtained against other network parties even when the quantum signals are broadcast throughout the network. The passive beam splitter is sufficient to deterministically distribute the quantum signals, and standard CV QKD systems can be directly fitted in the downstream-access network, which makes it more applicable for practical implementations. Numerous simulation results are provided to demonstrate the performance of the CV QKD downstream-access network, where up to 64 end users are shown to be feasible to access the network. We provide the security-analysis framework for realizing CV QKD in the downstream-access network, which will boost the diversity for constructing practical CV QKD networks.

Privacy amplification is an indispensable step in postprocessing of continuous-variable quantum key distribution (CV-QKD), which is used to distill unconditional secure keys from identical corrected keys between two distant legal parties. The processing speed of privacy amplification has a significant effect on the secret key rate of CV-QKD system. We report the high-speed parallel implementation of length-compatible privacy amplification algorithm based on graphic processing unit. Length-compatible algorithm is used to satisfy the security requirement of privacy amplification at different transmission distances when considering finite-size effect. We achieve the speed of privacy amplification over 1 Gbps at arbitrary input length and the speed is one to two orders of magnitude faster than previous demonstrations, which supports high-speed real-time CV-QKD system and ensures the security of privacy amplification.

Continuous variable quantum key distribution that can be implemented using only low-cost and off-the-shelf components reveals great potential in practical large-scale realization. Access networks, as a modern network necessity, connect many end-users to the network backbone. In this work, we first demonstrate upstream transmission quantum access networks using continuous variable quantum key distribution. A two-end-user quantum access network is then experimentally realized. Through phase compensation, data synchronization, and other technical upgrades, we achieve a secret key rate of the total network of 390 kbits/s. In addition, we extend the case of a two-end-user quantum access network to the case of a multiplicity of users, and analyze the network capacity in the case of a multiplicity of users by measuring the additive excess noise from different time slots.

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.