Home > > CS 682: Quantum Computing

CS 682: Quantum Computing

CS 682: Quantum Computing

Course Contents:


Hilbert spaces (finite dimensional). Axioms of quantum probability. Quantum vs Classical probability.

Quantum Computing:

Turing machines, Boolean circuits, Quantum Circuits, Universality. Simon's problem, Phase finding, Shor's algorithm, Grovers algorithm, Probability amplification. Some applications.

Quantum Information processing:

Quantum error correction.Knill-Laflamme theorem, Stabiliser codes

Additional topics:

To be decided as the course progresses and if time permits.

Books and References:

Michael A. Nielsen and Isaac L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press