COM SCI 238B: Quantum Algorithms
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.
4 units, lecture, discussion
Loading...
| JENS PALSBERG | Winter 2026 | 27 | 55.6% (15) |
|---|
A-range % and grade counts cover only each instructor’s latest recorded term, shown in the "Latest Data From" column, combining all sections for the course. A-range % is the share of recorded letter grades (A+ through F) that are A+, A, or A−. Parentheses show the A-range count over the total letter-grade count. P/NP and incompletes are excluded. Records may be incomplete.
- Available Academic Terms
- Winter 2024 · Winter 2025 · Winter 2026