QAOA for Max-Cut
HardDerivationQAOAoptimizationcombinatorial
Related module: Variational and hybrid methods
Problem statement
The Quantum Approximate Optimization Algorithm (QAOA) encodes the Max-Cut problem for a graph with cost function:
where if vertices are in the same partition, if different.
- What is the QAOA circuit structure for depth ?
- For a triangle graph, what is the maximum cut and what state achieves it?
- Why does QAOA performance improve with depth ?
Hints
Learn the foundations
The Quantum Computing track covers this topic and more in depth.