Italicized entries are tentative.
Date | Topic | Supplements | |
---|---|---|---|
Wed | Sept 4 | intro to quantum computing: notes | |
Mon | Sept 9 | intro to quantum computing: notes | |
Wed | Sept 11 | CHSH game, Dirac notation, measurement | end of lecture 2 |
Fri | Sept 13 | Homework 1 released (due Sept 27): pdf, Latex | |
Mon | Sept 16 | add/drop deadline | |
Mon | Sept 16 | CHSH game: quantum analysis: notes | O'Donnell video, article |
Wed | Sept 18 | CHSH game: Tsirelson's inequality | Wilde notes (see 2.0.3) |
Mon | Sept 23 | intro to query complexity | lecture 1 |
Wed | Sept 25 | intro to query complexity: notes | Ambainis survey |
Fri | Sept 27 | Candidate project topics released: pdf, Latex (see Project section below) | |
Mon | Sept 30 | No class: National Day for Truth and Reconciliation | |
Wed | Oct 2 | Grover's algorithm | lecture 3, original paper |
Mon | Oct 7 | Grover's algorithm, randomized query lower bound | lectures 2 and 3 |
Wed | Oct 9 | simulating randomized query algorithms: notes | |
Fri | Oct 11 | Homework 2 released (due Oct 28): pdf, Latex | |
Mon | Oct 14 | No class: Thanksgiving Day | |
Wed | Oct 16 | principle of deferred measurement, ORn, the Turing model | lecture 4 |
Mon | Oct 21 | simulating classical algorithms/oracle instantiation: notes | Watrous video (see >45:37) |
Wed | Oct 23 | quantum time complexity of kSAT: notes | |
Mon | Oct 28 | Simon's problem (1): notes | Simon's blog post |
Wed | Oct 30 | Simon's problem (2): notes | |
Mon | Nov 4 | Simon's problem (3): randomized query lower bound | lecture 9 |
Wed | Nov 6 | period finding in Z | lecture 10-11 |
Mon | Nov 11 | No class: midterm break / Remembrance Day | |
Mon | Nov 11 | Homework 3 released (due Nov 25): pdf, Latex | |
Wed | Nov 13 | No class: midterm break | |
Mon | Nov 18 | Shor's algorithm (1) | lecture 12, [NC, Sec. 5.1] |
Wed | Nov 20 | Shor's algorithm (2) | lectures 10-11 and 12, Shor's story |
Mon | Nov 25 | adversary method | ch. 22.2 of [AMC] |
Wed | Nov 27 | intro to quantum error correction | [NC, Sec. 10.1], ch. 9 of Montanaro notes |
Mon | Dec 2 | Shor's nine-qubit code | [NC, Sec. 10.2], ch. 9 of Montanaro notes |
Final exam after Dec 6 |
This is an advanced undergraduate introductory course to quantum computation but assumes no prior knowledge of quantum information.
Tentative list of topics:
You will work in a team of 2-3 to write an expository paper on a topic of your choice from the quantum computation and information literature. You should submit a project proposal, a project progress report, and your completed paper. A list of candidate project topics, along with some commentary, will be released on Sept 27. (You will not be disadvantaged if you choose a topic outside this list.)
Dates and guidelines (adapted from here):
Prior knowledge of quantum information is not a prerequisite. The prerequisites are both of (a) one of CPSC 203, CPSC 221, and (b) one of MATH 152, MATH 221, MATH 223. Some prior knowledge of probability, discrete math, or quantum mechanics is helpful but could also be picked up during the course.
We will follow (i) the classic textbook Quantum Computation and Quantum Information by Nielsen and Chuang, (ii) a set of excellent lecture notes on quantum algorithms by Andrew M. Childs: [AMC], and (iii) my lecture notes.
Recommended lecture videos: Ryan O'Donnell (perhaps most relevant), Umesh Vazirani, John Watrous.
|