| Lecture Dates | Book Sections | Comments |
|---|---|---|
| 05-05, 05-07 | 14.1, 14.2, 14.3 | What the book refers to as BQNP is more commonly known as QMA. A good reference for additional QMA-complete problems is the Survey paper QMA-complete problems by Bookatz [arxiv]. |
| 04-28, 04-30 | None | We'll be covering the general solution to the Abelian HSP this week. Please consult the notes I've written on it [pdf][tex]. |
| 04-21, 04-23 | 13.4, 13.5, 13.8 | We will be finishing up Shor's factoring algorithm and then moving on to a discussion of the quantum polynomial-time solution to the Discrete Logarithm Problem. |
| 04-14, 04-16 | 13.2, 13.3, 13.5 | We will be covering the Quantum Fourier Transform (QFT) and the Eigenvalue Approximation (section 13.5) algorithms in preparation for Shor's factoring algorithm. The book covers the QFT as an exercise, so please read about it on Wikipedia. |
| 04-07, 04-09 | 13.1, Group Theory | Historically,
Simon's problem
was the second problem to exhibit superpolynomial speedup on a quantum
computer. It is a special case of the
Hidden Subgroup Problem,
which is an area of active research.
If you're unfamiliar with cosets in group theory, you should read the MIT opencourseware notes on them [pdf]. |
| 03-31, 04-02 | 10.1, 10.2 | We also covered a technique for proving complexity lower bounds for quantum algorithms. This technique was developed by Ambainis in his thesis and is presented in the paper Quantum lower bounds by quantum arguments [arXiv]. |
| 03-24, 03-26 | 9.1, 9.4 | Read more about Grover's Algorithm here. |
| 03-03, 03-05 | 8.1, 9.1, 9.2 | You can read more about Grover's Algorithm here. |
| 02-25, 02-27 | 6.2, 6.3, Chapter 7 | Continue reading Linear Algebra for Quantum Computation by Renaldo Portugal [pdf] if you require additional resources for the linear algebra. |
| 02-18, 02-20 | 5.1, 5.2, 6.1, 6.2 | The text assumes familiarity with advanced linear algebra, and therefore gives only a terse treatment of what is required for quantum algorithms in 6.1 and 6.2. Read these sections carefully. If you would like additional reference material, please see Linear Algebra for Quantum Computation by Renaldo Portugal [pdf]. |
| 02-11, 02-13 | Appendix A, 4.2 | You can read more about the Miller-Rabin probabilistic primality checking algorithm here. |
| 02-04, 02-06 | 4.1, 4.2, Appendix A | Definition 4.1 on p36 is incorrect. The last part of it should read "M
gives answer 'no' with probability >= 1-e" (similar to the line above).
The point is that the probability of error is at most e.
Appendix A gives a quick overview of the number theory that we will need. Please read it carefully and consult online resources (or ask during office hours) if there are any topics that you struggle with. |
| 01-28, 01-30 | 2.1, 2.2, 3.1, 3.2 | If you are unfamiliar with any of the compelxity classes mentioned in these sections (P/poly, NP, NP-hard, etc.), please be sure read some background material (e.g. on Wikipedia: P/poly, NP, NP-hard, NP-complete). |
| 01-21, 01-23 | Chapter 1 | Read this chapter carefully. This material should be review from EECS 510, so pay special attention to any unfamiliar parts. |
Modified:
2020-05-07