Reliable numerical key rates for quantum key distribution
classification
🪐 quant-ph
keywords
ratesdistributionmethodnumericalquantumreliableabilityapproach
read the original abstract
In this work, we present a reliable, efficient, and tight numerical method for calculating key rates for finite-dimensional quantum key distribution (QKD) protocols. We illustrate our approach by finding higher key rates than those previously reported in the literature for several interesting scenarios (e.g., the Trojan-horse attack and the phase-coherent BB84 protocol). Our method will ultimately improve our ability to automate key rate calculations and, hence, to develop a user-friendly software package that could be used widely by QKD researchers.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Finite-size quantum key distribution rates from R\'enyi entropies using conic optimization
A general conic optimization solver computes finite-size QKD rates from Rényi entropies more reliably than prior Frank-Wolfe methods.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.