Optimizing Epsilon Security Parameters in QKD
- URL: http://arxiv.org/abs/2512.18130v1
- Date: Fri, 19 Dec 2025 23:26:08 GMT
- Title: Optimizing Epsilon Security Parameters in QKD
- Authors: Alexander G. Mountogiannakis, Stefano Pirandola,
- Abstract summary: We employ a continuous genetic algorithm (CGA) to optimize the epsilon-security components of two representative protocols.<n>We show substantial key rate improvements at high security levels, where the key rate typically vanishes.
- Score: 41.99844472131922
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- 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.
Related papers
- ECPv2: Fast, Efficient, and Scalable Global Optimization of Lipschitz Functions [91.31596562378076]
ECPv2 is a scalable and theoretically grounded algorithm for global optimization of Lipschitz-continuous functions with unknown Lipschitzs.<n>We show that ECPv2 retains ECP's no-regret guarantees with optimal-time bounds and expands the acceptance region with these findings.
arXiv Detail & Related papers (2025-11-20T17:30:55Z) - Security of deterministic key distribution with higher-dimensional systems [0.0]
We determine the security aspects of the two-way quantum key distribution protocol designed by M. Lucamarini and S. Mancini in 2005.<n>We employ arbitrary finite-dimensional systems against both individual and collective attacks by the eavesdropper.
arXiv Detail & Related papers (2025-05-22T18:04:17Z) - Improved finite-size effects in QKD protocols with applications to decoy-state QKD [0.0]
We present a finite-size security proof for generic quantum key distribution protocols against independent and identically distributed collective attacks.<n>We extend our proof to coherent attacks and variable-length protocols.
arXiv Detail & Related papers (2025-02-07T23:37:50Z) - On the Convergence of DP-SGD with Adaptive Clipping [56.24689348875711]
Gradient Descent with gradient clipping is a powerful technique for enabling differentially private optimization.<n>This paper provides the first comprehensive convergence analysis of SGD with quantile clipping (QC-SGD)<n>We show how QC-SGD suffers from a bias problem similar to constant-threshold clipped SGD but can be mitigated through a carefully designed quantile and step size schedule.
arXiv Detail & Related papers (2024-12-27T20:29:47Z) - Improved finite-size key rates for discrete-modulated continuous variable quantum key distribution under coherent attacks [0.0]
We consider a prepare-and-measure CVQKD protocol, where Alice chooses from a set of four coherent states and Bob performs a heterodyne measurement.<n>We provide a security proof against coherent attacks in the finite-size regime, and compute the achievable key rate.
arXiv Detail & Related papers (2024-07-03T13:18:31Z) - Greedy based Value Representation for Optimal Coordination in
Multi-agent Reinforcement Learning [64.05646120624287]
We derive the expression of the joint Q value function of LVD and MVD.
To ensure optimal consistency, the optimal node is required to be the unique STN.
Our method outperforms state-of-the-art baselines in experiments on various benchmarks.
arXiv Detail & Related papers (2022-11-22T08:14:50Z) - Data post-processing for the one-way heterodyne protocol under
composable finite-size security [62.997667081978825]
We study the performance of a practical continuous-variable (CV) quantum key distribution protocol.
We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime.
This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
arXiv Detail & Related papers (2022-05-20T12:37:09Z) - Performance analysis of continuous-variable quantum key distribution
using non-Gaussian states [0.0]
In this study, we analyze the efficiency of a protocol with discrete modulation of continuous variable non-Gaussian states.
We calculate the secure key generation rate against collective attacks using the fact that Eve's information can be bounded based on the protocol.
arXiv Detail & Related papers (2021-12-19T11:55:17Z) - Composably secure data processing for Gaussian-modulated continuous
variable quantum key distribution [58.720142291102135]
Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties.
We consider a protocol with homodyne detection in the general setting of composable finite-size security.
In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
arXiv Detail & Related papers (2021-03-30T18:02:55Z) - Optimizing the Decoy-State BB84 QKD Protocol Parameters [3.6954802719347413]
The performance of a QKD implementation is determined by the tightness of the underlying security analysis.
It is known that optimal protocol parameters, such as the number of decoy states and their intensities, can be found by solving a nonlinear optimization problem.
We show an improved performance for the Decoy-State BB84 QKD protocol, demonstrating that the assumptions typically made are too restrictive.
arXiv Detail & Related papers (2020-06-29T12:06:16Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.