Optimizing Epsilon Security Parameters in QKD
Alexander G. Mountogiannakis, Stefano Pirandola
TL;DR
This work uses a continuous genetic algorithm to optimize epsilon-security parameters in both CV-QKD and DV-QKD under a fixed composable security level. By focusing on $\varepsilon_{PE}$ and $\varepsilon_{cor}$ (with $\varepsilon_{sec}$ derived from a constraint), the study demonstrates substantial key-rate gains at high security demands, with optimized parameters yielding near-equal $\varepsilon_{PE}$ and $\varepsilon_{sec}$ and a consistently smaller $\varepsilon_{cor}$. The results show positive rates in regimes where standard or random parameter choices fail, highlighting a practical route to higher secure-key throughput in real-world QKD deployments. Overall, the CGA-based optimization provides a robust tool for tuning security parameters in CV- and DV-QKD to maximize performance under composable security guarantees.
Abstract
We investigate the optimization of epsilon-security parameters in quantum key distribution (QKD), aiming to improve the achievable secure key rate under a fixed overall composable security level. For this purpose, we employ a continuous genetic algorithm (CGA) to optimize the epsilon-security components of two representative protocols: the homodyne protocol from the continuous-variable (CV) family and the BB84 protocol from the discrete-variable (DV) family. We detail the CGA configuration, summarize the derivation of the composable key rate, and emphasize the role of the epsilon-parameters in both protocols. We then compare key rates obtained with optimized epsilon-values against those derived from standard and randomized choices. Our results demonstrate substantial key rate improvements at high security levels, where the key rate typically vanishes, and uncover positive-rate regimes that are inaccessible without optimization.
