Description: Lecture, four hours; discussion, two hours; outside study, six hours. Requisite: course M238. Quantum algorithms including quantum machine learning, Hamiltonian simulation, and quantum walk; quantum complexity classes including bounded-error quantum polynomial time (BQP), Quantum Merlin Arthur (QMA), and quantum interactive polynomial time (QIP); quantum verification including instrumented simulation and quantum abstract interpretation; high-level quantum languages including Silq; and big theorems in quantum computing including Gottesman-Knill and Solovay-Kitaev. Students do a variety of projects. Letter grading.

Units: 4.0