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 itammar.steinberg#epfl.ch
Student assistants: giovanni.ranieri#epfl.ch
Schedule:
- Lectures on Wednesdays, 9h15-12h, in room GR B3 30
- Exercises sessions, 12h-13h, in room GR B3 30
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%
Final exam date: TBA
