Quantum Approximate Optimization Algorithm (QAOA)

The quantum approximate optimization algorithm is a popular approximate quantum algorithm to solve combinatorial optimization problems. The general technique is to encode the optimization problem in two Hamiltonians, the cost Hamiltonian and the mixing Hamiltonian. With repeated application of these Hamiltonians upon a classically chosen initial state, the final state can be measured, resulting in an approximate optimal solution encoded in the resulting bitstring.