A private lab (Physical Superintelligence) claims a machine‑generated proof — backed by an internal Claude model and a Lean formal certificate — of the Aaronson–Ambainis conjecture, a key statement linking polynomial influence to quantum query complexity. The claimed result has an explicit complexity‑theory implication: it limits how often quantum query algorithms can outperform classical ones on most inputs.
— If true and reproducible, this is a watershed moment showing that proprietary AI systems can produce machine‑verifiable breakthroughs that alter foundational scientific and policy narratives about AI's role in research, intellectual credit, and reproducibility.
Scott
2026.11.08
100% relevant
Physical Superintelligence's announcement (David Turturean and Jim Halverson) and the posted Lean certificate for the AA Conjecture proof, plus Scott Aaronson's on‑record discussion of the quantum‑complexity consequences.
← Back to all ideas