Superlinear Quantum Query Lower Bounds for Subgraph Detection

arXiv:2609.40263 · quant-ph, cs.DS · Submitted 2026-09-30 · Read on arXiv

quant-ph, cs.DS

Submitted: 2026-09-30

Updated: 2026-10-05

Comments: 41 pages; v2: minor revisions and improvements

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

Terminology

• Core — 27× in this paper · explained in 2 episodes
• Query Complexity — 10× in this paper · explained in 2 episodes
• Graph Construction — 3× in this paper · explained in 3 episodes
• Adjacency Matrix — 2× in this paper
• Generalization — 2× in this paper · explained in 13 episodes
• Trace — 2× in this paper · explained in 2 episodes
• Combinatorial Optimization — 1× in this paper · explained in 2 episodes
• Embeddings — 1× in this paper · explained in 2 episodes
• Generative AI — 1× in this paper · explained in 2 episodes
• Multiplicative Adversary Method — 1× in this paper · explained in 2 episodes

Sources

• Tight Quantum Lower Bound for k-Distinctness

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
• Incoherent Imaging with Spatially Structured Quantum Probes
• A quasiparticle-protected superconducting qubit
• Theory of quantum-enhanced interferometry with general Markovian light sources