← Back to article

Equation 5 · Variational Evolution: How Quantum Computers Learn Their Answers

What does this equation mean?

pp

Read the formula alongside the article passage below. Each part has a deeper page with its role in the equation, the supporting passage and nearby citations.

increased [ 2 ]. Read the equation part by part below; each part has a contextual explanation and a link to its mathematical background.

Read it piece by piece

pp

Symbol p

increased [ 2 ].

Understand this part →

How to interpret it

Read this expression with the definitions, units, and assumptions supplied by the article.

What the article says around this equation

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 full surrounding passage
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 that improves as the depth parameter p is increased [ 2 ] .

Read the equation in its article →

Sources cited in the surrounding passage

These citations give research context. Read each source to check which claims it supports.

Return to Variational Evolution: How Quantum Computers Learn Their Answers

Browse the mathematical compendium →