Introduction to quantum computation
Weekly outline
-
Introductory course on quantum computation and basic algorithms. Subjects: classical circuit model, irreversibility and reversibility, principles of quantum mechanics (axiomatic approach) and Deutsch model of quantum circuits. Deutsch-Josza algorithm, hidden subgroup and Simon algorithm, factorization and Shor's algorithm, Grover data base search. Possibly distributed protocols and/or HLL. Error correcting codes: Calderbank-Steane-Shor, stabiliser formalism. We will also use NISQ machines in exercises and/or projects.
Teachers: ruediger.urbanke#epfl.ch olivier.leveque#epfl.ch
Assistants: perrine.vantalon#epfl.ch anand.george#epfl.ch
Student assistants: thomas.brunet#epfl.ch giovanni.ranieri#epfl.ch
Schedule:
- Lectures on Wednesdays, 8h15-11h, in room ELA2 (please note that the third hour can be dedicated to lectures and/or exercises, depending on advancement and subjects)
- Exercises sessions, 11h-12h, in room ELA2
Lecture notes (in french): chapters taught this semester are chapters 3, 9, 10, 11, 12, 13, 14. (the rest corresponds to Introduction in Quantum Information Processing).
Reference book: Nielsen and Chuang, Quantum Computation and Quantum Information, Cambridge university Press, 2010
Videos (both in French - Spring 2021, and in English - Spring 2023)
Exam and grading: midterm 15% + mini-project 15% + final written exam 70%
For the exams: one A4 page recto-verso with a personal summary of the course is allowed. Apart from that, these are closed book exams. No electronic device allowed.
Final exam date: Tuesday, June 24, 9h15-12h15, rooms CO2, CO3
-
Introduction, classical circuits, Dirac's notation
Chapters 9.1, 9.2, 3.1 in notes
-
Quantum principles and elementary quantum gates
Chapter 3 in notes
-
Deutsch's model of a quantum circuit and Deutsch-Josza's algorithm
Chapter 9.4-9.6 in notes
-
Simon's algorithm, part I
Chapter 10 in notes (until the measurement process)
-
Simon's algorithm, part II
Chapter 10 in notes (recap of the algorithm, measurement process)
-
Shor's algorithm, part I
Chapter 11.1, 11.2 in notes
-
Shor's algorithm, part IIChapter 11 in notes
-
Shor's algorithm, part IIIChapter 11 in notes
-
edited on Tuesday, April 8
-
Midterm from 8:15 AM until 11:15 AM in room AAC 231 (and possibly AAC 020).
The course material covered by this midterm is possibly everything until week 8 of the course.
Allowed material: no electronic device, but two A4 single-sided cheat sheets (handwritten, or prepared with ipad+stylet).
-
Easter break: holiday
-
Grover's algorithm, part I
Chapter 12 in notes
-
Solution 9 File
-
Grover's algorithm, part II
Chapter 12 in notes
Phase estimation algorithm -> mini-project (start date: May 7 - end date: May 28)
-
Error correction, part I
Chapter 14 in notes
-
Solution 11 File
-
Error correction, part II
Chapter 14 in notes
-
Solution 12 File
-
Error correction, part III
Chapter 14 in notes
(no homework this week)
-
Communication complexity and distributed Deutsch-Josza's algorithm
Chapter 13 in notes
