“An 18-year-old mathematical problem concerning the limits of quantum computing may finally have been solved in just three days. Physics research company PSI claims to have cracked the long-standing Aaronson-Ambainis conjecture, potentially shedding new light on when quantum computers can outperform conventional machines.
The company said its system completed the proof of the Aaronson-Ambainis conjecture in three days. The problem, first proposed in 2008, concerns the conditions under which quantum computers can achieve an exponential speed advantage over conventional computers.
PSI said its research system used a non-public model from Anthropic, running on the company’s own infrastructure. The system produced a mathematical proof that was accepted by Lean, a proof-assistant software used to check the logical correctness of formal mathematical arguments.
The company said the system subsequently improved the proof twice, with Lean accepting the final version as well.
However, the result has not yet undergone full independent academic review.”
From Interesting Engineering.