In a continuous-variable quantum key distribution (CV-QKD) protocol, which is based on heterodyne detection at the receiver, the application of a noiseless linear amplifier (NLA) on the received signal before the detection can be emulated by the postselection of the detection outcome. Such a postselection, which is also called a measurement-based NLA, requires a cutoff on the amplitude of the heterodyne-detection outcome to produce a normalizable filter function. Increasing the cutoff with respect to the received signals results in a more faithful emulation of the NLA and nearly Gaussian output statistics at the cost of discarding more data. While recent works have shown the benefits of postselection via an asymptotic security analysis, we undertake an investigation of such a postselection utilizing a composable security proof in the realistic finite-size regime, where this tradeoff is extremely relevant. We show that this form of postselection offers only a small fraction of the asymptotic improvement in the finite-size regime. This postselection can improve the secure range of a CV-QKD over lossy thermal channels if the finite block size is sufficiently large and the optimal value for the filter cutoff is typically in the non-Gaussian regime. The relatively modest improvement in the finite-size regime as compared to the asymptotic case highlights the need for new tools to prove the security of non-Gaussian cryptographic protocols. These results also represent a quantitative assessment of a measurement-based NLA with an entangled-state input in both the Gaussian and non-Gaussian regime.
In a continuous-variable quantum key distribution (CV-QKD) protocol, which is based on heterodyne detection at the receiver, the application of a noiseless linear amplifier (NLA) on the received signal before the detection can be emulated by the postselection of the detection outcome. Such a postselection, which is also called a measurement-based NLA, requires a cutoff on the amplitude of the heterodyne-detection outcome to produce a normalizable filter function. Increasing the cutoff with respect to the received signals results in a more faithful emulation of the NLA and nearly Gaussian output statistics at the cost of discarding more data. While recent works have shown the benefits of postselection via an asymptotic security analysis, we undertake an investigation of such a postselection utilizing a composable security proof in the realistic finite-size regime, where this tradeoff is extremely relevant. We show that this form of postselection offers only a small fraction of the asymptotic improvement in the finite-size regime. This postselection can improve the secure range of a CV-QKD over lossy thermal channels if the finite block size is sufficiently large and the optimal value for the filter cutoff is typically in the non-Gaussian regime. The relatively modest improvement in the finite-size regime as compared to the asymptotic case highlights the need for new tools to prove the security of non-Gaussian cryptographic protocols. These results also represent a quantitative assessment of a measurement-based NLA with an entangled-state input in both the Gaussian and non-Gaussian regime.
Free-space channels provide the possibility of establishing continuous-variable quantum key distribution in global communication networks. However, the fluctuating nature of transmissivity in these channels introduces an extra noise which reduces the achievable secret key rate. We consider two classical postprocessing strategies, postselection of high-transmissivity data and data clusterization, to reduce the fluctuation-induced noise of the channel. We undertake the investigation of such strategies utilizing a composable security proof in a realistic finite-size regime against both collective and individual attacks. We also present an efficient parameter estimation approach to estimate the effective Gaussian parameters over the postselected data or the clustered data. Although the composable finite-size effects become more significant with the postselection and clusterization both reducing the size of the data, our results show that these strategies are still able to enhance the finite-size key rate against both individual and collective attacks with a remarkable improvement against collective attacks, even moving the protocol from an insecure regime to a secure regime under certain conditions.
Continuous-variable quantum key distribution (CV-QKD) using coherent states and heterodyne detection enables secure quantum communication based on technology that has large similarities to coherent optical telecommunication. Yet, practical implementations of coherent receivers used in both technologies encounter device imperfections, which for CV-QKD are often not addressed in security proofs. Here, we present a theoretical framework that rigorously accounts for imperfect heterodyne measurements arising from phase and amplitude imbalances in the coherent (heterodyne) receiver. Focusing on collective attacks, we establish a finite-size security proof that reveals how measurement imperfections limit the distance over which a positive key rate is achievable. To mitigate these effects, we propose a local transformation during classical post-processing. We validate our approach experimentally on a CV-QKD system with an imperfect coherent receiver, underscoring its potential for scalable, cost-effective CV-QKD with photonic integrated receivers in which phase and amplitude imbalances naturally appear through manufacturing tolerances.
Noiseless amplification or attenuation are two heralded filtering operations that enable amplifying or de-amplifying a quantum state of light with no added noise, at the cost of a small success probability. We show that inserting such noiseless operations in a transmission line improves the performances of continuous-variable quantum key distribution over this line. Remarkably, these noiseless operations do not need to be physically implemented but can simply be simulated in the classical data postprocessing stage. Hence, virtual noiseless amplification or attenuation amounts to performing a Gaussian postselection, which enhances the secure range or tolerable excess noise while keeping the benefits of Gaussian security proofs.
Photon subtraction can enhance the performance of continuous-variable quantum key distribution (CV QKD). However, the enhancement effect will be reduced by the imperfections of practical devices, especially the limited efficiency of a single-photon detector. In this paper, we propose a non-Gaussian postselection method to emulate the photon substraction used in coherent-state CV QKD protocols. The virtual photon subtraction not only can avoid the complexity and imperfections of a practical photon-subtraction operation, which extends the secure transmission distance as the ideal case does, but also can be adjusted flexibly according to the channel parameters to optimize the performance. Furthermore, our preliminary tests on the information reconciliation suggest that in the low signal-to-noise ratio regime, the performance of reconciliating the postselected non-Gaussian data is better than that of the Gaussian data, which implies the feasibility of implementing this method practically.
Quantum key distribution (QKD) is fundamentally different from most classical key distribution schemes, such as Diffie-Hellman key exchange, in the sense that no computational complexity assumption is required on the power of adversaries to prove its security. QKD relies on basic laws of quantum physics and it is proven that it can enable highly secure data communication. Such achievements, however, are facing technological problems that have to be resolved in order to provide a viable solution to a large group of customers. While there are discrete-variable QKD schemes, which rely on encoding data in discrete degrees of freedom, such as polarization of single photons, in this thesis, we focus on the continuous-variable QKD (CV-QKD) protocols, in which data is encoded on the quadratures of light. Currently, one of the major drawbacks of CV-QKD is its poor performance at long distances. Nevertheless, such a limitation in CV-QKD can be overcome with the assistance of quantum repeaters that rely on entanglement distillation via noiseless linear amplifiers (NLAs). Such systems can, in principle, offer large secret key rates over long distances. In this thesis, we aim to provide a realistic analysis of a CV-QKD protocol running over quantum scissors (QSs) as realistic NLAs. We will report the obstacles that one could face in realizing CV-QKD in such a scenario. A review of CV-QKD and QS-based NLAs will be given, based on which QS-assisted CV-QKD is proposed. We, particularly, focus on the modelling of the QSs' structure and their effect on the secret key rate aiming to find operational regimes where the performance of the QKD scheme is enhanced. This study paves the way for implementing long-distance CV-QKD protocols that rely on QS/NLA devices over CV quantum repeaters. \n \nIn this thesis, we also consider and account for a realistic analysis of a CV-QKD protocol with non-Gaussian modulation, which is assisted by the means of QSs. We will show that, while we have to deal with similar obstacles as in the Gaussian modulation, we can potentially improve performance of the non-Gaussian modulation protocol. \n \nAs an alternative approach to extend the secure distance of CV-QKD protocols, the last part of this thesis is devoted to presenting realistic threat models for satellite QKD, wherein we consider several eavesdropping scenarios by limiting eavesdroppers' access to the trusted ground and/or satellite stations. In such scenarios, the eavesdropper has only limited access to the sender and/or receiver stations. \nFor example, we will explore the case where an eavesdropper can only receive an attenuated version of the transmitted signals. As well, we will focus on the case where Eve's signals would reach the receiver via a lossy channel inaccessible to the eavesdropper. We show that, in the case of both Gaussian and non-Gaussian protocols, this limitation would allow trusted parties to achieve higher key rates than what can be achieved when unrestricted eavesdropping is possible.
Continuous variable quantum key distribution via discrete modulations ensures information-theoretic security using standard telecom technologies, providing affordable and scalable quantum communications with simplified classical postprocessing. However, existing security proofs against general attacks often rely on restrictive assumptions, such as a bounded dimension for coherent states, or require impractically large block sizes. In this work, we develop a finite-size security analysis that removes these limitations while incorporating realistic experimental features. Our approach combines an optimization under infinite dimensions, a security proof against general attacks, a trusted detector model accounting for the receiver imperfections, and postselection strategies to reuse discarded measurement outcomes. We report positive key rates in the finite-size regime for relevant block sizes of the order of 107. These results contribute to narrowing the gap between theoretical security proofs and practical implementations of discrete-modulated continuous variable quantum key distribution protocols.