ReadingResearchRadarInvestment framework
Sign in / Sign up
← Back to reading
NewsMaterial1 min readDisconfirmAI Editorial

AI Startup PSI Proves Aaronson-Ambainis Conjecture Using Internal Anthropic Model, Defining Quantum Computing Limits

AI startup PSI announced it proved the Aaronson-Ambainis conjecture using an internal Anthropic model, a result verified by experts from MIT and Stanford.

2026-11-09 20:00 GMT+8

German tech outlet heise and science magazine Spektrum der Wissenschaft report that AI startup Physical Superintelligence (PSI) announced in early November 2026 that it had successfully proven the "Aaronson-Ambainis conjecture" using a non-public Anthropic language model. Proposed by Scott Aaronson and Andris Ambainis in 2009, this conjecture explores whether quantum computers possess exponential speedup capabilities when processing unstructured random inputs.

According to Spektrum der Wissenschaft, the proof has been verified by an automated theorem prover and independently reviewed by four researchers from the Massachusetts Institute of Technology (MIT) and Stanford University. Experts described it as a "breakthrough result," noting that it confirms quantum algorithms cannot achieve exponential advantage over classical algorithms for most unstructured decision problems in the query model.

This finding does not negate the overall value of quantum computing. Peter Shor's algorithm for factoring large numbers remains effective because it relies on specific input structures. Additionally, quantum computers retain potential advantages in fields such as chemical simulation and physical system modeling, where quantum states are encoded. The proof primarily rules out the "omnipotent" quantum supremacy previously envisioned by some optimists for general random problems.

Sources

Sign in / Sign up
ReadingResearchRadarInvestment framework
spektrum.de
↗
  • heise.dec't Magazin↗
  • Continue researching →