Quantum Approximate Optimization Algorithm is a proposed method of finding combinatorial optimization solutions that is somewhat speculated to hold a better approximation ratio than some classical approachs. The goal here is to show the algorithm off!
You will:
Make a wiki page explaining QAOA, giving its motivation as a thermalization reduction, and its proof
Give a visualization for how QAOA's steps transverses a search space (arbitrary search space example)
Make a tool which takes a Hamiltonian and generates its QAOA black boxes for the user
Quantum Approximate Optimization Algorithm is a proposed method of finding combinatorial optimization solutions that is somewhat speculated to hold a better approximation ratio than some classical approachs. The goal here is to show the algorithm off!
You will: