From Asymptotic to Finite-Size Security in Decoy-State Quantum Key Distribution
Candidate: Lars Kamin
Supervisor: Norbert Lütkenhaus
Location: QNC 2101
Quantum Key Distribution (QKD) promises information-theoretic security, yet bridging the gap between theoretical proofs and practical implementations, specifically those operating with finite resources and imperfect devices against general coherent attacks, remains a critical challenge. This thesis develops a spectrum of efficient security proof techniques within the composable security framework, calculating key rates for both fixed- and variable-length protocols while accounting for realistic imperfections.
We begin by addressing detection setups through an extension of a squashing map, the flag-state squasher, used for reducing infinite-dimensional Hilbert spaces of optical elements to finite dimensions. This extension accommodates arbitrary passive linear optical setups while allowing for the inclusion of detection inefficiencies and dark counts in the security analysis.
Subsequently, we refine the analysis of decoy-state protocols and introduce two improvements. First, we reformulate the decoy-state analysis to recover no-decoy key rates, drastically tightening the optimization; second, we derive a unified framework that performs the key rate optimization and decoy analysis in a single step. This enables the bounding of the relevant entropies with arbitrary precision in the finite-size regime and successfully recovers the Devetak-Winter formula in the asymptotic limit.
Furthermore, we improve the security analysis for generic QKD protocols against independent and identically distributed (IID) collective attacks. Our refined analysis yields finite-size corrections proportional to detected rather than transmitted signals and, by developing sharper concentration inequalities, achieves significantly improved finite-size scaling.
Finally, leveraging the marginal constrained entropy accumulation theorem (MEAT), we establish a flexible framework for security proofs against coherent attacks for both fixed- and variable-length protocols. This approach, frequently outperforms the best reference proof techniques based on entropic uncertainty relations for both qubit and decoy-state protocols. Moreover, we present finite-size key rates for generic QKD protocols accounting for realistic intensity and phase imperfections. Overall, our framework provides both a greater scope of applicability and better key rates than existing techniques, especially for small block sizes, thereby offering a scalable path toward secure quantum communication under realistic conditions.