From Business Insider · Kelsey Vlamis · · 1m 20s
AI solves quantum computing's biggest open question
Physical Superintelligence Inc. used an unreleased Anthropic model to prove the Aaronson-Ambainis conjecture, a decades-old problem about quantum computing's limits.
In brief
Physical Superintelligence Inc. used an unreleased Anthropic model to prove the Aaronson-Ambainis conjecture, a decades-old problem about quantum computing's limits. Physical Superintelligence Inc. proved the Aaronson-Ambainis conjecture using an unreleased Anthropic model, settling a fundamental question about…
A quantum computing puzzle solved
Physical Superintelligence Inc. said Friday it used an unreleased Anthropic model to prove the Aaronson-Ambainis conjecture, a long-standing problem in quantum computing.
What the conjecture asked
The conjecture, open since two thousand eight, concerns determining when quantum computers can be significantly faster than regular computers. It was an educated guess never yet proven.
How fast the AI worked
David Turturean, a member of the technical staff at PSI, developed the research system using the unreleased Anthropic model. The system proved the conjecture within three days.
What the proof revealed
The proof shows that certain exponential advantages of quantum computing require special patterns or structures, meaning quantum computers have limits, which was long suspected.
Mathematicians worry about their field
The breakthrough follows OpenAI solving a ninety-year-old math problem in September. Terence Tao, a UCLA mathematics professor, said math's romantic era was over and an exciting but uncertain era was beginning.
“We are entering an era where exciting new things are possible, but some things are being lost.”
In short
Physical Superintelligence Inc. proved the Aaronson-Ambainis conjecture using an unreleased Anthropic model, settling a fundamental question about quantum computing's speed advantages.
