TOPICS
Search

Quantum Approximate Optimization Algorithm


The quantum approximate optimization algorithm (QAOA) is a variational quantum circuit that alternates a diagonal cost Hamiltonian and a mixing Hamiltonian. For n qubits, cost C, and transverse mixer B=sum_(i)X_i, where X_i is the first Pauli matrix at site i, a depth-p trial vector is

 |psi_p>=e^(-ibeta_pB)e^(-igamma_pC)...e^(-ibeta_1B)e^(-igamma_1C)|+>^( tensor n),

where |+>=(|0>+|1>)/sqrt(2) and the angles are real. The objective is the expectation of C in this trial state.


See also

Pauli Matrices, Quantum Circuit, Quantum Hamiltonian

Explore with Wolfram|Alpha

References

Farhi, E.; Goldstone, J.; and Gutmann, S. "A Quantum Approximate Optimization Algorithm." 14 Nov 2014. https://arxiv.org/abs/1411.4028.

Cite this as:

Weisstein, Eric W. "Quantum Approximate Optimization Algorithm." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/QuantumApproximateOptimizationAlgorithm.html

Subject classifications