The paper proves finite-size general security for relativistic phase shift keying (RPSK) achieving secret key rates beyond 12 dB with 10^5 signals via entropy accumulation, Rényi leftover hashing, and conic optimization.
Operator convexity along lines, self-concordance, and sandwiched
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3verdicts
UNVERDICTED 3representative citing papers
A general conic optimization solver computes finite-size QKD rates from Rényi entropies more reliably than prior Frank-Wolfe methods.
Authors provide analytical bound and gradient for Rényi quantities to extend numerical QKD finite-key optimization, reporting gains in high-loss low-block regimes.
citing papers explorer
-
Finite-size general security for relativistic phase shift keying via variable-length quantum key distribution
The paper proves finite-size general security for relativistic phase shift keying (RPSK) achieving secret key rates beyond 12 dB with 10^5 signals via entropy accumulation, Rényi leftover hashing, and conic optimization.
-
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.
-
Generalized Numerical Framework for Improved Finite-Sized Key Rates with R\'enyi Entropy
Authors provide analytical bound and gradient for Rényi quantities to extend numerical QKD finite-key optimization, reporting gains in high-loss low-block regimes.