CS-630 / 3 credits

Teacher: Soeken Mathias

Language: English


Every year


The course explains how to execute scalable algorithms on fault-tolerant quantum computers. It describes error correction used to build reliable logical operations from noisy physical operations, and how quantum programs are mapped into logical operations sets taking into account layout constraints.


1. Quantum computing stack, qubits, and quantum states
2. Quantum circuit model
3. Quantum error correction
4. Magic state distillation
5. Layout algorithms
6. Multi-controlled gates
7. Table lookup and state preparation
8. Quantum arithmetic
9. Unitary synthesis
10. Automatic oracle compilation
11. Quantum memory management


The course will be self-contained. Familiarity with quantum computation is not necessary although helpful.

By the end of the course, the student has a broad overview of the fault-tolerant quantum computing stack and can explain various transformations from one abstraction level to the other


quantum gates, quantum circuit model, quantum algorithms, physical constraints, compilation


Moodle Link

In the programs

  • Exam form: Project report (session free)
  • Subject examined: Fault-tolerant quantum computing
  • Lecture: 28 Hour(s)
  • Type: optional

Reference week

Related courses

Results from graphsearch.epfl.ch.