Quantum Computing – Theoretical Computer Science

Course Details

Lecturer: Uwe Egly

Frequency: WS 2025/26

Course Type: Lecture, lab and exercise (2V + 2L + 1Ü, 7 LP)

Examination: Oral exam
Course Contents
After successful completion of the course, students are able to illustrate, describe, and critically evaluate the fundamental and central concepts of quantum computing (including the associated complexity theory). Furthermore, they are able to prove the correctness of simple quantum algorithms and implement them using the quantum circuit model.

Outline:

Mathematical and quantum-mechanical foundations, quantum gates

Programming techniques and reverse computing

Basic quantum algorithms: Deutsch, Deutsch-Jozsa, Bernstein-Vazirani, quantum teleportation

Grover’s algorithm

Simon’s algorithm

Quantum Fourier transform, phase estimation, order finding

Shor’s algorithm

Hamiltonian simulation

HHL algorithm for solving systems of linear equations

Probabilistic complexity classes: BPP, PP

Boolean and quantum circuits

Extended Church-Turing thesis and its relevance

Complexity class BQP: robustness, examples, classification

Complexity class QMA ("quantum NP")

Quantum query complexity
Information about exam

The final examination of the module is an oral exam.

Schedule

The exam dates are assigned via an internal institute website (see link below). Note: This does not replace registration for the exam in QIS.

Registration

Depending on your examination regulations, registration in QIS may be required (see link below).

Coursework Requirement

If your examination regulations require coursework for this module, please contact the lecturer.

Materials

All materials can be found in Stud.IP.

To the Stud.IP

Exam registration

Online registration at the examination office

To the QIS

Schedule an appointment for the oral exam

To the THI Appointment Management