Quantum optimisation lab

Quantum Optimization Lab

The Max-Cut problem, the Ising model, QAOA and annealing, with an interactive graph simulator and a comparison with classical solutions.

Loading the simulator…

Lessons

  1. 1Quantum OptimizationQuantum optimization comprises approaches such as QAOA and quantum annealing that encode a combinatorial optimization p…Intermediate
  2. 2Quantum Approximate Optimization Algorithm (QAOA)QAOA is a variational algorithm that applies p alternating layers e^-iγ H_C and e^-iβ B to the uniform superposition an…Advanced
  3. 3Ising ModelThe Ising model describes binary spins z_i=±1 with energy E(z)=Σ J_ijz_iz_j+Σ h_iz_i; its quantum version is a Hamilton…Intermediate
  4. 4Quantum AnnealingQuantum annealing is a physical, analog process in which a device Hamiltonian is slowly changed from a simple transvers…Advanced
  5. 5Maximum Cut (Max-Cut)Max-Cut asks for a partition of a graph's vertices into two sets that maximizes the total weight of edges between them;…Intermediate
  6. 6Optimization Problems and Their FormulationOptimization problems range from continuous to combinatorial and convex to non-convex; quantum approaches require casti…Intermediate

Related concepts, equations and questions

Experiments in this module

Module quiz

The quiz needs JavaScript.

All results in this lab come from an exact classical statevector simulation running in your browser, not from execution on a real quantum computer. The required memory doubles with every qubit ($2^n$ amplitudes), so the number of qubits is limited by default to 16.