MATH162 CM - Quantum Computation

An introduction to quantum computing, beginning with a discussion about differences between classical and quantum computation systems. Topics include quantum circuits, dense coding and quantum teleportation, quantum parallelism, quantum key distribution protocols. Examples of efficient quantum algorithms include the Deutsch-Josza algorithm, Grover’s search algorithm, and others as time permits.

Prerequsites: Linear Algebra (MATH 060 CM or MATH 060C CM) and a proof-based course (MATH 055 CM or similar).

Offered: Every other year

Credit: 1

Course Number: MATH162 CM