Fortnow asks Claude about complexity in the Aronson-Ambainis proof: Promise-BQP-complete
fortnow · x · 2026-11-11
Theoretical computer scientist Lance Fortnow wondered about the complexity of finding the influential variable in the new Aronson-Ambainis proof, so he asked Claude. Answer: Promise-BQP-complete when given a quantum circuit, or solvable with O(log n log log n) queries to the polynomial. A neat example of using frontier models to assist theoretical CS research.
More from Research
- LLMs aren't discrete: tokens are just ~0.00001% of the continuous process — Sauers_ · 2026-11-11
- Prism capability extraction: specialists carved from Qwen 27B at <20% memory match full model — tokenbender · 2026-11-11
- Data Colada Flags Fraud in Fifth Francesca Gino Paper, No Forensics Needed — danielrock · 2026-11-11
- Fable 5.2 tops GDPx chip-design benchmark, but task authors see zero gains — ycombinator · 2026-11-11
- Backdooring AI agents by reprogramming fewer than 10 dormant neurons — no training needed — DimitrisPapail · 2026-11-11
- Duke and Princeton paper: 10 small parallel agent teams beat best-of-N and one giant team — rohanpaul_ai · 2026-11-11