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: anastasia.remizova@epfl.ch zijing.di#epfl.ch
Student assistants: victor.braun#epfl.ch thomas.brunet#epfl.ch giovanni.ranieri#epfl.ch
Schedule:
- Lectures on Wednesdays, 8h15-11h, in room ELA2
- Exercises sessions, 11h-12h, in room ELA2
The third hour can be dedicated to lectures and/or exercises, depending on advancement and subjects.
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: 4 graded homeworks 20% + one mini-project 10% + final written exam 70%
For the final exam: one A4 page recto-verso with a personal summary of the course is allowed. Apart from that it is a closed book exam. No electronic device allowed.
Exam time and place: Monday, July 1, 9h15-12h15, room SG 1 -
Introduction, classical circuits, Dirac's notation
Chapters 10.1, 10.2, 3.1 in notes
-
Quantum principles (axiomatic approach) and elementary quantum gates
Chapter 3 in notes
-
Quantum computation (circuit) model of Deutsch and Deutsch-Josza's algorithm
Chapter 10 in notes
-
Communication complexity and distributed Deutsch-Josza's algorithm
Chapter 13 in notes
-
Hidden sub-group problem and Simon's algorithm I
Chapter 11 in notes (until the measurement process)
-
Hiden sub-group problem and Simon's algorithm II
Chapter 11 continuation (recap of the algorithm, and measurement process)
-
Easter break: holiday
-
Shor's algorithm, part I
Chapter 12.1, 12.2 in notes
-
Shor's algorithm, part IIChapter 12 in notes
-
Shor's algorithm, part IIIChapter 12 in notes
-
End of Shor's algorithm and Grover's algorithm, part I
Chapter 13 in notes
-
Grover's algorithm, part II
Chapter 13 in notes
Mini-project (start date: May 8 - end date: May 29)
-
Error correction, part I
Chapter 9 in notes
-
Error correction, part II
Chapter 9 in notes
-
Error correction, part III
(no homework this week)
