Lecturer: Ronald de Wolf (CWI and ILLC)

Teaching assistant: Giannicola Scarpa (CWI)

You can also consult the following three sets of slides from an earlier mini-course:

- Introduction, this corresponds roughly to the first 3 weeks
- Quantum algorithms, this covers the lectures about Shor and Grover
- Quantum communication, this covers quantum information, communication complexity, cryptography

- Michael A. Nielsen and Isaac L. Chuang,
*Quantum Computation and Quantum Information*, Cambridge University Press, 2000.

Location: week 5-11 in Science Park G2.13, week 13-20 in Science Park D1.162

Each homework set will get a grade between 1 and 10; if you don't hand it in you'll score a 1 for that week. When determining the average grade for the homework, we will ignore your two lowest scores. The final grade is determined by the average homework-grade (1/2 of the final grade), a midterm exam (1/4 of the final grade) and the final exam (1/4).

- [Feb 1] Introduction to quantum mechanics and qubits, overview of the course

Chapter 1 of lecture notes

Homework

- [Feb 8] The circuit model, Deutsch-Jozsa algorithm

Chapter 2 of lecture notes

Homework

- [Feb 15] Simon's algorithm

Chapter 3 of lecture notes

Homework

- [Feb 22] The (quantum) Fourier transform

Chapter 4 of lecture notes

Homework

- [Mar 1] Shor's algorithm

Chapter 5 of lecture notes

Homework

- [Mar 8] Grover's algorithm

Chapter 6 of lecture notes

Homework

Grover search in action

- [Mar 15] Quantum random walk algorithms

Chapter 7 of lecture notes

Homework

[Mar 21] 15:00-18:00, midterm exam in D1.116, about the first 7 weeks. The midterm is "open book", meaning you can bring any kind of paper you want (but no electronic devices)

- [Mar 29] Quantum query lower bounds

Chapter 8 of lecture notes

Homework

- [Apr 5] Quantum complexity theory

Chapter 9 of lecture notes

Homework

- [Apr 12] Quantum encodings, with a non-quantum application

Chapter 10 of lecture notes

Homework

- [Apr 19] Quantum communication complexity

Chapter 11 of lecture notes

Homework

- [Apr 26] Entanglement and non-locality

Chapter 12 of lecture notes

Homework

- [May 3] Quantum cryptography

Chapter 13 of lecture notes

Homework

- [May 10] Error-correction and fault-tolerance

Chapter 14 of lecture notes

Homework

- [May 17] Summary of the course, some perspective, physical implementations

No lecture notes (but you could have a look at this paper by David DiVincenzo). No homework

[May 25] 16:00-19:00, final exam in A1.10 (NB: this is a Wednesday, not a Tuesday). The exam is "open book", meaning you can bring any kind of paper you want (but no electronic devices). There will be two versions: one covering the whole course and one covering only lectures 8-14. The first option means your grade for the midterm won't be counted and the final determines half of your overall grade (you can take this option if you didn't like your midterm grade). In the second option the midterm and final each determine a quarter of your overall grade. In both cases, the homework grade determines the other half of the overall grade.

Last update of this page: May 14, 2011.