Problem
Research questions and friction points this paper is trying to address.
Quantum Approximate Optimization Algorithm
FGG conjecture
approximation ratio
ring of disagrees
quantum optimization
A Machine-Verified Proof of a Quantum-Optimization Conjecture
🤖 AI Summary
This work resolves the decade-old Farhi–Goldstone–Gutmann (FGG) conjecture in quantum optimization, which posits whether depth-$p$ QAOA can exactly achieve an approximation ratio of $(2p+1)/(2p+2)$ on the “disagrees ring.” We present the first approach that integrates a large language model (Claude Fable 5) with the formal verification system Lean 4, employing an agent-based toolchain to automatically uncover hidden dynamical symmetries. This insight transforms the existential challenge into an explicit constructive proof, yielding the first machine-generated and formally verified complete proof of the FGG conjecture. Human intervention is limited to confirming the formal problem statement, thereby significantly advancing AI-driven research in quantum information theory.
📝 Abstract
We report a machine-verified resolution of a problem open for over a decade in quantum optimization: the Farhi, Goldstone and Gutmann (FGG) conjecture that depth-$p$ Quantum Approximate Optimization Algorithm (QAOA) on the ring of disagrees attains approximation ratio $(2p+1)/(2p+2)$ exactly. We found the proof using a large language model, Claude Fable 5, and verified its correctness end-to-end by the Lean 4 proof assistant. Our methodology includes several ingredients: building on a substantial Lean library of quantum information, we formalized the QAOA components and the known parts of the problem, and reduced the conjecture to a single open mathematical statement. The model was then handed the library and our agentic toolkit, and tasked with closing that gap by constructing a proof in Lean. The resulting process is a feedback loop between the model's natural-language reasoning and Lean's mechanical verification, which converged to a machine-verified proof. Human verification is required only for the structural scaffolding - that the formal statement faithfully encodes the intended claim - while the proof itself is supplied by the model and certified mechanically by Lean. The proof is nevertheless striking - the model uncovered a hidden dynamical symmetry of the problem and exploited it, borrowing tools and machinery from an adjacent field to turn a hard existence problem into an explicit construction. This work paves the way for resolving open conjectures in quantum information science and beyond.
Innovation
Methods, ideas, or system contributions that make the work stand out.
machine-verified proof
quantum optimization
QAOA
large language model
formal verification
🔎 Similar Papers
No similar papers found.
