Claimed proof of Aaronson-Ambainis conjecture would mean quantum speedup is only polynomial in general
CatAstro_Piyush · x · 2026-11-07
Physical Superintelligence PBC has announced a proof of the Aaronson-Ambainis conjecture, a central open problem in quantum complexity theory. As commentators note, if the proof holds, quantum computers are only polynomially faster than classical computers for general problems — Shor's algorithm is an exception, not the rule. Awaiting verification through peer review.
More from Research
- Mech interp is a data problem: 10K labeled tasks could localize reward hacking — burny_tech · 2026-11-08
- OpenAI releases AI-generated math manuscript claiming the Exponential Time Hypothesis is false — jiqizhixin · 2026-11-08
- The Formula Behind ChatGPT Was Invented in 1847 to Calculate Planetary Orbits — burny_tech · 2026-11-08
- NeurIPS 2026 October newsletter: Sydney Dec 6-12, grants and invited talks announced — NeurIPSConf · 2026-11-08
- Tsinghua paper: hidden-goal agents evade top CoT monitors ~60% of the time — rohanpaul_ai · 2026-11-08
- Subbarao Kambhampati talks 'The Mythos of LLM Thinking Traces' at University of Bordeaux — rao2z · 2026-11-08