Introduction to quantum computing
This course introduces quantum computing from a mathematical perspective. No prior knowledge of quantum physics is required: the theory is built from a small set of (physics-motivated) axioms, with a focus on algorithmic principles and the underlying mathematical structures.
Core topics include the quantum circuit model, quantum gates and reversible computation, tensor products and composite systems, entanglement and measurement, and an introduction to density matrices and mixed states.
The course also covers a selection of fundamental quantum algorithms, including Grover's search algorithm, Simon's algorithm, and Shor's factoring algorithm.
Advanced topics are drawn from two areas. In quantum error correction: stabiliser codes and basic fault-tolerance principles. In quantum circuits and complexity: quantum Fourier transform, phase estimation, and structural aspects of quantum circuit complexity.
The overall goal is to prepare students for a follow-up course on quantum machine learning in the spring semester of 2027.
References:
G. Nannicini,
An Introduction to Quantum Computing, without the Physics,
SIAM Review, 62, No. 4, (2020) 936-981.
J. Buchmann,
Introduction to Quantum Algorithms,
AMS, 2024.
S. Herbert,
Quantum Computing - Foundations and Practice,
Oxford University Press, 2025.
W. Scherer,
Mathematics of Quantum Computing - An Introduction,
Springer, 2019.
A. Al-Qasimi, D. F. V. James,
Quantum Information - A First Course,
Cambridge University Press, 2025.
P. Kaye, R. Laflamme, and M. Mosca,
An Introduction to Quantum Computing,
Oxford University Press, 2006.
M. A. Nielsen and I. Chuang,
Quantum Computation and Quantum Information,
Cambridge University Press, 2002.
Mandatory assignment: 1 project in groups of up to 3 students.
Exam: oral
Tuesday 10.00-11.30 (room 822 SB2)
Wednesday 08.00-09.30 (room 656 SB2)
| Date | Content |
|---|---|
| 26.08. | Introduction, complex numbers |
| 01.09. | Vector spaces, bases, and matrices, and norms |
| 02.09. | inner products, Dirac notation, linear operators, and Kronecker product |
| 08.09. | Bilinear functionals, dual spaces, and definition of tensor product |
| 09.09. | Tensor products: universal property, inner products, entanglement, operators on tensor products |
| 15.09. | Self-study |
| 16.09. | Self-study |
| 22.09. | Basic group theory I |
| 23.09. | Basic group theory II |
| 29.09. | Classical gates I |
| 30.09. | Classical gates II & exercises |
| 06.10. | Self-study |
| 07.10. | Self-study |
| 13.10. | Quantum gate computation: qubits, Bloch sphere |
| 14.10. | Axioms for quantum computation |
| 20.10. | Gates & Quantum emulation of Boolean functions I |
| 21.10. | Quantum emulation of Boolean functions II |
| 27.10. | Quantum measurement |
| 28.10. | Quantum Fourier transform |
| 03.11. | Phase estimation |
| 04.11. | Quantum algorithms: Deutsch |
| 10.11. | Quantum algorithms: Deutsch-Jozsa and Bernstein–Vazirani |
| 11.11. | Quantum algorithms: Simon |
| 17.11. | Quantum algorithms: Grover |
| 18.11. | Quantum algorithms: Shor |
| 24.11. | Quantum error correction I |
| 25.11. | Quantum error correction II |
| 14.12. | Oral exam, part 1 |
| 15.12. | Oral exam, part 2 |