Quantum Key Distribution, or short QKD, aims to establish a secure key withoutmaking any additional assumptions about the abilities or computational power of an adversary who is only limited by the laws of nature. The process of finding a mathematical expression for, or at least a lower bound on, the secure keyrate of some QKD protocol, given relevant system parameters, is called securityproof. In this thesis, we use a recent numerical security proof technique to examine different post selection strategies for continuous-variable quantum key distribution(CV-QKD) protocols with quadrature phase-shift keying modulation and four or eight signal states. CV-QKD protocols use coherent states to encode information and measure the field-quadrature components by homodyne or heterodyne detection. The basic idea of the used numerical security proof technique is to solve thekey rate finding problem in a two-step process. In the first step, the problem is solved approximately, using a numerical algorithm, which yields an upper bound on the secure key rate. This is followed by step two, where the obtained upperbound is converted into a lower bound, using a sequence of theorems and taking numerical errors into account. Postselection aims to increase the secure key rate by removing those parts of the key, where a potential adversary might have gained more information than the communicating parties. The investigations are carried out both for the untrusted ideal and the trusted non-ideal detector scenario and we provide novel analytical results for the operators related to the postselection map.For four-state protocols, we demonstrate that a new cross-shaped postselectionstrategy out performs the state-of-the-art radial postselection scheme clearly in regions of medium to high transmission distances and medium to high values of noise and performs comparable to a more complicated radial&angular scheme. As the error-correction phase is a known bottleneck for many real QKD systems, we examined the secure key rate when a large fraction of the raw key is removed by postselection. We observe that a smart choice of the postselection strategy can increase the key rate while lowering the raw key rate, hence the computational effort in the error-correction phase. One can think this even further: For cross-shaped postselection we showed that the secure key rate is roughly 80% of the secure keyrate without postselection when only 20% of the raw key passes the postselection.For high noise levels this can be increased even further. The cross-shaped post-selection strategy can easily be implemented in the data processing of both new and existing CV-QKD systems, hence can increase the achievable secure key rate significantly. Furthermore, we examined the radial&angular postselection strategy which combines the advantages of the radial postselection scheme for low transmission distances and those of the cross-shaped postselection scheme for medium and high transmission distances on the cost of higher complexity.Additionally, we examine an eight-state phase-shift keying protocol and compare the obtained key rates to the key rates for the four-state protocol and investigate a radial postselection scheme. We observe that the 8PSK protocol yields higher secure key rates and reaches higher maximal achievable transmission distances than a QPSK protocol with a comparable postselection strategy, in particular for medium to high values of excess noise. Furthermore, we explore the relation between the achievable secure key rate and the probability to pass the postselectionphase for various noise-levels and two different practically relevant reconciliation efficiencies. This leads to similar strategies as found for the QPSK protocols to reduce the raw key rate significantly while decreasing the secure key rate only moderately. For very high values of excess noise, the raw key rate can be increased further compared to the key rate achieved without performing postselection whileremoving a large fraction of the raw key rate.
Quantum Key Distribution, or short QKD, aims to establish a secure key withoutmaking any additional assumptions about the abilities or computational power of an adversary who is only limited by the laws of nature. The process of finding a mathematical expression for, or at least a lower bound on, the secure keyrate of some QKD protocol, given relevant system parameters, is called securityproof. In this thesis, we use a recent numerical security proof technique to examine different post selection strategies for continuous-variable quantum key distribution(CV-QKD) protocols with quadrature phase-shift keying modulation and four or eight signal states. CV-QKD protocols use coherent states to encode information and measure the field-quadrature components by homodyne or heterodyne detection. The basic idea of the used numerical security proof technique is to solve thekey rate finding problem in a two-step process. In the first step, the problem is solved approximately, using a numerical algorithm, which yields an upper bound on the secure key rate. This is followed by step two, where the obtained upperbound is converted into a lower bound, using a sequence of theorems and taking numerical errors into account. Postselection aims to increase the secure key rate by removing those parts of the key, where a potential adversary might have gained more information than the communicating parties. The investigations are carried out both for the untrusted ideal and the trusted non-ideal detector scenario and we provide novel analytical results for the operators related to the postselection map.For four-state protocols, we demonstrate that a new cross-shaped postselectionstrategy out performs the state-of-the-art radial postselection scheme clearly in regions of medium to high transmission distances and medium to high values of noise and performs comparable to a more complicated radial&angular scheme. As the error-correction phase is a known bottleneck for many real QKD systems, we examined the secure key rate when a large fraction of the raw key is removed by postselection. We observe that a smart choice of the postselection strategy can increase the key rate while lowering the raw key rate, hence the computational effort in the error-correction phase. One can think this even further: For cross-shaped postselection we showed that the secure key rate is roughly 80% of the secure keyrate without postselection when only 20% of the raw key passes the postselection.For high noise levels this can be increased even further. The cross-shaped post-selection strategy can easily be implemented in the data processing of both new and existing CV-QKD systems, hence can increase the achievable secure key rate significantly. Furthermore, we examined the radial&angular postselection strategy which combines the advantages of the radial postselection scheme for low transmission distances and those of the cross-shaped postselection scheme for medium and high transmission distances on the cost of higher complexity.Additionally, we examine an eight-state phase-shift keying protocol and compare the obtained key rates to the key rates for the four-state protocol and investigate a radial postselection scheme. We observe that the 8PSK protocol yields higher secure key rates and reaches higher maximal achievable transmission distances than a QPSK protocol with a comparable postselection strategy, in particular for medium to high values of excess noise. Furthermore, we explore the relation between the achievable secure key rate and the probability to pass the postselectionphase for various noise-levels and two different practically relevant reconciliation efficiencies. This leads to similar strategies as found for the QPSK protocols to reduce the raw key rate significantly while decreasing the secure key rate only moderately. For very high values of excess noise, the raw key rate can be increased further compared to the key rate achieved without performing postselection whileremoving a large fraction of the raw key rate.
We use a recent numerical security proof technique to analyse three different postselection strategies for continuous-variable quantum key distribution protocols (CV-QKD) with quadrature phase-shift keying modulation. For all postselection strategies studied we provide novel analytical results for the operators that define the respective regions in phase space. In both, the untrusted and trusted detector model, a new, cross-shaped postselection strategy, clearly outperforms a state-of-the-art radial postselection scheme for higher transmission distances and higher values of noise. Motivated by the high computational effort for the error-correction phase we also studied the case when a large fraction of the raw key is eliminated by postselection: We observe that the secure key rate in case that only 20% of the raw key passes the cross-shaped postselection is still roughly 80% of the secure key rate without postselection for low values of excess noise and roughly 95% for higher values of excess noise. Furthermore, we examine a strategy with radial and angular postselection that combines both the advantages of state-of-the-art radial postselection schemes and our cross-shaped strategy at the cost of higher complexity. Employing the cross-shaped postselection strategy, that can easily be introduced in the data processing, both new and existing CV-QKD systems can improve the achievable secure key rates significantly.
A numerical security proof technique is used to analyze the security of continuous-variable quantum key distribution (CV-QKD) protocols with phase-shift keying (PSK) modulation against collective attacks in the asymptotic limit. We argue that it is sufficient to consider protocols with a maximum of eight signal states and analyze different postselection strategies for protocols with four (QPSK) and eight (8PSK) signal states for untrusted ideal and trusted nonideal detectors. We introduce a cross-shaped postselection strategy, and show that both cross-shaped and radial and angular postselection clearly outperform a radial postselection scheme (and no postselection) for QPSK protocols. For all strategies studied, we provide analytical results for the operators defining the respective regions in phase space. We outline several use cases of postselection, which can easily be introduced in the data processing of both new and existing CV-QKD systems. Motivated by the high computational effort for error correction, we study the case when a large fraction of the raw key is eliminated by postselection and observe that this can be achieved while increasing the secure key rate. Postselection can also be used to partially compensate the disadvantage of QPSK protocols over 8PSK protocols for high transmission distances, while being experimentally less demanding. Finally, we highlight that postselection can be used to reduce the key rate gap between scenarios with trusted and untrusted detectors while relying on less assumptions on Eve's power.
Quantum key distribution (QKD) can be proved to be secure by laws of quantum mechanics. In this thesis, we review security proof methods in Renner's framework and discuss numerical methods to calculate asymptotic and finite key rates. These methods are highly versatile and applicable to general device-dependent QKD protocols. We also discuss analytical tools that extend the applicability of these numerical methods. We then present the asymptotic security proof against collective attacks for a variant of the twin-field QKD protocol, which can overcome the repeaterless secret-key capacity bound. Our variant reduces the sifting cost and uses non-phase-randomized coherent states as both signals and test states. We confirm the loss scaling of this protocol. Another important family of protocols that we investigate here are discrete-modulated continuous-variable QKD protocols. They are interesting due to their experimental simplicity and their great potential for massive deployment in the quantum-secured networks. Our security proof method can provide tight asymptotic key rates. We demonstrate that the postselection of data in combination with reverse reconciliation can improve the key rates. We analyze both untrusted and trusted detector noise scenarios. Our results in the trusted detector noise scenario show that we can thus cut out most of the effect of detector noise and obtain asymptotic key rates similar to those had we access to ideal detectors. Finally, we present several simple examples to illustrate our newly developed method for the numerical finite-key analysis against the most general attacks via the entropy accumulation theorem.
This thesis is concerned with rigorous security analyses of practical Quantum Key Distribution (QKD) protocols, using a variety of modern proof techniques. The main results are as follows. First, we establish a security proof for variable-length QKD protocols against IID collective attacks, and extend this result to coherent attacks using the postselection technique. In doing so, we resolve a long-standing flaw in the application of the postselection technique to QKD, thereby placing it on a rigorous mathematical footing. Second, we develop a method to bound phase error rates in entropic uncertainty relation-based and phase error rate-based proofs, using only the observed statistics of the protocol, even when detectors are imperfect and only approximately characterized. This removes a key assumption of identical detector behaviour and enables these techniques to be applied in realistic settings. Third, we present a very general security analysis based on the marginal-constrained entropy accumulation theorem. The resulting framework can be readily adapted to practical imperfections and side channels, and is suitable for certification efforts. Finally, we show that the security of QKD protocols under realistic authentication assumptions can be reduced to the standard idealized setting, where authentication is assumed to behave honestly, with only minor protocol modifications. A distinctive feature of this thesis is its unified presentation of several major QKD security proof frameworks using consistent protocol descriptions and notation. Consequently, this thesis is intended not only as a collection of new technical results, but also as a useful reference for understanding rigorous security analysis in quantum key distribution.
Quantum information processing uses the laws of quantum physics to perform tasks that are infeasible or impossible classically. Within this broader programme, quantum communication has emerged as one of the most practically mature sub-fields of quantum information science, with several proposed protocols having already been demonstrated over deployed optical fibre and free-space links. Of the various platforms available for encoding quantum information for communication, the continuous-variable (CV) framework encodes information in the quadratures of the electromagnetic field and is therefore directly compatible with the existing machinery of classical coherent optical communications. The most prominent CV protocol is continuous-variable quantum key distribution (CV-QKD), which establishes an information-theoretically secure cryptographic key between two spatially separated parties. Because CV-QKD reuses much of the hardware of classical coherent telecommunications, including off-the-shelf lasers, modulators, and balanced detectors, it is a leading candidate for the deployment of quantum-secured communication over standard optical fibre networks. The development of CV-QKD has typically proceeded with the underlying physics dictating the engineering. Security proofs, often relying on the Gaussian optimality of collective attacks, set the structure of the protocol, and the practical system is then built to satisfy the assumptions on which those proofs depend. Contributions of this thesis adopt the opposite view, taking the practical engineering of high-rate CV-QKD systems as the starting point and developing the theoretical machinery required to support it. The first contribution is the formalisation of one-round sliced reconciliation with guard-band post-selection as a key distillation scheme designed for real-time, high-throughput operation. Originally introduced experimentally as a means to stabilise bit error rates and enable the use of fixed-rate error correction codes at high symbol rates, guard-band post-selection is shown here to identify the guard-band span as a free parameter that can be tuned to hold the quantum bit error rate approximately constant across a range of channel conditions. However, conditioning on accepted data produces non-Gaussian post-selected statistics that lie outside the reach of standard Gaussian-optimality security arguments, which motivates the remaining two contributions. The second contribution is an asymptotic security analysis of guard-band post-selected CV-QKD against arbitrary collective attacks, no longer restricted to Gaussian adversaries. By using a quantum channel estimate as side information and by lifting reduced-state distances to purification distances via entropic continuity bounds, security is certified against the class of channels lying close to a Gaussian thermal-loss reference, with a key-rate penalty that scales with the energy-constrained diamond distance to that reference. The third contribution is the experimental basis required to apply this framework in practice. A lightweight three-stage protocol for quantum channel estimation is proposed and demonstrated, which repurposes the Gaussian probe constellation already present in the CV-QKD signal and requires no additional hardware or modifications to the underlying protocol. Over single-mode optical fibre at distances from 10 km to 50 km, the protocol produces physically valid process tensor estimates whose energy-constrained diamond distances to a Gaussian reference channel remain on the order of 10^(-3) throughout. Together, these three contributions provide a treatment of post-selected Gaussian-modulated CV-QKD in which the engineering, the security theory, and the channel characterisation are designed to operate together within a deployable system.
Quantum Key Distribution (QKD) provides a method for securely sharing a secret key between two distant parties, Alice and Bob, by leveraging the principles of quantum mechanics. This thesis focuses on Continuous-Variable (CV) QKD, a variant of QKD where information is encoded in the quadrature components of coherent light states, allowing for efficient and cost-effective detection using homodyne or heterodyne receivers. The thesis is divided into three main parts: an introduction to quantum cryptography concepts, the presentation of a CV-QKD protocol, and a detailed security proof of the protocol against different types of attacks. The security proof considers both finite and infinite symbol transmission and tackles various eavesdropping attacks, including individual, collective, and coherent attacks. The use of Gaussian states and operations provides a promising approach to enhance QKD security, particularly in the context of practical quantum cryptography. The final sections provide a mathematical framework for the optimization of secure key rates and strategies for addressing the photon-number cutoff assumption in practical implementations.