Contact information
Instructor: Professor Lin Lin
Lecture hours: TTh 3:30 pm - 4:59 pm, Evans 9 (Floor G)
Office Hours: T 2:30PM-3:30PM, Evans 817
Email: linlin@math.berkeley.edu
GSI: Jiasu Wang
GSI Office hours: W 2:30 pm - 3:59 pm, Evans 1097
Course catalog: https://classes.berkeley.edu/content/2024-spring-math-275-001-lec-001
Lecture hours: TTh 3:30 pm - 4:59 pm, Evans 9 (Floor G)
Office Hours: T 2:30PM-3:30PM, Evans 817
Email: linlin@math.berkeley.edu
GSI: Jiasu Wang
GSI Office hours: W 2:30 pm - 3:59 pm, Evans 1097
Course catalog: https://classes.berkeley.edu/content/2024-spring-math-275-001-lec-001
Course description
Quantum computers have the potential to revolutionize how we think about computing. Central to quantum computation are quantum algorithms, which often differ considerably from classical algorithms. This is an advanced graduate course course that introduces quantum algorithms essential for scientific computation. Topics include phase estimation, Hamiltonian simulation, block encoding, quantum singular value transformation, and their applications in tasks like solving linear systems, eigenvalue problems, and differential equations. The focus is on algorithmic components, design, and analysis. The quantum algorithms discussed are largely independent of the specific physical hardware on which they're implemented. Upon completing the course, students will have a solid understanding of the primary quantum algorithmic techniques for scientific computation and will be prepared to engage with technical discussions and design novel quantum algorithms in their research.
Prerequisites
Linear Algebra (MATH 54 / PHYSICS 89 / EECS 16A, or MATH 110)
Quantum mechanics (PHYSICS 7C or PHYSICS 137A or CHEM 120A) or quantum information theory (CHEM/CS/PHYS 191, or CS 294-66)
Before the first class: please read Chapter 1 (Preliminaries of quantum computation) 1.1-1.6 of the Notes. Ensure that you either have prior knowledge of the material or can comprehend it upon reading.
Enrollment Instructor consent is not needed. However, undergraduate students need to submit Sp24 Graduate Enrollment Request Form to be granted a permission. Additionally, please also fill this Google form https://forms.gle/7R8dUNwfMAU5bNtq9
Lecture notes:
https://math.berkeley.edu/~linlin/qasc/
Resources:
Prerequisites
Linear Algebra (MATH 54 / PHYSICS 89 / EECS 16A, or MATH 110)
Quantum mechanics (PHYSICS 7C or PHYSICS 137A or CHEM 120A) or quantum information theory (CHEM/CS/PHYS 191, or CS 294-66)
Before the first class: please read Chapter 1 (Preliminaries of quantum computation) 1.1-1.6 of the Notes. Ensure that you either have prior knowledge of the material or can comprehend it upon reading.
Enrollment Instructor consent is not needed. However, undergraduate students need to submit Sp24 Graduate Enrollment Request Form to be granted a permission. Additionally, please also fill this Google form https://forms.gle/7R8dUNwfMAU5bNtq9
Lecture notes:
https://math.berkeley.edu/~linlin/qasc/
Resources:
- A significant portion of the course materials are related to the IPAM Tutorial (Tuesday and Wednesday) in Fall 2023 (see presentations and slides)
- Another quantum course this semester on quantum coding theory by Professor John Wright:
- Andrew Childs, Lecture Notes on Quantum Algorithms
- John Preskill's Lecture notes
- Eleanor Rieffel and Wolfgang Polak, Quantum Computing: A Gentle Introduction, 2014 ISBN-13 : 978-0262526678
- Michael Nielsen, Issac Chuang, Quantum computation and quantum information, 10th anniversary edition, ISBN-13: 978-1107002173
- Quantum Algorithm Zoo. This should be viewed as a dictionary.
Schedule
Weekly schedule is given below, subject to
possible changes.
NOTE: due to QIP 2024, after departmental approval, the first class will start on 1/23 instead 1/16!
The make-up class will be held during the RRR week.
NOTE: due to QIP 2024, after departmental approval, the first class will start on 1/23 instead 1/16!
The make-up class will be held during the RRR week.
# | Date | Content | Comments |
---|---|---|---|
0 | Tue. 1/16 | QIP. No class. | |
0 | Thu. 1/18 | QIP. No class. | |
1 | Tue. 1/23 | Quantum advantage. Review of quantum mechanics and quantum circuit. | New notes Chap 1, Chap 2.2,2.3,2.5 |
2 | Thu. 1/25 | Deutsch-Jozsa and Bernstein-Vazirani. | Old notes Chap 1.6-1.8, 2.1. |
3 | Tue. 1/30 | Quantum versus classical computation | New notes Chap 3.1-3.3 |
4 | Thu. 2/1 | Quantum versus classical computation | New notes Chap 3.4-3.6 |
5 | Tue. 2/6 | Universal gateset and Solovay-Kitaev theorem | Childs Chap 2, 3. New Notes Chap 4 |
6 | Thu. 2/8 | Universal gateset and Solovay-Kitaev theorem | Childs Chap 2, 3. New Notes Chap 4 |
7 | Tue. 2/13 | Distance measure of quantum states | New Notes Chap 5.1-5.3 |
8 | Thu. 2/15 | Distance measure of quantum states | New Notes Chap 5.1-5.3 |
9 | Tue. 2/20 | Perturbation theory | New Notes Chap 5.4 |
10 | Thu. 2/22 | Statistical estimates | New Notes Chap 5.5 |
11 | Tue. 2/27 | Grover's search and amplitude amplification | New Notes Chap 7.1-7.2 |
12 | Thu. 3/1 | Block encoding | New Notes Chap 8.1 |
13 | Tue. 3/6 | Block encoding | New Notes Chap 8.2-8.3 |
14 | Thu. 3/8 | Qubitization | New Notes Chap 9.1-9.3 |
15 | Tue. 3/13 | LCU | New Notes Chap 9.4-9.7 |
16 | Thu. 3/15 | QSP | New Notes Chap 10.1, 10.7 |
17 | Tue. 3/20 | QSVT and applications | New Notes Chap 10.2-10.6. Chap 11 |
18 | Thu. 3/22 | Trotter | New Notes Chap 13.1-13.2 |
Evaluation
Throughout the semester, there will be three written homework assignments, accounting for
50% of the total score. There is no final exam.
There will be a final project, counting for the other 50% of the final grade. Please refer to this document for detailed requirements and evaluation policies.
There will be a final project, counting for the other 50% of the final grade. Please refer to this document for detailed requirements and evaluation policies.