Learning Outcomes
On successful completion of the course students should be able
-
To master the quantum computational model.
-
To design, analyse and implement quantum algorithms.
-
To understand basic concepts in error-correction.
Syllabus
- The quantum computational model.
- Quantum information and computation: basic concepts and principles.
- Error correction: principles and methods.
- Quantum algorithms
- Introduction to quantum algorithms.
- Algorithms based on phase amplification.
- Algorithms based on the quantum Fourier transform.
- Computational complexity analysis for quantum algorithms.
- Case studies in quantum algorithmics.
- Quantum programming in PennyLane.
Summaries (2026-27)
T Lectures
| Sep 14 (16:00 - 18:00) |
Introduction to Quantum Computation and the course dynamics
(slides).
Superposition and quantum interference
(slides). |
| Sep 21 (16:00 - 18:00) |
Introduction to quantum algorithms. The Deutsch algorithm
(slides).
|
| Sep 28 (16:00 - 18:00) |
The phase kick-back technique. Analysis of two algorithms: Deutsh-Joza and Bernstein-Vazirani
(slides). |
| Oct 12 (11:00 - 13:00) |
Crash course or quantum error correction (part 1)
(plan). |
| Oct 12 (16:00 - 18:00) |
Crash course or quantum error correction (part 2)
(slides 1 & 2). |
| Oct 19 (16:00 - 18:00) |
Quantum approach to unstructured search problems. The Grover's algorithm.
(slides). |
| Oct 26 (16:00 - 18:00) |
Simon’s algorithm and its generalisations
(slides).
A note on groups and cosets (notes). |
TP Lectures
| Sep 16 (09:00 - 11:00) |
Diagnostic exercise to clarify students background and expectations.
|
| Sep 23 (09:00 - 11:00) |
Exercises (background): Hilbert spaces and quantum gates
(exercises 1). |
| Sep 30 (09:00 - 11:00) |
Exercises (background): conclusion
(exercises 1). |
| Oct 07 (09:00 - 11:00) |
Exercises: Phase kick-back
(exercises 2). |
| Oct 14 (09:00 - 11:00) |
Crash course or quantum error correction (part 3)
(plan). |
| Oct 28 (09:00 - 11:00) |
Exercises: Amplitude amplification and Grover algorithm
(exercises 3). |
Bibliography
Computability and Computational Complexity
-
H. R. Lewis and C. H. Papadimitriou. Elements of the Theory of Computation. Prentice
Hall (2nd Ed), 1997.
-
S. Arora and B. Barak. Computational Complexity: A Modern Approach. Cambridge
University Press, 2009.
-
C. Moore and S. Mertens The nature of computation. Oxford
University Press, 2011.
Quantum Computation and Algorithms
-
M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information (10th
Anniversary Edition). Cambridge University Press, 2010
-
N. S. Yanofsky and M. A. Mannucci. Quantum Computing for Computer Scientists. Cambridge
University Press, 2008.
-
E. Rieffel and W. Polak. Quantum Computing: A Gentle Introduction. MIT Press, 2011.
-
A. M. Dalzell, S. Mcardle, et al. Quantum Algorithms. Cambridge
University Press, 2025.
-
W. Scherer. Mathematics of Quantum Computing. Springer, 2019.
Other (useful) readings
-
N. S. Yanofsky. The Outer Limits of Reason. MIT Press, 2013.
-
S. Aaronson. Quantum Computing since Democritus. Cambridge
University Press, 2013.
-
J. Preskill Quantum Computing in the NISQ era and beyond. Quantum 2, 79, 2018.
Links
Pragmatics
Lecturers
Assessment
-
Individual written test with restricted consultation (two A4 handwritten pages only) (70%)
Test: 4 January 2027
- Individual assignment
with written report and oral defense (30%). This component is not assessed through exam.
Oral: 11 January 2027
Contact