Aaronson-Ambainis Conjecture Reportedly Proved Amid Misreading Backlash

The Aaronson-Ambainis conjecture, linking polynomial quantum speedups to a conjecture about polynomials, has reportedly been proved. Researchers are pushing back against widespread misreadings, clarifying that it does not rule out super-polynomial speedups like Shor's algorithm.

2026-11-07 ~ 2026-11-08 · 2 related posts

Full story(2 episodes)→

• Episode 1: PSI's AI System Proves 18-Year-Open Aaronson-Ambainis Conjecture in Three Days(2026-11-06, 14 posts)
• Episode 2: Aaronson-Ambainis Conjecture Reportedly Proved Amid Misreading Backlash(2026-11-07, 2 posts)

• Aaronson-Ambainis conjecture caps query complexity, not super-polynomial quantum speedups in computation — thomasahle · 2026-11-07
• Aaronson-Ambainis conjecture reportedly proved, experts rush to correct wrong takes — skdh · 2026-11-08