Adiabatic computing and variational methods

Course guarantor:

Lecturer:

Tutor:

Supervisor:

Department of Computer Science

Synopsis:

Requirements:

Syllabus of lectures:

1.Background: MAXCUT

2.Background: SDP

3.Background: Goemans-Williamson Hyperplane Rounding

4.Variational quantum eigensolver (VQE)

5.Quantum Approximate Optimization Algorithm (QAOA)

6.Parameter shift rule (PSR)

7.Experimenting with iteration complexity of QAOA with PSR

8.Experimenting with depth of circuits in QAOA

9.Warm-starting quantum optimization: rounded

10.Warm-starting quantum optimization: continuous-valued

11.1:1 advice on individual projects.

12.1:1 advice on individual projects.

Syllabus of tutorials:

1.Background: MAXCUT

2.Background: SDP

3.Background: Goemans-Williamson Hyperplane Rounding

4.Variational quantum eigensolver (VQE)

5.Quantum Approximate Optimization Algorithm (QAOA)

6.Parameter shift rule (PSR)

7.Experimenting with iteration complexity of QAOA with PSR

8.Experimenting with depth of circuits in QAOA

9.Warm-starting quantum optimization: rounded

10.Warm-starting quantum optimization: continuous-valued

11.1:1 advice on individual projects.

12.1:1 advice on individual projects.

Study Objective:

Study materials:

Note:

Further information:

No time-table has been prepared for this course

The course is a part of the following study plans: