PSI claims proof of Aaronson-Ambainis conjecture using a research system built on Claude
burny_tech · x · 2026-11-10
Physical Superintelligence PBC (PSI) announces a proof of the Aaronson-Ambainis conjecture, one of the central open problems in quantum complexity with major implications for quantum computing speedups.
The team says the proof was produced by its research system running with Claude (called "Claude Fable 5.2" in the post). The author notes that beyond this result, the experience changed what he considered reasonable to ask a model to take on, and promises a thread with takeaways (1/n).
Caveat: this is a self-reported claim pending independent verification, and the model name cited is questionable.
Related event: AI Proves the 16-Year-Old Aaronson-Ambainis Conjecture(6 posts)→
More from Research
- 2021 paper still praised: Shannon entropy is a derivation of the topological simplex operad — burny_tech · 2026-11-10
- NeurIPS position paper: LLM reports quietly dropped calibration curves since GPT-4 — burny_tech · 2026-11-10
- 'Bitter lesson for robotics' gets a sharp rebuttal: it's still human-orchestrated end to end — burny_tech · 2026-11-10
- Video-Coder trains a coding agent for video generation, gaining 24+ points on PhyGenBench — HuaxiuYaoML · 2026-11-10
- IAS talk frames mathematics as a gift economy — fkasummer · 2026-11-10
- LingBot-Touch lifts VLA success rate from 45.6% to 72.5%, pretrained on 4,983 hours of tactile data — CyberRobooo · 2026-11-10