1 · The essentials
The Quantum Approximate Optimization Algorithm, or QAOA, is a method for seeking low-energy arrangements with a quantum circuit. The main result concerns the Gaussian zero-field Sherrington–Kirkpatrick model, a mathematical model of interacting spins with random interactions. It says that QAOA can approach the model’s lowest possible energy per spin, averaged over the randomness. The order of the limits matters: first the number of spins grows without bound, and only afterward is the circuit allowed to become deeper. For any desired accuracy, a finite circuit depth and fixed settings suffice in that limiting sense. Those settings do not depend on the number of spins or on the particular random interactions. The main result has a Lean formalization, but the manuscript gives neither a bound on the needed depth nor an efficient way to choose the settings.
A picture to help (an imperfect image, not to be taken literally)
As an imperfect image, imagine choosing a fixed recipe for a mixing machine before seeing the ingredients in a particular batch. The result resembles a guarantee that, once batch size is taken to its unlimited-size limit, a sufficiently elaborate recipe can get the average outcome as close to the target as desired; it does not tell you how elaborate that recipe must be.
Why it matters
The main result settles the eventual Parisi-optimality conjecture of Basso, Farhi, Marwaha, Villalonga, and Zhou in its fixed-parameter thermodynamic formulation. It establishes a limiting capability of QAOA without requiring settings tailored to each random instance. The repository summary also reports leading-order optimal expected MaxCut values on large-degree random regular graphs, with graph size tending to infinity before degree.
2 · Going further
The precise setting is the Gaussian zero-field Sherrington–Kirkpatrick (SK) model, with QAOA using the standard cost Hamiltonian and transverse-field mixer. For every accuracy, there exist a finite circuit depth and deterministic angles, independent of system size and disorder, that attain that accuracy relative to the ground-state energy per spin in the limiting expected energy. The system-size limit is taken first; increasing depth then permits arbitrarily accurate approximation. This is the fixed-parameter thermodynamic formulation of the eventual Parisi-optimality conjecture identified in the main abstract.
The abstract states the conclusion and its quantifier structure, but does not describe the argument that establishes it. In particular, it supplies neither a quantitative depth estimate nor an efficient angle-selection procedure. Thus the stated result is an existence guarantee in an ordered limit, rather than a recipe with specified computational resources.
The companion manuscript addresses the zero-temperature Parisi functional for the pure, zero-field SK model, using the covariance normalization . It is shown in that manuscript that every admissible integrable minimizer has full relative Stieltjes support on : its support has no gaps at any overlap scale below one. This is a structural statement about the SK order parameter, alongside the main manuscript’s statement about QAOA. The supplied abstracts do not specify how this support result enters the QAOA argument.
Useful notions
- Energy per spin and lowest-energy arrangements
- Averages over random interactions
- Quantum circuits, depth, and adjustable angles
- Limits taken in a specified order
- Minimizers and the support of a measure
What was known before / what is new
Before
The main abstract identifies eventual Parisi-optimality as a conjecture of Basso, Farhi, Marwaha, Villalonga, and Zhou. The source does not describe earlier partial results or provide a broader history of the question.
New
The main result establishes that finite-depth QAOA with deterministic, instance-independent angles can attain any prescribed accuracy in the thermodynamic limiting expected SK energy per spin. The companion manuscript shows that every admissible integrable zero-temperature Parisi minimizer in its stated SK setting has gap-free support below overlap one. The repository summary additionally reports a leading-order expected MaxCut consequence for large-degree random regular graphs.
Limits and assumptions
The QAOA statement assumes the Gaussian zero-field SK model and the standard cost Hamiltonian and transverse-field mixer. Its accuracy guarantee concerns limiting expected energy, with system size tending to infinity before depth; it is not a stated finite-size or individual-instance guarantee. No quantitative bound on depth or efficient angle-selection procedure is supplied. The companion result assumes an admissible integrable minimizer for the pure, zero-field model with covariance normalization , and concerns support on , not the endpoint one. The main result has a Lean formalization, but the supplied source does not specify its detailed coverage or establish that the companion support result and MaxCut consequence are also formalized. The abstracts identify no further open conjecture.
Mini glossary
- QAOA —
- The Quantum Approximate Optimization Algorithm, whose circuit depth and angles are the adjustable choices in the main result.
- Ground-state energy per spin —
- The lowest possible energy expressed per spin.
- Thermodynamic-first limit —
- The order of limits in which system size tends to infinity before circuit depth increases.
- Disorder —
- The randomness in the SK model’s interactions.
- Full relative Stieltjes support —
- The support property that, in the companion result, means there are no gaps at any overlap scale in .
Keywords : QAOA · Sherrington–Kirkpatrick model · Thermodynamic-first limit
AI-generated explanation based on the manuscript. Unofficial. Refer to the manuscript for the authoritative version.
3 · Technical details and sources
Claim made in the manuscript (source text)
Proves that QAOA approaches the ground-state energy of the Gaussian zero-field Sherrington–Kirkpatrick model when system size tends to infinity before circuit depth. For every accuracy, finite depth and deterministic angles independent of size and disorder achieve the required limiting expected energy per spin. This also yields leading-order optimal expected MaxCut values on large-degree random regular graphs, with size tending to infinity before degree.
Verified by Lean: the Lean software checked the part of the reasoning described below, sometimes only part of the manuscript. This does not mean independent mathematicians have validated the result.
Manuscripts in this family
QAOA attains the SK ground-state energy in the thermodynamic-first limit
25/09/2026We prove that the Quantum Approximate Optimization Algorithm (QAOA) approaches the ground-state energy per spin of the Gaussian zero-field Sherrington–Kirkpatrick model when system size tends to infinity first and circuit depth then increases. For every accuracy, some finite depth and deterministic angles, independent of system size and disorder, achieve that accuracy in the limiting expected energy per spin using the standard cost Hamiltonian and transverse-field mixer. This proves the eventual Parisi-optimality conjecture of Basso, Farhi, Marwaha, Villalonga, and Zhou in its fixed-parameter thermodynamic formulation. We give no quantitative bound on the required depth or efficient angle-selection procedure.
Full support of the zero-temperature Sherrington-Kirkpatrick order parameter
27/09/2026We prove that every admissible integrable minimizer of the zero-temperature Parisi functional for the pure, zero-field Sherrington–Kirkpatrick model has full relative Stieltjes support on . Thus its support has no gaps at any overlap scale below one. We use the covariance normalization .