There are also very notable circuit-model algorithms that optimize
PUBO instances. The quantum approximate optimization
algorithm (QAOA) [1]} is a variational algorithm that
begins with a uniformly distributed quantum state and gradually
evolves the state into one which, when measured, yields an approximate
solution to the original PUBO. In certain respects, QAOA is a natural
choice for our workflow once hardware evolves to the scale where
around 1000 useful qubits, either error-corrected or sufficiently low-noise, can be manipulated in a circuit-model quantum
computer. In lieu of this, the tests performed in section  exclusively use annealing algorithms which we now
briefly review.
