A proof of the Aaronson-Ambainis conjecture · PSI

Researchers at Physical Superintelligence (PSI) used an internal research system running an Anthropic model to find a complete proof for the long-standing Aaronson-Ambainis conjecture in quantum complexity theory. The proof establishes that quantum computers cannot achieve exponential speedups on random inputs without rare structural patterns. A computer-checked verification in the Lean proof assistant accepted the result, which was subsequently reviewed and validated by external mathematicians. Open article →