COM SCI 238B: Quantum Algorithms
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 unknown, graduate
- Predicted GPA
- 3.52
- A or A minus
- 63%
- D, F or withdrew
- 0%
- Sections
- Sections not published yet.
- By instructor
- Winter 2024 to Winter 2025
- All instructors
- 3.52 GPA
- 63% A
- 0% DFW
- 48 grades
- PALSBERG
- 3.55 GPA
- 63% A
- 0% DFW
- 48 grades
- Prerequisites
- Requisite: course M238.
- Restrictions
- Not read yet
- Grading
- Not read yet
- Final exam
- Final time not published
What past students say
Read from 1 review, all instructors
No professor is listed for this term yet, so these count the reviews of every professor who has taught it.
- Teaching
- 1 says clear
Each figure counts the reviews that say so. Most reviews skip most topics.