Skip to content

Commit

Permalink
Add QAOA convention to README (#19)
Browse files Browse the repository at this point in the history
  • Loading branch information
ElePT authored Feb 22, 2024
1 parent 329a82e commit 211a41b
Showing 1 changed file with 32 additions and 0 deletions.
32 changes: 32 additions & 0 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -43,6 +43,38 @@ can be applied to best run quantum optimization algorithms on real hardware:
3. Application of SWAP strategies -> `swap_strategies`
4. QAOA cost function -> `cost_function`

## QAOA Formulation Convention

The convention in this repository is that the (depth-one) QAOA should create an Ansatz of the form:

$$
\begin{align}
\exp\left(-i\beta H_m\right)\exp\left(-i\gamma H_c\right)\vert+\rangle^{\otimes n}
\end{align}
$$

to **minimize** the energy of $H_c$. Since we are minimizing $\\langle H_c\\rangle$,
the initial state of the ansatz should be the ground state of the mixer $H_m$. This enforces:

$$
\\begin{align}
H_m=-\\sum_iX_i.
\\end{align}
$$

As cost operator we apply:

$$
\\begin{align}
H_c=\\sum_{i,j=0}^{n-1}w_{i,j}Z_iZ_j
\\end{align}
$$

where the sum runs over $i<j$.

At the circuit level, these definitions imply that the exponential of the mixer is built
with $R_x(-2\\beta)$ rotations and the exponential of the cost operator is built from $R_{zz}(2\\gamma w_{i,j})$.


## References
1. Sack, S. H., & Egger, D. J. (2023). Large-scale quantum approximate optimization on non-planar graphs with machine learning noise mitigation. arXiv preprint arXiv:2307.14427. [Link](https://arxiv.org/pdf/2307.14427.pdf).
Expand Down

0 comments on commit 211a41b

Please sign in to comment.