Quantum Algorithms for Combinatorial Optimization (SALMANH_U26EMP)

A wide range of problems in finance, science, and engineering involve solving a quadratic binary optimization problem. Such problems can be NP hard and so solutions cannot be obtained even using the best classical algorithms running on classical computers. In recent years, it has been demonstrated that such problems can be mapped onto a known physical system known as the Ising Hamiltonian [1].

When formulated in quantum mechanical terms a protocol can be used to steer the system towards the ground state of the target Hamiltonian that encodes the solution to the original problem. Currently several different quantum algorithms have been proposed that can be used for searching for the ground state of the Ising Hamiltonian. In this project, you will test a range of these quantum algorithms for some of the most well-known combinatorial optimization problems, including the N-Queens problem, and the MAX-CUT problem using IBM’s cloud-based interface QISKIT [2].

The project will allow you to develop key skills relevant to the rapidly emerging field of quantum computing. As a Master’s student you will use and develop numerical codes and perform detailed simulations. You should have a degree in physics, applied mathematics, computer science or equivalent and it is essential that you are comfortable working with computers and programming.

The standard minimum entry requirement is 2:2 in Physics, Physical Sciences, Natural Science, Mathematics, Computer Science.