COM SCI 238B
Quantum Algorithms
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
Units: 4.0
1 of 1
Most Helpful Review
Winter 2024 - This class dives deeper into some of the core topics of algorithm design, error correction, complex theorems such as Gottesman Knill, and more. A lot of the homework assignments are open-ended research questions and you need to put in effort to understand the problem at hand and be creative. The lectures are really engaging and help you think in the right direction. TA and professor office hours are super helpful too. But, if you struggled in CS 238, I would be cautious in taking this course. The difficulty is significantly higher.
Winter 2024 - This class dives deeper into some of the core topics of algorithm design, error correction, complex theorems such as Gottesman Knill, and more. A lot of the homework assignments are open-ended research questions and you need to put in effort to understand the problem at hand and be creative. The lectures are really engaging and help you think in the right direction. TA and professor office hours are super helpful too. But, if you struggled in CS 238, I would be cautious in taking this course. The difficulty is significantly higher.
1 of 1
