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: 09/11/2026, 03:40:39 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 09/11/2026, 03:01:25 UTC.
Briefings
AI-generated content claims to prove the Aaronson-Ambainis Conjecture, asserting a variable of influence of at least 1/d^6 exists for bounded-degree polynomials. The proof was led by David Turturean and Jim Halverson at PSI, utilizing a proprietary research harness on an internal Claude model. While a Lean certificate and expert review support the claim, the evidence is unverified and the specific mechanism remains unclear. The result does not affect quantum supremacy for factoring or quantum physics, but may impact decision problem separability.
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 using a proprietary harness on an internal Claude model, led by David Turturean and Jim Halverson at PSI.
Context
The Aaronson-Ambainis Conjecture, posed in 2009, implies no superpolynomial quantum advantage over classical query complexity for decision problems. Its proof would resolve a question from Fortnow and Rogers (1998). The AI-generated article notes the conjecture was previously unsolved and highlights the role of Fourier analysis experts in the field.
Limitations
The evidence is untrusted and AI-generated; the specific mechanism of the proof using the Claude model is unknown. The Lean certificate and expert review are mentioned but not independently verified. The article does not confirm the proof's correctness or the exact impact on quantum computing beyond the stated decision problem implications.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 09/11/2026, 03:40:39 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeifqob6usv4xf7xlpd2lsddpaxjrbk64my76bv2p6svgnq7vwwfnmm