Lecture Dates |
Book Sections |
Comments |
01-22, 01-24 |
Chapter 1 |
Read this chapter carefully. This material should be review from EECS
510, so pay special attention to any unfamiliar parts. |
01-29, 01-31 |
2.1, 2.3, 3.1 |
You can read more about the NP complexity class on Wikipedia
[wiki].
|
02-05, 02-07 |
3.2, 4.1, 4.2 |
You should read about Fermat's Little Theorem [wiki] and the Fermat
probabilistic primality test [wiki].
|
02-12, 02-14 |
4.2, 4.3 |
You should read about Fermat's Little Theorem
[wiki],
the Fermat probabilistic primality test,
[wiki],
and the Miller-Rabin probabilistic primality test
[wiki].
|
02-19, 02-21 |
5.1, 5.2, 6.1 |
The text assumes familiarity with advanced linear algebra, and
therefore gives only a terse treatment of what is required for quantum
algorithms in Chapter 6. If this is unfamiliar to you, Linear Algebra
for Quantum Computation by Renaldo Portugal
[pdf]
is an excellent reference. |
02-26, 02-28 |
6.1, 6.2, 6.3, Ch. 7 |
You should keep reading Linear Algebra
for Quantum Computation by Renaldo Portugal
[pdf]
if you'd like more detail. |
03-05, 03-07 |
Ch. 7, 8.1 |
|
03-19, 03-21 |
8.2 |
The exam will be held in-class on 03-21. |
03-26, 03-28 |
9.1, 9.2 |
|
04-02, 04-04 |
9.4, 10.1, 10.2 |
|
04-09, 04-11 |
10.2, 13.1 |
You should read about the Hidden Subgroup Problem (HSP)
[wiki],
Simon's algorithm
[wiki],
and Shor's algorithm
[wiki].
|
04-16, 04-18 |
13.1, 13.2 |
You should read about the discrete logarithm
[wiki].
Keep reading about the Hidden Subgroup Problem (HSP)
[wiki]
and Simon's algorithm
[wiki] |
04-23, 04-25 |
13.3, 13.4, 13.5 |
You should read about the algorithm to estimate eigenvalues (quantum
phase estimation)
[wiki].
|
04-30, 05-02 |
13.5, 13.6 |
Read about the classical Fourier transform
[wiki]
if you're not familiar with it before reading about the quantum version
[wiki].
|
05-07, 05-09 |
14.1, 14.2, 14.3 |
|