15-859BB: Quantum Computation and Quantum Information 2018
Course bulletin board:Diderot
All course announcements, discussion, lecture notes, lecture videos, and homework will be on Diderot.
If you are not officially enrolled in the course but want to follow along, send email to [email protected], and we'll add you to Diderot.
Meetings time and place: Tuesday and Thursday, 1:30-2:50, GHC 4102 (entrance off The Helix) First meeting: Tuesday September 4. Last meeting: Thursday December 6. Instructor:Ryan O'Donnell TA: Costin Bădescu Office Hours: Ryan: Tuesdays 3pm-4:30pm (after class), GHC 7213. Costin: Mondays 3pm-4:30pm, location GHC 6207. 2015 version of the course
Course description
This course will be an introduction to quantum computation and quantum information theory, from the perspective of theoretical computer science. Topics to be covered will likely include:
Fundamental axioms of quantum mechanics
Fun with a few qubits: quantum Zeno and anti-Zeno, Elitzur--Vaidman bomb, entanglement, teleportation, no-cloning
Bell's inequality and the CHSH game
Fun with many qubits: quantum money, quantum key distribution
The quantum circuit model of computation; Fourier transform viewpoint
Basic quantum algorithms: Deutsch--Josza, Bernstein--Vazirani, Simon
Quantum tomography: Learning, testing, and discriminating quantum states
Elements of quantum information theory
Quantum error correction
Quantum supremacy
Prerequisites
A strong undergraduate background in linear algebra (e.g., CMU's 21-341), discrete probability (e.g., CMU's 15-359), and theory of computation (e.g., CMU's 15-251). No background in physics is required. We anticipate the course will be of interest to students working in computer science, mathematics, or physics.
Suggested texts, notes, and videos to look at
Mermin's book -- probably the textbook I like the best
Nielsen and Chuang textbook -- the canonical textbook; an oldie but a goodie; still possibly the most complete textbook
