Published equation contexts
Why this formula appears here
The same architecture, aimed at combinatorial optimization rather than chemistry, produced the quantum approximate optimization algorithm (QAOA) later that same year. Edward Farhi, Jeffrey Goldstone, and Sam Gutmann proposed a circuit built from alternating problem and mixing unitaries, controlled by a small number of classical parameters, whose measured output approximates the solution to a combinatorial problem such as MaxCut [ 2 ] . For MaxCut on 3-regular graphs at the shallowest depth ( p=1 ), they proved the algorithm returns a cut at least 0.6924 times the size of the true optimum — a specific, checkable guarantee rather than a promise of “quantum speedup” in the abstract, and one…
Read the representative guide
How to interpret it
Read it with the definitions, units, and assumptions supplied by the article.
Research cited beside this formula
Published contexts (1)
A symbol can carry a different meaning in another article. Each occurrence keeps its own guide and term definitions.
Equation 4 · Evolutionary Physics
Variational Evolution: How Quantum Computers Learn Their Answers
This equation states an equality: the expressions on both sides have the same value under the article’s assumptions.
The same architecture, aimed at combinatorial optimization rather than chemistry, produced the quantum approximate optimization algorithm (QAOA) later that same year. Edward Farhi, Jeffrey Goldstone, and Sam Gutmann proposed a circuit built from alternating problem and mixing unitaries, controlled by a small number of classical parameters, whose measured output approximates the solution to a combinatorial problem such as MaxCut [ 2 ] . For MaxCut on 3-regular graphs at the shallowest depth ( p=1 ), they proved the algorithm returns a cut at least 0.6924 times the size of the true optimum — a specific, checkable guarantee rather than a promise of “quantum speedup” in the abstract, and one…