Aaronson-Ambainis conjecture proved: an unreleased Anthropic model settles the 18-year-old quantum question, Lean-checked
Originally published at https://aifrontierpost.com/articles/psi-anthropic-aaronson-ambainis-conjecture-proof/ An AI research system running an unreleased Anthropic model has proved the Aaronson-Ambainis conjecture, an 18-year-old open problem in quantum computing — and the Lean proof assistant has verified every step of the argument. TL;DR: Physical Superintelligence (PSI) announced on November…
Physical Superintelligence (PSI) announced that its research system, utilizing a non-public Anthropic model, has proven the Aaronson-Ambainis conjecture, an 18-year-old open problem in quantum computing. The Lean proof assistant verified the proof, which asserts that quantum computers cannot be exponentially faster than classical computers on random inputs.
The conjecture, proposed by computer scientists Scott Aaronson and Andris Ambainis, explores the potential for quantum computers to achieve exponential speedups on random inputs, a question that has remained unresolved since 2008. The proof, developed by PSI's technical staff member David Turturean, shows that some bit has influence at least c·v5/2/d6, where c is approximately 0.0025. PSI and an independent Stanford group are currently verifying the formal statement.
Written by urgent.news from Dev.to's reporting — not their text. Machine-written — may contain errors; check the original before relying on it.
This story
This is one outlet's version. Read the fullest account.
