Introduction to Quantum Computing
This Module is offered by TUM Department of Informatics.
This module handbook serves to describe contents, learning outcome, methods and examination type as well as linking to current dates for courses and module examination in the respective
IN2381 is a semester module
in English language
at Master’s level
which is offered irregular.
This Module is included in the following catalogues within the study programs in physics.
- Catalogue of non-physics elective courses
|Total workload||Contact hours||Credits (ECTS)|
- Introduction to quantum mechanics
- Bell inequality
- Quantum circuits and algorithms
- Quantum error-correction
- Physical realizations of quantum computers
After successful completion of this module, students are familiar with the fundamentals and the mathematical formalism of quantum computing. They can analyse quantum algorithms, like the quantum Fourier transform, and construct quantum circuits for simple algorithms. The students can apply software tools (like Qiskit or Cirq), and can evaluate possible fields of applications of (future) quantum computers.
Linear Algebra, e.g., MA0901 Linear Algebra for Informatics
Courses and Schedule
Learning and Teaching Methods
The whiteboard lectures convey the fundamentals and the mathematical formalism of quantum computing in-depth, and the slide presentations illustrate state-of-the art technical developments. The accompanying exercises for individual study deepen the understanding of the topics explained in the lecture, and foster the creative application of the learnt techniques.
whiteboard, slides, online programming
M. A. Nielsen, I. L. Chuang: Quantum Computation and Quantum Information. Cambridge University Press (2010)
J. Preskill: Quantum Computing in the NISQ era and beyond. Quantum 2, 79 (2018)
Description of exams and course work
The assessment is by means of a written exam of 90 minutes. Problems related to the fundamental mathematical formalism may ask the students to compute the quantum mechanical state vector after passing through an experimental setup, or the derivation of a mathematical relation. Problems on quantum circuits test to what degree students have understood the individual building blocks (e.g., Pauli matrices or Hadamard gates), and can use these for the design of (simple) circuits. The exam assesses the knowledge of quantum algorithms for example by asking the students to analyze the number of required operations. Reaching 50% of the maximum number of homework points can be rewarded by a grade bonus of 0.3 in the evaluation of the exam. The exact details are timely announced at the beginning of the lecture.
The exam may be repeated at the end of the semester.