Lec 1
Welcome to Quantum Algorithms DeCal
Course: CS 198-148
·
Units: 2 (P/NP)
Instructors: Ian Loam, Kepha Sher, Jason Dong, Bruno Leopoldo, Morris Hsu
Faculty Advisor: John Wright
Lecture: Two 1-hour lectures per week · Office Hours: Campbell 101
Email: ianloam, kephasher, jasondong1, morris.c.hsu, brunoleopoldo @berkeley.edu
Instructors: Ian Loam, Kepha Sher, Jason Dong, Bruno Leopoldo, Morris Hsu
Faculty Advisor: John Wright
Lecture: Two 1-hour lectures per week · Office Hours: Campbell 101
Email: ianloam, kephasher, jasondong1, morris.c.hsu, brunoleopoldo @berkeley.edu
This course surveys the development of quantum algorithms, from Shor's original breakthrough to modern approaches. Emphasis is placed on hands-on experience, including implementation using Qiskit (AER). A final project serves as the capstone.
Unit 1 — Introductory Material
Week 1
Lec 2
Week 2
Lec 3
Lec 4
Week 3
Unit 2 — Classic AlgorithmsWeek 4
Lec 7
Lec 8
Week 5
Week 6
Unit 3 — Hamiltonian SimulationWeek 7
Week 8
Week 9
Week 10
Lec 19
Lec 20
Week 11
Unit 4 — Special TopicsWeek 12
Lec 23
Special Topic
TBD
Lec 24
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 P/NP. Regular attendance, participation, and completion of the final project are required for a Pass. Students have 2 unexcused absences; additional absences require emailing the instructors in advance and after slides are posted. Lectures will not be recorded.
Grading: Attendance 20% · Final Project 80%
Homeworks: Optional. Lab notebooks are provided for Qiskit implementation practice.
Resources
- Nielsen & Chuang — Quantum Computing and Quantum Information (Cambridge, 2010)
- Kitaev, Shen & Vyalyi — Classical and Quantum Computation (AMS, 2002)
- Andrew Childs' Lecture Notes
- Faryad's Notes
- Quantum Algorithm Zoo
- Qiskit Textbook
Staff
Ian Loam · Kepha Sher · Jason Dong · Bruno Leopoldo · Morris Hsu
Faculty Advisor: John Wright