Universal resources for quantum approximate optimization algorithm and quantum annealing
quant-ph, cond-mat.stat-mech
Submitted: 2025-06-03
Updated: 2026-10-30
Comments: 12 pages, 9 Figures. Title updated to reflect journal version
Journal ref: Phys. Rev. Research 8, 013211 (2026)
DOI: 10.1103/hxv2-sbr7
License: http://creativecommons.org/licenses/by/4.0/
The gist: The Quantum Approximate Optimization Algorithm (QAOA) is a variational ansatz that resembles the Trotterized dynamics of a Quantum Annealing (QA) protocol.
Terminology
Abstract
The Quantum Approximate Optimization Algorithm (QAOA) is a variational ansatz that resembles the Trotterized dynamics of a Quantum Annealing (QA) protocol. This work formalizes this connection formally and empirically, showing the angles of a multilayer QAOA circuit converge to universal QA trajectories. Furthermore, the errors in both QAOA circuits and QA paths act as thermal excitations in pseudo-Boltzmann probability distributions whose temperature decreases with the invested resource -- i.e. integrated angles or total time -- and which in QAOA also contain a higher temperature arising from the Trotterization. This also means QAOA and QA are cooling protocols and simulators of partition functions whose target temperature can be tuned by rescaling the universal trajectory. The average cooling power of both methods exhibits favorable algebraic scalings with respect to the target temperature and problem size, whereby in QAOA the coldest temperature is inversely proportional to the number of layers, T about 1/p, and to the integrated angles -- or integrated interactions in QA.
Sources
- A Quantum Approximate Optimization Algorithm
- A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem
- Performance of Quantum Approximate Optimization with Quantum Error Detection
- Theoretical Approximation Ratios for Warm-Started QAOA on 3-Regular Max-Cut Instances at Depth $p=1$
- Quantum Approximate Optimization Algorithm in Finite Size and Large Depth and Equivalence to Quantum Annealing
- Effective temperature in approximate quantum many-body states
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements