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.
Teacher: thomas.vidick#epfl.ch
Assistants: petia.arabadjieva#epfl.ch and itammar.steinberg#epfl.ch
Student assistants: giovanni.ranieri#epfl.ch and alexandra.golay#epfl.ch
Schedule:
- Lectures on Wednesdays, 9h15-12h, in room AAC 231
- Exercise sessions, 12h-13h, in room AAC 231
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).
Lecture notes (in english): typeset from this course in a previous year (may contain typos).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 3/12 + mini-project 2/12 + final written exam 7/12
Midterm date: April 15th, 9:15-12:15 AM
Final exam date: TBA
-
We gave a general introduction to quantum computing and to the course, did a review of relevant linear algebra and introduced the Dirac notation. This essentially corresponds to Sections 2.1, 2.2 and 2.3 in the lecture notes (the ones in English).
-
We discussed classical circuits (Chapter 1 of the notes), the axioms of quantum mechanics (Section 2.4), and started discussing quantum circuits (parts of Section 2.5).
-
We discussed the Deutsch-Josza algorithm (Chapter 3 of the lecture notes).
-
This week we cover Simon's algorithm. This corresponds to Chapter 4 of the lecture notes (in English). We cover a slightly simplified form of the algorithm. I updated the notes for this, and provide them as the file "Week4.pdf" here.
