Quantum Query Complexity Beyond the Worst Case

arXiv:2609.35580 · quant-ph, cs.CC · Submitted 2026-09-28 · Read on arXiv

quant-ph, cs.CC

Submitted: 2026-09-28

Updated: 2026-09-28

Terminology

• Query Complexity — 80× in this paper · explained in 2 episodes
• Alignment — 10× in this paper · explained in 1 episode
• Spectral Gap — 6× in this paper · explained in 5 episodes
• ACM Symposium on Theory of Computing — 4× in this paper
• Approximate Counting — 4× in this paper · explained in 1 episode
• Trace — 4× in this paper · explained in 2 episodes
• Annual ACM-SIAM Symposium on Discrete Algorithms — 2× in this paper
• Entanglement — 2× in this paper · explained in 3 episodes
• Adam — 1× in this paper · explained in 2 episodes
• Adaptation — 1× in this paper · explained in 1 episode
• Annual Symposium on Foundations of Computer Science — 1× in this paper
• Computational Biology — 1× in this paper · explained in 2 episodes
• Generalization — 1× in this paper · explained in 13 episodes
• Quantum Circuits — 1× in this paper · explained in 2 episodes
• Verification — 1× in this paper · explained in 2 episodes

Sources

• Quantum Amplitude Amplification and Estimation
• Approximate Quantum Fourier Transform in Logarithmic Depth on a Line
• Quantum Subroutine Composition
• A log-depth in-place quantum Fourier transform that rarely needs ancillas
• Certifying unknown-basis pure-state entanglement dimensionality with few measurement settings

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
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
• Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity