| Date | Topic | Supplements | |
|---|---|---|---|
| Mon | Jan 5 | introduction | ugrad: Lecture 1 |
| Wed | Jan 7 | introduction; tensor products | ugrad: Lecture 2 |
| Mon | Jan 12 | Dirac notation, states and unitaries | ugrad: Lecture 6 |
| Wed | Jan 14 | quantum circuits and measurement | ugrad: Lecture 7 |
| Mon | Jan 19 | bra notation and unitaries | ugrad: Lecture 8 |
| Wed | Jan 21 | CHSH game and partial measurements | ugrad: Lectures 9-10, Nobel '22 |
| Mon | Jan 26 | Tsirelson's bound | notes, Vidick's blog |
| Wed | Jan 28 | Deutsch-Jozsa algorithm | ugrad: Lecture 13 |
| Mon | Feb 2 | quantum oracle instantiation | notes |
| Wed | Feb 4 | Simon's algorithm | notes, Simon's blog |
| Wed | Feb 4 | Homework 1 released (due Feb 20): Latex | |
| Mon | Feb 9 | Simon's randomized lower bound | grad: Lecture 9, de Wolf's notes (Sec. 3) |
| Wed | Feb 11 | Shor's algorithm (part 1) | ugrad: Lectures 16-17, Shor's video |
| Mon | Feb 16 | No class: midterm break | |
| Wed | Feb 18 | No class: midterm break | |
| Mon | Feb 23 | Shor's algorithm (part 2) | ugrad: Lecture 18 |
This is a graduate-level topics course in quantum computation but assumes no prior knowledge of quantum information. The main focus will be on quantum algorithms and introducing open research problems.
Tentative list of topics:
Prior knowledge of quantum information is not a prerequisite. The main prerequisites are linear algebra (e.g., MATH 223, MATH 307, or CPSC 302) and mathematical maturity (e.g., from taking a third-year math course). Some prior knowledge of probability, group theory, analysis of algorithms, discrete math, optimization, or quantum mechanics is helpful but could also be picked up during the course.
The primary reference for this course is a set of excellent lecture notes on quantum algorithms by Andrew M. Childs: [AMC].
|
|