This being the second time I have taught this material for an entire semester, the syllabus looks pretty firm, but I reserve the right to veer off in different directions if the spirit seizes me. You should consult the syllabus often to keep track of changes as the course evolves.
Students adopting the graded track will be graded on their performance on the homework assignments. To receive a grade of CR on the ungraded track, students need only attend the lectures and show interest. There will not be any exams.
The syllabus shows five homework assignments, but the homework problems in each assignment will be assigned individually. Each problem will be posted as soon as it is available and will have its own due date, no later than the last date shown on the syllabus, but often earlier. The solution will be posted shortly after the problem is due.
| Homework | Class session | Lectures |
Nielsen
and Chuang |
Preskill |
|
HW #1
1.1: Due 9-3 Solution 1.2: Due 9-3 Solution 1.3: Due 9-3 Solution 1.4: Due 9-10 Solution 1.5: Due 9-15 Solution 1.6: Due 9-22 Solution |
T, 8-25 |
Introduction to course
L1: Classical circuit model |
1.1-1.4
4 |
1.1-1.6
6.1-6.3 |
| Th, 8-27 | L2: Quantum circuit model. Introduction | |||
| T, 9-1 |
L3: Quantum gates and controlled operations. I
L3-5 Review of qubits and Pauli algebra |
|||
| Th, 9-3 | L4: Quantum gates and controlled operations. II | |||
| T, 9-8 |
L5: Quantum gates and controlled operations. III
|
|||
| Th, 9-10 | L6: Universal quantum gates. I | |||
| T, 9-15 | Discussion of quantum-circuit model | |||
| Th, 9-17 |
L7: Measurement-based quantum computation. I
L7-9 Teleportation from circuit diagrams |
|||
| T, 9-22 | L8: Measurement-based quantum computation. II | |||
|
HW #2
2.1: Due 9-24 Solution 2.2: Due 9-24 Solution 2.3: Due 9-29 Solution 2.4: Due 10-1 Solution 2.5: Due 10-6 Solution 2.6: Due 10-13 Solution |
Th, 9-24 | L9: Measurement-based quantum computation. III | ||
| T, 9-29 |
L10: Cluster-state quantum computation. I
L10-12 |
|||
| Th, 10-1 | L11: Cluster-state quantum computation. II | |||
| T, 10-6 | L12: Cluster-state quantum computation. III | |||
| Th, 10-8 |
L13: Quantum Fourier transform and phase estimation
L13-14 |
1.4
4.7 5 6 |
1.3-1.6
6.3-6.12 |
|
| T, 10-13 | L14: Quantum Fourier transform and phase estimation | |||
|
HW #3
3.1: Due 10-20 Solution 3.2: Due 10-27 Solution 3.3: Due 11-19 Solution 3.4: Due 11-19 Solution |
Th, 10-15 | Fall Break | ||
| T, 10-20 |
L15: Applications of the quantum Fourier transform. I
L15-16 |
|||
| Th, 10-22 | L16: Applications of the quantum Fourier transform. II | |||
| T, 10-27 | L17: Quantum search algorithms | |||
| Th, 10-29 | No lecture | |||
| T, 11-3 | No lecture | |||
| Th, 11-5 | No lecture | |||
| T, 11-10 | L18: Hidden-subgroup problem | |||
| Th, 11-12 |
L19: From classical error correction to Shor's 9-qubit code. I
L19-20a |
10.1-10.2 |
1.7-1.8
7.1 |
|
| T, 11-17 | No lecture | |||
| Th, 11-19 |
L20a: From classical error correction to Shor's 9-qubit code. II
L20b: Reversible operations and quantum error correction. I |
|||
|
HW #4
4.1: Due 12-3 Solution 4.2: Due 12-8 Solution 4.3: Due 12-10 Solution |
T, 11-24 |
L21: Reversible operations and quantum error correction. II
L20b-21 |
10.3 | 7.2-7.4 |
| Th, 11-26 | Thanksgiving | |||
| T, 12-1 |
L22: Classical linear codes and CSS quantum codes. I
L22-24 |
10.4 | 7.5-7.8 | |
| Th, 12-3 | No lecture | |||
| T, 12-8 | L23: Classical linear codes and CSS quantum codes. II | |||
| Th, 12-10 | L24: Classical linear codes and CSS quantum codes. III |