Efficient Computation of QKD Key Rates without Semidefinite Programming
quant-ph
Submitted: 2026-08-24
Updated: 2026-09-17
Comments: 16+18 pages, 8 figures; the updated version includes rational approximations
License: http://creativecommons.org/licenses/by-nc-nd/4.0/
The gist: Translating observed data into a reliable estimate of the secure key rate is a crucial step for operating a quantum key distribution device.
Terminology
Abstract
Translating observed data into a reliable estimate of the secure key rate is a crucial step for operating a quantum key distribution device. We provide a computational method for this task that only requires eigenvalue computations and is therefore both fast and resource efficient. In contrast, existing approaches rely on semidefinite programming or programming on the entropy cone, whose memory requirements can scale as d 4 in the underlying Hilbert-space dimension. Our method reduces this requirement to d squared. A minimal implementation of our algorithm takes fewer than 100 lines of Common Lisp. We demonstrate real-time key-rate estimation on a Raspberry Pi with a 1 GB memory and a Cortex-A53 processor. Despite these modest resources, our implementation outperforms existing workstation-based benchmarks by several orders of magnitude. Non-numerical verification can be incorporated with little overhead using rational approximations. These results open the way toward embedding complete numerical security analysis directly into qkd hardware.
Sources
- Marginal-constrained entropy accumulation theorem
- QICS: Quantum Information Conic Solver
- Security proofs for practical QKD: variations, techniques, gaps, and limitations
- Effective discrete-modulated continuous variable QKD under general attacks
- Reliable Entropy Estimation from Observed Statistics for Device-Independent Quantum Cryptography
- Classical and Quantum Iterative Optimization Algorithms Based on Matrix Legendre-Bregman Projections
- Variational Quantum State Eigensolver
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians