Igor's KB Site

A personal website for information sharing

Follow me on GitHub

Breakthroughs Weekly — 9 November 2026

· breakthroughs · 1 item

An AI-produced, Lean-checked proof of the Aaronson-Ambainis conjecture on quantum speedups gains the conjecture's namesake as a believer; peer review is still pending.

Aaronson-Ambainis conjecture reported proved by an AI-driven research system

Shtetl-Optimized · 8 Nov 2026 · Quantum complexity

A team at Physical Superintelligence, led by David Turturean and Jim Halverson and working with a non-public Claude model inside its own research harness, has posted a proof that every bounded low-degree function has some variable with influence of roughly 1/d^6 or better. That is the long-open 2008 question linking low-degree polynomials to limits on quantum speedups. The argument comes with a machine-checked Lean certificate, and Scott Aaronson, who first posed the conjecture, says he believes it is correct on that basis and because human experts have read and understood it, though he has not yet gone through it himself. Stanford and MIT researchers have written an exposition for specialists. The result has not been through formal peer review.


← All digests · Site home