3A / M2 QMI - QComp - Quantum Programming and Compilation

Summary

This course is given both within M2 QMI and withing 3A CS. The course consists of the following.

• The co-processor model, programming and compiling quantum algorithm. Case studies: QFT and QPE.
• The HHL algorithm.
• Lab session: coding HHL with Qiskit.
• Compilation of Hamiltonian Simulation and Trotterization: presentation and discussion of the tradeoffs
• Lab session: implementation of Hamiltonian simulation
• Compilation of oracles: presentation and discussion of the tradeoffs

The lecturer is Benoit Valiron.

The teaching assistants are Benoît Valiron and Matthew Wilson.

The final grade consists in 100% continuous examination (homeworks, small tests in class and final project).

Material

• Link to the course notes [Link]

  They contain the union of all of the material I present in the various courses I give: we will not cover everything. There are probably many typos, feel free to report them to me so that I can update the document.

  Added on Sep 15

• Coding Session #1 [zip file]

  There is nothing to hand out here.

  It is only for practice.

  Added on Sep 28

• Solutions for Coding Session #1 [html file]

  What I did! With plots.

  Added on Oct 5

• Coding Session #2 [zip file]

  HHL: Half practice, half homework.

  To be handed over by next lecture (Oct 13)

  Added on Oct 5

Log of what happened

Sept 21, 2026

• Section 2 is assumed known
• Very fast review of Section 3: the quantum co-processor model as a memory model with measurement for readout and quantum circuits for internal operations
• Sections 5.5 and 5.6: QFT and QPE

Sept 28

• Coding session: QPE.
• Lecture: the HHL algorithm (Section 6.3).

Oct 6 (plan)

• Coding session: HHL.
• End of coding session: homework, to end in by the beginning of next lecture.
• Lecture: Trotterization (Section 5.7).