Aaronson-Ambainis conjecture caps query complexity, not super-polynomial quantum speedups in computation
thomasahle · x · 2026-11-07
thomasahle corrects a common framing: the Aaronson-Ambainis conjecture implies classical algorithms need at most polynomially more queries to an input function — but for factoring, reading the input is easy (linear time). AA says nothing about super-polynomial quantum speedups in the computation itself, so invoking it as a general cap on quantum advantage is misleading.
More from Research
- DSReg: multi-lab preprint disentangles predictive representations without decoders — jiqizhixin · 2026-11-07
- New paper 'Inter-AI Morality' studies how AI systems treat one another — jacyanthis · 2026-11-07
- Steering one GQA key/value group makes a model claim "I am a user" 40 of 40 times — Sauers_ · 2026-11-07
- New research examines the economics of AI for science: winners and bottlenecks — Afinetheorem · 2026-11-07
- Sand3D Explorer lets you browse 106K+ 3D objects with parts, mechanisms and code — victormustar · 2026-11-07
- AI for bio is here: agent usage in Benchling surged through late 2026 — AllThingsApx · 2026-11-07