Lec 1
Welcome to Quantum Algorithms DeCal
Course: CS 198
·
Term: Fall 2026
·
Units: 2 (P/NP)
Instructors: Kepha Sher, Ian Loam, Jason Dong, Bruno Leopoldo, Morris Hsu
Lecture: Mondays and Wednesdays, 6–7pm @ ETCH 3111 · Office Hours: TBD @ Campbell 101
Email: kephasher, ianloam, jasondong1, morris.c.hsu, brunoleopoldo @berkeley.edu
Instructors: Kepha Sher, Ian Loam, Jason Dong, Bruno Leopoldo, Morris Hsu
Lecture: Mondays and Wednesdays, 6–7pm @ ETCH 3111 · Office Hours: TBD @ Campbell 101
Email: kephasher, ianloam, jasondong1, morris.c.hsu, brunoleopoldo @berkeley.edu
The purpose of this course is to survey the development of quantum algorithms, from Shor's original breakthrough to more recent approaches. Emphasis is placed on hands-on experience, including implementation using Qiskit (AER). Students will learn about extensions on classic results, gaining a modern perspective on original algorithms. Special topics lectures inspire students to explore their own interests, with a final capstone project to demonstrate their achievement.
Prerequisites: Linear Algebra (Math 54, Physics 89 or equivalent) and Python programming experience (e.g., CS 61A or equivalent). Knowledge of Physics 191A, or concurrent enrollment, is strongly preferred. No instructor permission required.
Unit 1 — Introductory Material
Week 1
Lec 2
Lecture
Qiskit and Quantum Circuits
Week 2
Lec 3
Lec 4
Week 3
Lec 5
Lec 6
Week 4
Lec 7
Lec 8
Week 5
Lec 9
Lec 10
Week 6
Lec 11
Lecture
Variational Approaches (1)
Lec 12
Lecture
Variational Approaches (2)
Week 7
Lec 13
Lec 14
Week 8
Lec 15
Lec 16
Week 9
Lec 17
Lec 18
Week 10
Lec 19
Lec 20
Week 11
Lec 21
Lec 22
Week 12
Lec 23
Special Topic
Special Topic (TBD)
Lec 24
Special Topic
Special Topic (TBD)
Week 13
Lec 25
Workshop
Final Project Workshop
Lec 26
Workshop
Final Project Workshop
Finals
TBD
Project
Final Project Presentations
Policies
This course is graded on a P/NP basis. Regular attendance, participation, and completion of assignments is required for a Pass grade. A final project must be completed in order to pass.
Grading: Attendance 20% · Final Project 80%
Attendance: Students have 2 unexcused absences. Excused absences are allowed, but students will need to email the instructors in advance, and after lecture slides are posted. Lectures will not be recorded.
Homeworks: Optional. Lab notebooks will be provided for you to implement in Qiskit.
Final Project: A capstone project on a topic of your choice. The point of a project is for you to explore an algorithm not discussed in class (or an extension of what we talked about), and present it to the class. Implementation of your algorithm of choice is required. Submitting a final project is required to pass the course.
Resources
Primary Books & Readings (Required):
Students are required to read the corresponding sections for each lecture from these texts:
- Ronald de Wolf — Quantum Computing: Lecture Notes (de Wolf)
- Lin Lin — Quantum Algorithms for Scientific Computation (Lin)
- Andrew Childs — Lecture Notes on Quantum Algorithms (Childs)
Supplemental Materials:
Students are encouraged to learn more by exploring the following materials:
- Nielsen & Chuang — Quantum Computing and Quantum Information (Cambridge University Press, 2010)
- Kitaev, Shen, & Vyalyi — Classical and Quantum Computation (American Mathematical Society, 2002)
- Quantum Algorithm Zoo
- Qiskit Textbook
- QC@B Website & Past Project Examples
Staff
Kepha Sher · Ian Loam · Jason Dong · Bruno Leopoldo · Morris Hsu