CSE599D: Quantum Computing
Winter 2011
Instructor: Aram Harrow
Lectures: Monday, Wednesday 10:30-11:50 in CSE 503
Office hours: By appointment in CSE 596
Course outline:
This class will explore the idea that information can be quantum
mechanical, and the consequences of this idea for computation,
communication, cryptography and other information-processing tasks.
- Introduction: Postulates of quantum theory. Super-dense coding, teleportation and the no-cloning theorem.
- Algorithms: Unstructured search (Grover's algorithm), hidden symmetries (Deutsch-Jozsa and Simon's algorithm), and factoring (Shor's algorithm).
- Errors: quantum error-correcting codes, quantum cryptography, fault-tolerant quantum computing
- Information theory: noisy quantum states, purifications, von Neumann entropy, data compression and noisy quantum channels.
syllabus
Wiki for lecture notes
Homework
| Due | Topic
| Questions | Solutions
|
|---|
| 1 | Jan 19
| Gates and measurements | pdf
| pdf
|
| 2 | Feb 7 | Algorithms
| pdf
| pdf
|
| 3 | Feb 23 | Density matrices
| pdf
| pdf
|
| 4 | Mar 9 |
| pdf
| pdf
|