Security Proofs for Quantum Key Distribution Protocols by Numerical Approaches
This thesis applies numerical methods to analyze the security of quantum key distribution (QKD) protocols. The main theoretical problem in QKD security proofs is to calculate the secret key generation rate. Under certain assumptions, this problem has been formulated as a convex optimization problem and numerical methods have been proposed to produce reliable lower bounds for discrete-variable QKD protocols. We investigate the applicability of these numerical approaches and apply the numerical methods to study a variety of protocols, including measurement-device-independent (MDI) protocols, variations of the BB84 protocol with a passive countermeasure against Trojan horse attacks, and the phase-encoding BB84 protocol using attenuated laser sources without continuous phase randomization.
Cite this version of the work
Jie Lin (2017). Security Proofs for Quantum Key Distribution Protocols by Numerical Approaches. UWSpace. http://hdl.handle.net/10012/12589