printer friendly pageCS 259Q: Quantum Computing
The course introduces the basics of quantum algorithms, quantum computational complexity, quantum information theory, and quantum cryptography, including the models of quantum circuits and quantum Turing machines, Shor's factoring algorithms, Grover's search algorithm, the adiabatic algorithms, quantum error-correction, impossibility results for quantum algorithms, Bell's inequality, quantum information transmission, and quantum coin flipping. Prerequisites: knowledge of linear algebra, discrete probability and algorithms.
Terms: Win
| Units: 3
Instructors:
Bouland, A. (PI)
;
Giurgica-Tiron, T. (TA)
Filter Results: