Table of Contents
Quantum information and applications (24h, 3ECTS)Person in charge: Sophie Laplante (Université Paris Cité, IRIF) Teachers for 2022-23
Presentation and objectivesEach year computing machines become faster and faster, but they use still use at their base the same Newtonian physics. Feynman in 1982 already asked about the necessity of this restriction to classical physics. The idea behind quantum computation is to use quantum phenomena to solve tasks that conventional machines cannot achieve. Historically the first result that showed the superiority of the quantum model was in cryptography. Bennett and Brassard in 1984 gave a first quantum protocol for perfectly secure key distribution. Such an unconditional security does not exist in the classical world. At present many important concepts of theoretical computer science have been extended to quantum computation, from communication to algorithms and error correcting codes. The aim of this course is to present the bases of several concepts about quantum computation. The emphasis will be on quantum algorithms and communication. We will describe the basics of Quantum Computation and its applications in algorithms, communication complexity and nonlocality. PrerequisitesAlgorithms, basic notions in computational complexity, basic notions in linear algebra and probability. OrganisationLecturesLectures take place Tuesdays 8:45, room 1004. Unless specified otherwise lectures are in the 3-hour format. Lectures will take place in French, English upon request. (In the past all lectures have been in English.) References in brackets refer to Ronald de Wolf's (RdW) and John Watrous' (JW) lecture notes. Basic notions (order and contents subjects to change)
Algorithms and complexity (contents subjects to change)
QuanTech SeminarsThis course is also part of the Quantum technologies Graduate School of Université Paris Cité. As a consequence, a joint QuanTech seminar is offered to MPRI students by IRIF and MPQ, which you are welcome to attend. They take place in room 454A of building Condorcet, on Fridays, 12h-13h, starting October 14th (3 in October, 1 in December):
HomeworkHere is the homework to do during the break period (Oct 25 and Nov 1):
Final examThe final exam will take place on Nov 22, 9:00-11:30. Handwritten and printed lecture notes (your own, Ronald de Wolf, or others) are allowed for the exam. Please make sure to have your student ID with you for the exam. Sample exams:
References and Lecture NotesWe recommend the following lecture notes to use alongside the lectures: - Ronald de Wolf Quantum Computing lecture notes - John Watrous Quantum Computation Lecture notes - John Preskill Lecture notes for PH219/CS219 mainly for information theory (10.1, 10.2.1) and Holevo's bound (10.6.2) - Qiskit (open-source SDK) Textbook mixing quantum computation explanations and source codes The following textbooks are also suggested. - Quantum Computer Science: An Introduction. N. David Mermin. Cambridge University Press, 2007. - Quantum Computation and Quantum Information. M. Nielsen et I. Chuang. Cambridge University Press, 2000. Related CoursesThis course is a prerequisite for the course Quantum information and cryptography which covers advanced algorithms, quantum cryptography and post-quantum cryptography. The following courses are strongly recommended.
If you are interested in Algorithms and Complexity, we recommend taking courses from the following list. 1st quarter courses
1st and 2nd quarter courses
If you are particularly interested in quantum computing you can also take courses from the Physics masters program Dispositifs quantiques |