QAOA (Quantum Approximate Optimization) | MaxCut & Combinatorics
Quick Technical Answer:
The Quantum Approximate Optimization Algorithm (QAOA) solves combinatorial optimization problems like MaxCut by alternating between a problem-cost Hamiltonian H_C(γ) and a transverse mixer Hamiltonian H_M(β) to converge toward optimal bitstrings.
Formula / Unitary:
|\gamma, \beta\rangle = \prod_{l=1}^p e^{-i \beta_l H_M} e^{-i \gamma_l H_C} |+\rangle^{\otimes n}
Simulate this in Itachi Quantum Studio
Inspect state amplitudes, 3D Bloch sphere vector, and OpenQASM code live.
Frequently Asked Questions
What is the relationship between QAOA and Quantum Annealing?
QAOA is a digitized, trotterized approximation of adiabatic quantum computation executed on universal gate-based quantum computers.