Aaronson-Ambainis conjecture reportedly proved, experts rush to correct wrong takes
skdh · x · 2026-11-08
The Aaronson-Ambainis conjecture in quantum computing complexity theory has reportedly been proved. Researcher quantumashley flagged the result while pushing back on what she calls a wave of completely incorrect commentary about its implications, publishing a thread to clarify what the proof does and doesn't mean. skdh amplified the clarification.
Related event: Aaronson-Ambainis Conjecture Reportedly Proved Amid Misreading Backlash(2 posts)→
More from Research
- Alibaba's Co-Design Bench: top model fully solves only 26.4% of real coding tasks — The Decoder · 2026-11-08
- VINO sets new ScanNet SOTA for 3D instance segmentation at AP50 83.4 — NielsRogge · 2026-11-08
- Tencent's Terminal-RSI: a 27B model that rewrites and retrains itself with zero humans — Scobleizer · 2026-11-08
- Oxford statistics professor Robin Evans, causal inference scholar, dies at Oxford — yudapearl · 2026-11-08
- METR sensitivity analysis: AI capability slope increase often vanishes by method — tobyordoxford · 2026-11-08
- Weight Space Programming: Claude Opus 5.5 beats GPT-6 Astra at hand-written 18-weight parity transformer — RobertTLange · 2026-11-08