A proof of the Aaronson-Ambainis conjecture · PSI
Researchers at Physical Superintelligence (PSI) used an internal research system running an Anthropic model to find a complete proof for the long-standing Aaronson-Ambainis conjecture in quantum complexity theory. The proof establishes that quantum computers cannot achieve exponential speedups on random inputs without rare structural patterns. A computer-checked verification in the Lean proof assistant accepted the result, which was subsequently reviewed and validated by external mathematicians. Open article →
- An unreleased Anthropic model just helped solve a major quantum-computing question
- An unreleased Anthropic model solved an 18-year-old quantum computing problem, a startup says
- What is the Aaronson-Ambainis conjecture? PSI says an unreleased Anthropic (ANT) model found a proof
- Major quantum computing conjecture solved in three days after 18 years of uncertainty
- US Startup Physical Superintelligence Proves Aaronson-Ambainis Conjecture, A Key Open Problem In Quantum Computing
- Another major AI research breakthrough: Physical Superintelligence says its research system used ...
- AI HELPS SOLVE 18-YEAR-OLD QUANTUM COMPUTING PROBLEM Researchers at Physical Superintelligence u...
- BREAKING: Physical Superintelligence proved the Aaronson-Ambainis conjecture. Open since 2008. S...
- Adding more context: The Aaronson–Ambainis conjecture implies that a d-query quantum algorithm c...
- Holy Shit. An unreleased internal Anthropic model just helped solve an 18-year-old quantum comput...
- A non-public Anthropic model just proved a quantum computing problem that stayed open since 2008.
- SITUATION DETECTED: AI physics research lab Physical Superintelligence used a non-public Anthropi...
- another day, another absurd ai-assisted mathematical breakthrough. > 18-year-old quantum comp...
- A proof of the Aaronson‑Ambainis conjecture
- Congratulations -- this would be a major result if it holds. I’ve spent a fair amount of time on...
- aaronson ambainis quasipolynomial
- This is a slightly funny way to phrase it. Aaronson-Ambainis imply that a classical algorithm h...
- If this proof holds, it means that quantum computers are only polynomially faster than classical ...
- Anthropic’s UNRELEASED MODEL helped researchers solve an 18 year old conjecture in quantum comput...