COM SCI 238B
Quantum Algorithms
Computer Science · 4 units · Graduate courses (200-299)
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.
Requisites
Official UCLA wording
Requisite: course M238.
BruinTree reads · Prerequisite
needs reviewconfidence 0.90 · from UCLA’s structured data- · "COM SCI M238" is not in this catalog version
Requires
Everything that has to come before this course, not just the courses named in the requisite above.
Nothing — this is an entry point.
Unlocks
What this course is a requisite for, and what those courses lead to in turn.
No course in the catalog lists this as a requisite.