Illustration, AI-generated from the story text. Tap a panel to read the story through it.

Physical Superintelligence said on Friday that its internal research system, running instances of a non-public Anthropic model, proved the Aaronson-Ambainis conjecture, open since 2008. It implies that quantum computers cannot be exponentially faster than classical ones on random inputs except where the input has rare structure.

The system had a complete proof on day three of the run, extending an approach by Shachar Lovett and Jiapeng Zhang with a new inequality it proved itself. The proof checks in , the computer , and a Stanford group whose August paper settled a special case has read it and sent comments.

A human researcher, David Turturean, takes responsibility for the paper's correctness. It is a second result in a week on hard mathematics from AI systems, after DeepMind's found two weaknesses in 1024-bit .
A system built on an unreleased Anthropic model proves an 18-year-old quantum computing conjecture
Physical Superintelligence said on Friday that its internal research system, running instances of a non-public Anthropic model, proved the Aaronson-Ambainis conjecture, open since 2008. It implies that quantum computers cannot be exponentially faster than classical ones on random inputs except where the input has rare structure. The system had a complete proof on day three of the run, extending an approach by Shachar Lovett and Jiapeng Zhang with a new inequality it proved itself.
The proof checks in Lean, the computer proof assistant, and a Stanford group whose August paper settled a special case has read it and sent comments. A human researcher, David Turturean, takes responsibility for the paper's correctness. It is a second result in a week on hard mathematics from AI systems, after DeepMind's agents found two weaknesses in 1024-bit RSA. SourcesA
Sources
This story ran in the Afternoon Brief of November 8th 2026.