This course is mainly intended for graduate students in CS, C&O or Physics. Other students may take this course with the permission of the instructor. Prerequisites are MATH 235 or equivalent (e.g. PHYS 364 & 365); STAT 230 or equivalent.
Topics to be covered (syllabus [pdf]):
- Introduction to the quantum information framework
- Quantum algorithms (including Shor’s factoring algorithm and Grover’s search algorithm)
- Computational complexity theory
- Density matrices and quantum operations on them
- Distance measures between quantum states
- Entropy and noiseless coding
- Error-correcting codes and fault-tolerance
- Non-locality
- Cryptography
Evaluation
5 assignments 12% each
1 project 40%