TBNQuantum
Aaronson-Ambainis Conjecture proved! (By AI, of course)
Publication: Shtetl-Optimized
Author: Scott
Source published: 08/11/2026, 21:44:31 UTC
Briefing created: 15/11/2026, 05:41:49 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 10/11/2026, 02:31:24 UTC.
Briefings
An AI-generated article claims an AI solved the Aaronson-Ambainis Conjecture, a 2009 open problem in quantum query complexity. The evidence states a startup led by David Turturean and Jim Halverson at PSI published a proof using a proprietary research harness on an internal Claude model, achieving a variable of influence of ~1/d6. The article argues this rules out specific quantum speedups for yes-or-no problems but does not affect Shor's factoring or quantum physics simulation. It also notes a Lean certificate and expert review of the proof.
Key points
- A startup led by David Turturean and Jim Halverson at PSI published a proof of the Aaronson-Ambainis Conjecture in November 2026 using a proprietary research harness on an internal Claude model.
- The proof establishes a variable of influence of approximately 1/d^6, which rules out specific quantum speedups for yes-or-no problems relative to random oracles but does not affect Shor's factoring algorithm.
Context
The Aaronson-Ambainis Conjecture, posed in 2009, implies no superpolynomial advantage of quantum query complexity over classical query complexity for decision problems on most Boolean inputs. This finding was significant as it would have answered a question of Fortnow and Rogers from 1998 regarding the separation of P and BQP relative to a random oracle.
Limitations
The evidence is untrusted data from an AI-generated article. The specific role of the proprietary research harness compared to the internal model is unknown. The proof's correctness is supported by a Lean certificate and expert review, but the article itself contains editorial guidance v2 that describes public consequences only when supported by source evidence, distinguishing actual impact from claims or forecasts.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 15/11/2026, 05:41:49 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeiai3f5fz4n2x764umjkyanrofjk3s5qbbhnvy5g4q2fwaxr62yyqe