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.
Title resolution pending
6 Pith papers cite this work, alongside 1 external citations. Polarity classification is still indexing.
6
Pith papers citing it
1
external citations · external index
citation-role summary
background 2
method 1
citation-polarity summary
fields
quant-ph 6verdicts
UNVERDICTED 6representative citing papers
Rigorous security proofs for variable-length QKD, phase-error bounding with imperfect detectors, marginal-constrained entropy accumulation, and authentication reductions place practical QKD on firmer mathematical ground.
A virtual protocol based on universal source compression enables asymptotically tight finite-size security proofs for permutation-symmetrizable QKD by reducing the problem to conditional Rényi entropy estimation.
Authors introduce quantum computational min- and max-entropies with properties including data processing and chain rules, plus an operational link to bounded-circuit entanglement distillation.
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.
Overview of recent analytical and numerical developments in QKD security proofs that incorporate imperfections to re-establish security under realistic conditions.
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.
-
Rigorous Security Proofs for Practical Quantum Key Distribution
Rigorous security proofs for variable-length QKD, phase-error bounding with imperfect detectors, marginal-constrained entropy accumulation, and authentication reductions place practical QKD on firmer mathematical ground.
-
Asymptotically tight security analysis of quantum key distribution based on universal source compression
A virtual protocol based on universal source compression enables asymptotically tight finite-size security proofs for permutation-symmetrizable QKD by reducing the problem to conditional Rényi entropy estimation.
-
Fully Quantum Computational Entropies
Authors introduce quantum computational min- and max-entropies with properties including data processing and chain rules, plus an operational link to bounded-circuit entanglement distillation.
-
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.
-
Quantum Key Distribution with Imperfections: Recent Advances in Security Proofs
Overview of recent analytical and numerical developments in QKD security proofs that incorporate imperfections to re-establish security under realistic conditions.