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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2representative citing papers
Models EGS as Erlang loss system, derives blocking probability formulas for three scenarios, proves insensitivity theorem depending only on mean attempt and calibration durations.
citing papers explorer
-
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.
-
An on-demand resource allocation algorithm for a quantum network hub and its performance analysis
Models EGS as Erlang loss system, derives blocking probability formulas for three scenarios, proves insensitivity theorem depending only on mean attempt and calibration durations.