Optimizing Epsilon Security Parameters in QKD
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
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.