Quantum optimization algorithms: Difference between revisions

Revision as of 13:05, 18 January 2017

Revision as of 13:20, 18 January 2017

Line 74:

===Quantum Approximation Optimization Algorithm (QAOA)===

The heart of the algorithm relies on applyingthe use of[[unitary operators]] dependent on <math> 2p </math> angles, where <math> p>1 </math> in an input integer,. These operators are applied iteratively on the [[completely [[mixed state]], namely a state that is a [[superposition]] of all possible states with equal probability. In each iteration, the state is measured in the computational basis and <math> C(z) </math> is being calculated. After a sufficient amount of repetitions, the value of <math> C(z) </math> is almost optimal, and the state being measured is close to optimal as well.

== References ==