Introduction to quantum computing

This course offers a mathematics grounded introduction to quantum computing with minimal reliance on quantum physics. Adopting an axiomatic approach, we begin with a small set of physics-informed computational assumptions and develop the theory in a deductive manner. The emphasis is on algorithmic principles and the mathematical structures that underpin quantum computation. The overall goal is to prepare students for a reading class on quantum machine learning in the spring semester of 2026.

References:
G. Nannicini, An Introduction to Quantum Computing, without the Physics, SIAM Review, 62, No. 4, (2020) 936-981.
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.
J. M. Landsberg, A very brief introduction to quantum computing and quantum information theory for mathematicians, Quantum physics and geometry, 5–41, Lect. Notes Unione Mat. Ital., 25, Springer, Cham, 2019.
W. Scherer, Mathematics of Quantum Computing An Introduction, Springer, 2019.
J. Buchmann, Introduction to Quantum Algorithms, AMS, 2024.

3 hrs / week:

Thursdays 10.15-12.00 (room Simastuen 656 SB2)
Fridays 10.15-12.00 (room Simastuen 656 SB2)

Mandatory assignment: 1 project in groups of up to 4 students (submission deadline: November 30).

Exam: oral

Recommended background: Prior knowledge of linear algebra is helpful but not required.

To attend, please email kurusch.ebrahimi-fard @ ntnu.no and fride.straum @ ntnu.no, and register in Studentweb.

NB: We will have a meeting the week before the lectures start to give information about the course. This will be on Wednesday, 20. August at 09.00 in room Simastuen 656, SB2.

Date Content
Thursday, 28.08.25 (Fride) Introduction, complex numbers, vector spaces, bases, and matrices
Friday 29.08.25 (Fride) Matrices, norms, inner products, Dirac notation, and linear operators
Thursday 04.09.25 (Fride) First session: continue on linear operators, second session: work with exercises.
Friday 05.09.25 (Fride) First session: work with exercises, second session: work with exercises or I will go through the solutions on the blackboard.
Thursday, 11.09.25 (Kurusch) Basic group theory, part I
Friday 12.09.25 (Kurusch) Basic group theory, part II
Thursday, 18.09.25 (Kurusch) Boolean functions, classical gates, part I
Friday 19.09.25 (Kurusch) First session: Boolean functions, classical gates, part II, Second session: exercises
Thursday 25.09.25 (Fride) Kronecker product, bilinear functionals, dual spaces, and definition of tensor product.
Friday 26.09.25 (Fride) Tensor products: bases, universal property, inner product.
Thursday 02.10.25 (Fride) Entanglement, operators on tensor products.
Friday 03.10.25 (Fride)
Thursday 09.10.25 (Kurusch) Postponed
Friday 10.10.25 (Kurusch) Quantum gate computation: quibits, Bloch sphere
Thursday 16.10.25 (Kurusch) Axioms for quantum computation
Friday 17.10.25 (Kurusch) Gates & Quantum emulation of Boolean functions I
Thursday 23.10.25 (Kurusch) Quantum emulation of Boolean functions II
Friday 24.10.25 (Kurusch) Quantum measurement
Thursday 30.10.25 (Fride) Exercise 6 from sheet 4, controlled gates, and quantum circuits.
Friday 31.10.25 (Fride) Quantum Fourier transform
Thursday 06.11.25 (Fride) Phase estimation
Friday 07.11.25 (Fride) First session: Discuss projects with group 3 and 4 (other groups do not need to attend). Second session: Exercise session
Thursday 13.11.25 (Kurusch) Quantum algorithms: Deutsch
Friday 14.11.25 (Kurusch) Quantum algorithms: Deutsch-Jozsa and Bernstein–Vazirani
Thursday 20.11.25 (Kurusch) Quantum algorithms: Simon
Friday 21.11.25 (Kurusch) Self-study session on Grover’s search algorithm
Thursday 27.11.25 (Fride) Grover's algorithm
Friday 28.11.25 (Fride) Question session (held only if students confirm attendance via e-mail)
Monday, 15.12.25 Oral exam, part 1
Tuesday, 16.12.25 Oral exam, part 2
2025-12-02, Kurusch Ebrahimi-Fard