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: 08/11/2026, 22:22:23 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 08/11/2026, 21:46:25 UTC.
Briefings
An AI-generated article claims to prove the Aaronson-Ambainis Conjecture, asserting a variable of influence of at least 1/d^6 using a proprietary internal model. The proof is supported by a Lean certificate and reviewed by human experts, though the specific algorithmic steps remain unexplained. The article notes that while the conjecture is true, it does not affect quantum supremacy for factoring or quantum chemistry, citing the Yamakawa-Zhandry 2022 breakthrough as a counterpoint. It also references a 2019 blog post by the author regarding an earlier failed attempt to solve the problem.
Key points
- The Aaronson-Ambainis Conjecture states that every bounded-degree polynomial on Boolean variables has a variable with influence at least 1/poly(d).
- A startup Physical Superintelligence announced a proof of this conjecture, demonstrating a variable of influence of at least 1/d^6 using an internal Claude model.
Context
The Aaronson-Ambainis Conjecture, posed in 2009, implies no superpolynomial advantage of quantum query complexity over classical query complexity for decision problems. Its proof would resolve a question from Fortnow and Rogers (1998). The proof was led by David Turturean and Jim Halverson at PSI, with a Lean certificate and expert review confirming its validity.
Limitations
The evidence is untrusted data from an AI-generated article. The specific algorithmic steps of the proof are not explained. The article does not provide a full mathematical proof, only a certificate and expert review. The impact on quantum supremacy for factoring and chemistry is limited to ruling out one specific type of supremacy, not all forms. The article does not state the source link.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 08/11/2026, 22:22:23 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeiauxlmae7q7hdkpxv2tqzevfukxcmc4m3mlfa4yvpfjxmmply777i