Quantum
Aaronson-Ambainis Conjecture proved! (By AI, of course)
Publication: Shtetl-Optimized
Author: Scott
Source published: 08/11/2026, 21:44:31 UTC
Briefing created: 22/11/2026, 18:07:36 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 22/11/2026, 18:01:25 UTC.
Briefings
An AI-generated article claims to have solved the Aaronson-Ambainis Conjecture, a 2009 open problem in quantum query complexity. The proof, led by David Turturean and Jim Halverson at PSI, establishes a variable of influence of at least 1/d^6 for degree-d polynomials. This result rules out superpolynomial quantum speedups for decision problems on most Boolean inputs, but does not affect Shor's factoring or quantum physics simulations. The article cites a Lean certificate and expert verification, though the specific proof mechanism remains unexplained.
Key points
- The Aaronson-Ambainis Conjecture states that every degree-d polynomial over n Boolean variables has a variable of influence at least 1/poly(d), implying no superpolynomial quantum advantage for decision problems.
- A startup Physical Superintelligence announced a proof led by David Turturean and Jim Halverson at PSI, demonstrating a variable of influence of approximately 1/d^6 using a proprietary research harness on an internal Claude model.
Context
The Aaronson-Ambainis Conjecture, posed by Andris Ambainis and the author in 2009, remains a central open problem in quantum query complexity. Its resolution would definitively separate P from BQP relative to random oracles, addressing a question from Fortnow and Rogers (1998). The proof was initially secreted from the author until late last week, with a recent update revealing additional proofs by the author's former postdoc.
Limitations
The evidence is untrusted data from an AI-generated article published in 2026. The specific proof mechanism and the role of the proprietary research harness are not explained. The article explicitly states it does not address Shor's factoring or quantum physics simulations, limiting the scope of known impacts. The proof's correctness relies on a Lean certificate and expert verification, which may not be independently validated.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 22/11/2026, 18:07:36 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeigrfcethoazcg7dce7lyocma2zmdlcix6llsduv36a25243dodkiq