독서리서치레이더투자 프레임워크
로그인 / 회원가입
← 읽기로 돌아가기
뉴스주제 · PSI Aaronson-Ambainis Proof중대1 분 소요DisconfirmAI 편집부

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.

출처

로그인 / 회원가입
독서리서치레이더투자 프레임워크
spektrum.de↗
  • heise.dec't Magazin↗
  • 주제

    PSI Aaronson-Ambainis Proof

    AI startup Physical Superintelligence (PSI) announced on November 6, 2026, that it proved the Aaronson-Ambainis conjectu…

    4 단계1 건업데이트됨 2026-11-21 20:38

    현재까지의 과정

    1. 2008-11-012008-11-01: Scott Aaronson and Andris Ambainis formulate the conjecture concerning polynomial influence and quantum query limits.psi.inc ↗
    2. 2026-08-012026-08-01: Stanford researchers (Blanc, Docter, Strassle, Tan) prove the conjecture's prediction for a special case involving fixed-round parallel queries.psi.inc ↗
    3. 2026-11-062026-11-06: PSI publishes the proof of the full Aaronson-Ambainis conjecture, generated by an internal system using a non-public Anthropic model and verified by Lean.psi.inc ↗

    아직 해결되지 않은 문제

    • Has the formal Lean statement been independently confirmed by the mathematical community to exactly match the original 2008 conjecture?
    • Will the proof undergo standard academic peer review, given the current status as an arXiv preprint?
    • What are the precise implications for the BPP vs BQP problem in unrelativized worlds as suggested by the new theorem?
    전체 주제 읽기 →
    리서치 계속하기 →