Abstract : Saikat Guha has been in discussions with Kamil Bradler of CipherQ Corp. on extending the proof technique of Lutkenhaus et al., PRA 79, 012307, which proved security and a rate lower bound for a binary-input (BPSK) CV QKD protocol. The main challenge in extending this proof technique to an M-ary is that this requires us to retain the entire relative geometry of the M purifications of the Eve's states (i.e., M choose 2 inner products). We are investigating a way where we could argue that the symmetry of the transmitted ensemble (e.g., a M-ary PSK constellation) is preserved in the symmetry of a particular purification of Eve's conditional states, which lets us proceed with evaluating bounds to conditional entropies using only a few parameters that describe that geometry, and in turn will hopefully lead to a rate lower bound with a simple-to-implement key map that only has a few quantities that Alice and Bob need to estimate during the channel estimation step.
Abstract : Saikat Guha has been in discussions with Kamil Bradler of CipherQ Corp. on extending the proof technique of Lutkenhaus et al., PRA 79, 012307, which proved security and a rate lower bound for a binary-input (BPSK) CV QKD protocol. The main challenge in extending this proof technique to an M-ary is that this requires us to retain the entire relative geometry of the M purifications of the Eve's states (i.e., M choose 2 inner products). We are investigating a way where we could argue that the symmetry of the transmitted ensemble (e.g., a M-ary PSK constellation) is preserved in the symmetry of a particular purification of Eve's conditional states, which lets us proceed with evaluating bounds to conditional entropies using only a few parameters that describe that geometry, and in turn will hopefully lead to a rate lower bound with a simple-to-implement key map that only has a few quantities that Alice and Bob need to estimate during the channel estimation step.
The security of prepare-and-measure satellite-based quantum key distribution (QKD), under restricted eavesdropping scenarios, is addressed.We particularly consider cases where the eavesdropper, Eve, has limited access to the transmitted signal by Alice and/or Bob's receiver station.This restriction is modeled by lossy channels between relevant parties, where the transmissivity of such channels can, in principle, be bounded by monitoring techniques.An artifact of such lossy channels is the possibility of having bypass channels, those that are not accessible to Eve but that may not necessarily be characterized by the users either.This creates interesting unexplored scenarios for analyzing QKD security.In this paper, we obtain generic bounds on the key rate in the presence of bypass channels and apply them to continuousvariable QKD protocols with Gaussian encoding with direct and reverse reconciliation.We find regimes of operation in which the above restrictions on Eve can considerably improve system performance.We also develop customized bounds for several protocols in the BB84 family and show that, in certain regimes, even the simple protocol of BB84 with weak coherent pulses is able to offer positive key rates at high channel losses, which would otherwise be impossible under an unrestricted Eve.In this case, the limitation on Eve would allow Alice to send signals with larger intensities than the optimal value under an ideal Eve, which effectively reduces the effective channel loss.In all these cases, the part of the transmitted signal that does not reach Eve can play a nontrivial role in specifying the achievable key rate.Our work opens up new security frameworks for spaceborne quantum communications systems.
Satellite based quantum key distribution (QKD) aims to establish secure key exchange over long distances despite significant technological challenges. To alleviate some of these challenges, Ghalaii et al. [PRX Quantum 4, 040320 (2023)] proposed that any airborne eavesdropper up to a certain size can be detected by classical monitoring techniques, limiting the transmission efficiencies of any undetected Eve. This creates a new QKD scenario in which some of the transmitted signal from Alice to Bob bypasses Eve entirely. In this manuscript, we develop a general framework for computing key rates in this "bypass" scenario for discrete variable protocols. We first numerically support a conjecture that the performance of BB84 with single photons does not improve under bypass constraints, and go on to find new regimes that do. Specifically, we find improvements when the receiver's detectors have an efficiency mismatch and when BB84 is implemented using weak coherent pulses under certain squashing assumptions. Technically, our framework is realized by including marginal constraints on the source to account for bypass effects, combined with existing numerical approaches for minimizing the key rate and squashing and dimension reduction techniques to handle photonic states of unbounded dimension.
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.
In this thesis we develop practical tools for quantum key distribution (QKD) security proofs. We apply the tools to provide security proofs for several protocols, ranging from discrete variable protocols in high dimensions, protocols with realistic implementations, measurement device independent QKD and continuous-variable QKD. The security proofs are based on the Devetak-Winter security framework [I. Devetak and A. Winter, Proc. of the Roy. Soc. of London Series A, 461, 207 (2005); B. Kraus, N. Gisin, and R. Renner, Phys. Rev. Lett., 95 080501 (2005)]. \n \nIn the key rate calculation, it is often convenient to assume that the optimal attack is symmetric. \nUnder the assumption that the parameter estimation is based on coarse-grained observations, we show that the optimal attack is symmetric, if the protocol and the postselection have sufficient symmetries. \nAs an example we calculate the key rates of protocols using 2, d and d+1 mutually unbiased bases in d-dimensional Hilbert spaces. \n \nWe investigate the connection between the optimal collective eavesdropping attack and the optimal cloning attack, in which the eavesdropper employs an optimal cloner to attack the protocol. \nWe find that, in general, it does not hold that the optimal attack is an optimal cloner. However, there are classes of protocols, for which we can identify the optimal attack by an optimal cloner. \nWe analyze protocols with mutually unbiased bases in d dimensions, and show that for the protocols with 2 and d+1 mutually unbiased bases the optimal attack is an optimal cloner, but for the protocols with d mutually unbiased bases, it is not. \n \nIn optical implementations of the phase-encoded BB84 protocol, the bit information is usually encoded in the phase of two consecutive photon pulses generated in a Mach-Zehnder interferometer. In the actual experimental realization, the loss in the arms of the Mach-Zehnder interferometer is not balanced, for example because only one arm contains a lossy phase modulator. \nSince the imbalance changes the structure of the signals states and measurements, the BB84 security analysis no longer applies in this scenario. \nWe provide a security proof for the unbalanced phase-encoded BB84. The loss does lower the key rate compared to a protocol without loss. However, for a realistic parameter regime, the same key rate is found by applying the original BB84 security analysis. \n \nRecently, the security of a measurement device-independent QKD setup with BB84 signal states was proven in Refs. [H.-K. Lo, M. Curty, and B. Qi, Phys. Rev. Lett., 108 (2012); S. L. Braunstein and S. Pirandola, Phys. Rev. Lett., 108 (2012)]. In this setup Alice and Bob send quantum states to an intermediate node, which performs the measurement, and is assumed to be controlled by Eve. \nWe analyze the security of a measurement device-independent QKD protocol with B92 signal states, and calculate the key rates numerically for a realistic implementation. \nBased on our security proof we were able to prove the security of the strong reference pulse B92 protocol. \n \nWe analyze the security of continuous-variable protocols using the entropic uncertainty relations established in Ref. [M. Berta, M. Christandl, R. Colbeck, J. M. Renes, and R. Renner, Nature Physics 6, 659 (2010)] to provide an estimate of the key rate based on the observed first and second moments. We analyze a protocol with squeezed coherent states and the 2-state protocol with two coherent states with opposite phases.
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.
Discrete-modulated (DM) continuous-variable quantum key distribution (CV-QKD) protocols are promising candidates for commercial implementations of quantum communication networks due to their experimental simplicity.While tight security analyses in the asymptotic limit exist, proofs in the finitesize regime are still subject to active research.We present a composable finite-size security proof against independently and identically distributed collective attacks for a general DM CV-QKD protocol.We introduce a new energy testing theorem to bound the effective dimension of Bob's system and rigorously prove security within Renner's -security framework and address the issue of acceptance sets in protocols and their security proof.We want to highlight that our method also allows for nonunique acceptance statistics, which is necessary in practise.Finally, we extend and apply a numerical security proof technique to calculate tight lower bounds on the secure key rate.To demonstrate our method, we apply it to a quadrature phase-shift keying protocol for both untrusted, ideal and trusted, nonideal detectors.The results show that our security proof method yields secure finite-size key rates under experimentally viable conditions up to at least 72 km transmission distance.