PSI Reports Machine-Checked Proof of the Aaronson-Ambainis Conjecture

The Proof Systems Institute has reported a machine-checked formal proof of the Aaronson-Ambainis conjecture, a long-standing open problem in quantum computing complexity theory relating query complexity and influence of Boolean functions. The proof was verified using a formal proof assistant, marking a significant milestone in the intersection of AI-assisted mathematical reasoning and theoretical computer science. For developers following AI's expanding role in mathematics and formal verification, this represents a concrete example of machine-verified proofs tackling frontier research problems rather than textbook exercises. The result has implications for understanding the computational limits of quantum algorithms and may influence future research directions in quantum complexity. Teams working on formal verification tooling or AI-assisted theorem proving should note this as a benchmark of what current proof assistants can certify.