Quantum Algorithms

(An English-language class)

Lectures and tutorials (6 SWS/9 ECTS)

This master's course provides an introduction to the design and analysis of quantum algorithms, i.e., algorithms that run on realistic models of quantum computers. Theoretically, quantum computers can solve certain problems faster than conventional computers. We focus on algorithms for solving computationally hard problems linked to optimization.

The course consists of three parts: one weekly lecture (2 SWS), one weekly tutorial (2 SWS), and paper readings (2 SWS). To receive the credits for this course you must complete both the homework assignments (with an appropriate score) and all of the reading assignments. There will be an exam at the end of the course.

Knowledge equivalent to an introductory course to theoretical computer science and to analysis and linear algebra is required for this class.


Lectures Thursday, 10:00-11:30, L 601 (Sven Kosub)
Tutorials: Monday, 17:00-18:30, P 712 (Tobias . 2 . Toepfer @ uni.kn)
Oral/written exam: Thursday, July 18, 2024 (planned)

Homework Assignments

Assignments are made available in ILIAS every Friday. The editing time for each homework is about one week. It is due on the next Friday at 12:00 via Upload in ILIAS. The assignments have to be delivered in written form in English. The corrected and scored assignments will be returned and discussed in the next tutorial.

You are allowed and encouraged to work in groups of two.

Paper Readings

Relevant research papers must be read in parallel to the lectures and tutorials. Every three weeks a new paper is issued (in ILIAS) and in the last week of the reading period assignments on the content of the paper must be completed and submitted via Upload to ILIAS. The submission deadlines will be announced in ILIAS.

You are allowed and encouraged to work in groups of two.


The following topics are planned:

  • Principles of quantum algorithms
  • Quantum algorithms for unordered search
  • Quantum algorithms for graph problems
  • Quantum approximate optimization algorithms
  • Quantum complexity classes

Lecture Notes

Lecture notes are made available in ILIAS close in time to the lectures. In case you have suggestions or comments (typos or any kind of errors) please send an email.