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.
Solving natural conic formulations with
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
New extended-variable relaxations are derived for CGMESP that generalize prior bounds for CMESP and binary D-optimality and are tested numerically inside branch-and-bound.
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.
-
Extended-variable relaxations for the constrained generalized maximum-entropy sampling problem
New extended-variable relaxations are derived for CGMESP that generalize prior bounds for CMESP and binary D-optimality and are tested numerically inside branch-and-bound.