A proof of the Aaronson-Ambainis conjecture
cs.CC, quant-ph
Submitted: 2026-11-06
Updated: 2026-11-06
Code: https://github.com/physical-superintelligence/aaronson-ambainis
Terminology
Sources
- Oracle Separations for the Quantum-Classical Polynomial Hierarchy
- Aaronson-Ambainis Conjecture Is True For Random Restrictions
- On the Fourier spectrum of functions on Boolean cubes
- On the sum of the L1 influences of bounded functions
- Distributional Variants of the Aaronson-Ambainis Conjecture
- Composition limits and separating examples for some Boolean function complexity measures
- Exploring the Varchenko Determinant of Partial Cubes
- Quantum speedups need structure
- Parallel Quantum Advantage with Limited Adaptivity Requires Structure
Related papers
- The Proof Analysis Problem for Constant-Depth Frege
- Hardness of Counting Orderings: Taking Gadget Amplification to the Limit
- Rigorous Low-Degree Implications for Planted Subgraph Detection: Noise and Treewidth
- Parameterized Hardness of Zonotope Containment and Neural Network Verification
- From Block Orthogonality to Decidability in Complex-Weighted Counting CSP
- Random Clocks on Computation Paths: How Far Can They Reach, and When Does Stepping Back Help?