Establishes dimension-free one-shot pairwise bounds for multiple quantum hypothesis testing, resolves Audenaert-Mosonyi conjecture, and proves achievability of multiple quantum Chernoff distance for arbitrary separable Hilbert spaces.
Generalized self-testing and the security of the 6 -state protocol , Year =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
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.
citing papers explorer
-
Multiple Quantum Hypothesis Testing: One-Shot Pairwise Bounds and Sharp Asymptotics
Establishes dimension-free one-shot pairwise bounds for multiple quantum hypothesis testing, resolves Audenaert-Mosonyi conjecture, and proves achievability of multiple quantum Chernoff distance for arbitrary separable Hilbert spaces.
-
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.