Skip to main content
Seminar | Mathematics and Computer Science Division

Approaches to Quantum Constrained Combinatorial Optimization

MCS Seminar

Abstract: Quantum approximate optimization is a hybrid classical/quantum algorithm used for solving combinatorial optimization problems. We will discuss the application of this algorithm on constrained optimization problems and use the maximum independent set as an example. A dynamic variational extension of the algorithm will be introduced that allows us control over the quantum resources used. We will also discuss quantum local search and divide and conquer strategies that can be used with this algorithm.