Carlos Pascual-Garcia

Finite-size general security proofs for quantum key distribution based on Rényi entropies have recently been introduced. These approaches are more flexible and provide tighter bounds on the secret key rate than traditional formulations based on the von Neumann entropy. However, deploying them requires minimizing the conditional Rényi entropy, a difficult optimization problem that has hitherto been tackled using ad-hoc techniques based on the Frank-Wolfe algorithm, which are unstable and can only handle particular cases. In this work, we introduce a method based on non-symmetric conic optimization for solving this problem. Our technique is fast, reliable, and completely general. We illustrate its performance on several protocols, whose results represent an improvement over the state of the art.

Continuous variable quantum key distribution (CVQKD) with discrete modulation combines advantages of CVQKD, such as the implementability using readily available technologies, with advantages of discrete variable quantum key distribution, such as easier error correction procedures. In this work we consider a phase-shift keying protocol using four coherent states (4-PSK protocol) and coarse-grained heterodyne measurements. We provide a security proof against coherent attacks and compute the achievable key rate in a finite size setting, i.e. with a finite number of rounds. To this end, we employ the generalized entropy accumulation theorem, as well conic optimisation, providing us with improved key rates compared to previous works. At metropolitan distances our method can provide positive key rates for the order of $10^9$ rounds. We also provide a theoretical method to overcome the assumption of a finite photon number cutoff made in previous works.