Course description: This course provides an introduction to quantum information and computation. After covering the basic mathematical tools of quantum information theory, we will cover topics in quantum computation such as: universal gate sets, Shor’s and Grover’s algorithms, noise in quantum computing, and quantum error-correction. We will also cover related topics in quantum Shannon theory, including: the concept of quantum entropy and entanglement measures; hypothesis testing; and the basic primitives of quantum communication, such as quantum teleportation and superdense coding.
Final presentation instructions
Lecture Notes
- Introduction — 26 Aug. 2025
- Quantum states — 28 Aug. 2025
- Entanglement — 9 Sept. 2025
- Measurements — 11 Sept. 2025
- 16 Sept. 2025 (Jamie Sikora substituting)
Teleportation
Superdense coding - 18 Sept. 2025 (Jamie Sikora substituting)
No-cloning theorem
The quantum Zeno effect and bomb-testing - Teleportation (part II) — 23 Sept. 2025
- Entanglement (part II); purification — 25 Sept. 2025
- Entanglement tests and measures — 30 Sept. 2025
- Quantum circuits — 2 Oct. 2025
- Quantum circuits (part II); Hadamard test — 7 Oct. 2025
- Universal gate sets — 14 Oct. 2025
- Universal gate sets (part II) — 16 Oct. 2025
- The Deutsch-Jozsa Algorithm — 21 Oct. 2025
- Quantum Fourier transform; phase estimation — 23 Oct. 2025
- Quantum phase estimation (part II) — 28 Oct. 2025
- Shor’s algorithm — 30 Oct. 2025
- Grover’s algorithm — 4 Nov. 2025
- Grover’s algorithm (part II); quantum state discrimination — 6 Nov. 2025
- Quantum complexity theory — 11 Nov. 2025
Assignments
Other resources
- CS 5134 (Spring 2023), taught by Jamie Sikora
- Lecture notes, John Watrous
- Lecture notes, Scott Aaronson
Sumeet Khatri 