Quantum Computation 2025-26

MEF - MSc in Physics Engineering

Dep. Informática, Universidade do Minho

Learning Outcomes

On successful completion of the course students should be able

Syllabus

Summaries (2025-26)

T Lectures
Sep 15 (17:00 - 19:00) Introduction to Quantum Computation and the course dynamics (slides).

Revisiting computability and computational complexity (notes).

Sep 22 (16:00 - 18:00) Computability and decidability. Turing machines. The Church-Turing thesis and its physical counterpart (notes).
Sep 29 (16:00 - 18:00) Introduction to quantum algorithms. The Deutsch algorithm (slides).
Oct 6 (16:00 - 18:00) The phase kick-back technique. Analysis of two algorithms: Deutsh-Joza and Bernstein-Vazirani (slides).
Oct 13 (16:00 - 18:00) Quantum approach to unstructured search problems. The Grover's algorithm (slides).
Oct 20 (16:00 - 18:00) Quantum fundamentals with pennylane: Superposition, interference, entanglement and universal gate sets. (notebook from class).
Oct 27 (16:00 - 18:00) Simon’s algorithm and its generalisations (slides). Complementary notes on group theory (notes)
TP Lectures
Sep 17 (09:00 - 11:00) Diagnostic exercise.
Sep 24 (09:00 - 11:00) Superposition and quantum interference (slides).

Revisiting computational complexity (notes).

Oct 1 (09:00 - 11:00) Exercises (on background notions): Hilbert spaces and quantum gates (exercises 1).
Oct 8 (09:00 - 11:00) Exercises (on quantum gates, and phase kick-back algorithms) (exercises 2).
Oct 15 (09:00 - 11:00) Quantum computing introduction with pennylane (slides) and (notebook from class).
Oct 22 (09:00 - 11:00) Deutsch algorithm (notebook from class).
Oct 29 (09:00 - 11:00) (to be re-scheduled)

Bibliography

Computability and Computational Complexity
Quantum Computation and Algorithms
Other (useful) readings
Links

Pragmatics

Lecturers
Assessment
Contact