Noisy Quantum Query Complexity via Fractional Block Sensitivity

arXiv:2610.00506 · quant-ph, cs.CC · Submitted 2026-09-30 · Read on arXiv

quant-ph, cs.CC

Submitted: 2026-09-30

Updated: 2026-10-02

Comments: 34 pages, LaTex, fixed typos, updated acknowledgement, fixed mathjax in abstract

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Query Complexity — 26× in this paper · explained in 2 episodes
• Generalization — 3× in this paper · explained in 13 episodes
• Fidelity — 1× in this paper · explained in 2 episodes
• Verification — 1× in this paper · explained in 2 episodes

Sources

• Quantum Advantage with Faulty Oracle
• Hybrid Quantum-Classical Search Algorithms

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• A quasiparticle-protected superconducting qubit
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians