QAOA — Quantum Approximate Optimization
MaxCut on a small graph via alternating cost/mixer unitaries
QAOA PARAMETERS (p=1)
γ
0.40
β
0.30
Optimize γ,β
Reset
EXPECTED MAXCUT VALUE ⟨C⟩
---
CLASSICAL OPTIMUM
---
QAOA circuit: |+⟩^n → e^{-iγC} → e^{-iβB} → measure
C = Σ_{(i,j)∈E} (1-ZᵢZⱼ)/2 (cut edges)
B = Σᵢ Xᵢ (mixer)
GRAPH (5 nodes, MaxCut problem)
MEASUREMENT PROBABILITIES (all 2⁵=32 bitstrings)