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.
Shor and John Preskill , Date-Added =
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 4verdicts
UNVERDICTED 4roles
background 1polarities
background 1representative citing papers
Quantum state-based addressing in networks removes classical communication needs and is proven equivalent to performing tasks in superposition.
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.
Higher-dimensional two-way QKD protocols using mutually unbiased bases and Heisenberg-Weyl operators yield secret keys for stronger individual attacks and improved robustness to collective eavesdropping via entropic uncertainty relations.
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.
-
Addressing a device in a quantum network: A quantum approach including routing
Quantum state-based addressing in networks removes classical communication needs and is proven equivalent to performing tasks in superposition.
-
Lower overhead fault-tolerant building blocks for noisy quantum computers
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.
-
Security of deterministic key distribution with higher-dimensional systems
Higher-dimensional two-way QKD protocols using mutually unbiased bases and Heisenberg-Weyl operators yield secret keys for stronger individual attacks and improved robustness to collective eavesdropping via entropic uncertainty relations.