M1 QDCS - Introduction to Quantum Algorithms and Programming

Academic year 2025-2026


Summary

Beginner's course on quantum algorithms and programming given in the QDCS Master of Université Paris-Saclay. We aim at covering the following topics:

The lecturer is Benoit Valiron.

The final grade consists in 1/3 continuous examination (homeworks) and 2/3 final exam.

Material

What has been covered so far

Sep 12
  • All of Section 2 apart from hermitian matrices
  • Sections 3.1 to 3.6.
Sep 19
  • Lab session #1
  • Section 3.8 (measurement)
  • Sections 6.1.1 to 6.1.6 (Deutsch-Josza, study for the case n=1)
Sep 26
  • Lab session #2
  • Section 3.9 (discard, ancillas, computation-uncomputation)
  • We only schemes through Sections 4.1, 4.2, 4.3 (I only mentionned universality, gave an intuition on what is complexity for probabilistic algorithms and how it relates to quantum algorithms. You can still read the sections if you want of course!)
  • Section 5.1 (quantum algorithms in general)
  • Section 5.5 (QFT)
Oct 3
  • Section 5.6 (QPE) and Sections 6.2.1, 6.2.2 and 6.2.3 (first part of Shor's algorithm).
  • Coding session #1 (implementing QPE)
  • Homework #1 to hand over at the begining of next class, at 9am on Oct 10.