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 cmuquantum2018@gmail.com, and we'll add you to Diderot.

- Week 1, Sept. 4 -- Sept. 12
- Week 2, Sept. 13 -- Sept. 20
- Week 3, Sept. 20 -- Sept. 27
- Week 4, Sept. 27 -- Oct. 4
- Week 5, Oct. 4 -- Oct. 11
- Week 6, Oct. 11 -- Oct. 18

- Lecture 1: 10
^{500}Parallel Universes (pdf notes, video) - Lecture 2: Rotate, Compute, Rotate (pdf notes, video)
- Lecture 3: Understanding and Measuring One Qubit (pdf notes, video)
- Lecture 4: Unitary Transformations and the Elitzur--Vaidman Bomb (pdf notes, video)
- Lecture 4.5: Discriminating Two Qubits (pdf notes, video)
- Lecture 5: Multi-Qubit Systems (pdf notes, video)
- Lecture 5.5: Multiplying by a Global Phase Doesn't Matter (pdf notes, video)
- Lecture 6: Partial Measurements and "Spooky Action at a Distance" (pdf notes, video)
- Lecture 7: The CHSH Game (pdf notes, video)
- Lecture 8: The No-Cloning Theorem, and Quantum Teleportation (pdf notes, video)
- Lecture 9: Quantum Money (pdf notes, video)
- Lecture 10: Basics of Quantum Computing (pdf notes, video)
- Lecture 11: Revealing XOR-patterns I (pdf notes, video)

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
- Grover search algoritihm
- Shor's factoring algorithm
- The hidden subgroup problem
- Lower bounds for quantum query algorithms
- Quantum complexity theory
- Quantum probability, mixed states, POVMs, quantum channels
- 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
- Aaronson grad-level course
- Aaronson undergrad-level course
- Aaronson seminar course
- Ambainis course (hit the second button, labeled "Pieslēgties kā viesim")
- Bacon course
- Childs course
- Cleve course
- Harrow course
- van Melkebeek course
- Montanaro course
- Nielsen video lectures
- Preskill notes
- Razborov course
- Reichardt course
- Shor course
- Vazirani course 1
- Vazirani course 2
- Vazirani video lectures
- Vidick course
- Watrous courses
- Wolf course
- de Wolf course