Tighter Asymptotic Key Rates for Intensity-Correlated Decoy-State QKD via Nonlinear Programming
Matej Pivoluska, Mateus Araújo
TL;DR
This work addresses decoy-state QKD with intensity-correlated PRWCP, where standard decoy-state analysis fails due to intensity leakage across rounds. It advances a practical, reproducible two-stage approach: first solve the full CS-constrained nonlinear parameter-estimation problems with IPOPT to obtain high-quality linearization points, then perform a linearised outer optimization to certify a lower bound on the asymptotic key rate $K_ abla$. The authors develop coarse-grained model-independent CS formulations and fine-grained truncated-Gaussian models, demonstrating substantial improvements in key-rate bounds over canonical reference points, and in some cases proving optimality when both stages align. Simulations across model types show that IPOPT-derived reference points give tighter bounds, especially when channel models poorly reflect the actual device, and the method provides a drop-in upgrade to existing CS-based analyses with provable security guarantees.
Abstract
Decoy-state QKD with phase-randomized weak coherent pulses is typically analyzed assuming independent, precisely prepared intensities. Real sources, however, can exhibit correlated intensity drift across rounds, potentially leaking intensity information and breaking the standard decoy-state reduction to linear programs. Cauchy--Schwarz (CS) constraints can restore security by coupling $n$-photon yields across intensities, but they introduce nonlinear square-root constraints that are commonly handled via outer linearisation around channel-model-based reference points. We propose a reproducible alternative: first solve the full CS-constrained parameter-estimation problems using the interior-point nonlinear solver IPOPT, then use the resulting candidate solution as the linearisation point for the outer optimisation that certifies a valid lower bound on the asymptotic key rate. Simulations for both coarse-grained model-independent correlations and fine-grained truncated-Gaussian models show consistently tighter key-rate bounds than canonical reference points, and in some cases allow certifying optimality when both optimisation stages coincide.
