The Quantum Approximate Optimization Algorithm (QAOA) represents a leading framework for addressing combinatorial optimisation problems on near-term quantum devices. By alternating between a cost ...

Graph-theoretic problems of identifying maximum cliques and maximum independent sets occupy a central place in combinatorial optimisation and theoretical computer science. A clique is a set of ...

This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms find approximate (slightly suboptimal) solutions to optimization ...

Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...