Quantum Computing (UvA course code 5334QUCO8Y)

University of Amsterdam and Mastermath course, Fall 2024 semester

Lecturer: Ronald de Wolf (CWI and ILLC)
Teaching assistants: Lynn Engelberts, Daan Schoneveld, and Quinten Tupker (CWI/UvA)

Registration is through the Mastermath website, not through your own university.

Contents of the course:

Today's computers---both in theory (Turing machines) and practice (PCs and smart phones)---are based on classical physics. However, modern quantum physics tells us that the world behaves quite differently. A quantum system can be in a superposition of many different states at the same time, and can exhibit interference effects during the course of its evolution. Moreover, spatially separated quantum systems may be entangled with each other and operations may have "non-local" effects because of this. Quantum computation is the field that investigates the computational power and other properties of computers based on quantum-mechanical principles. Its main building block is the qubit which, unlike classical bits, can take both values 0 and 1 at the same time, and hence affords a certain kind of parallelism. The laws of quantum mechanics constrain how we can perform computational operations on these qubits, and thus determine how efficiently we can solve a certain computational problem. Quantum computers generalize classical ones and hence are at least as efficient. However, the real aim is to find computational problems where a quantum computer is much more efficient than classical computers. For example, Peter Shor in 1994 found a quantum algorithm that can efficiently factor large integers into their prime factors. This problem is generally believed to take exponential time on even the best classical computers, and its assumed hardness forms the basis of much of modern cryptography (particularly the widespread RSA system). Shor's algorithm breaks all such cryptography. A second important quantum algorithm is Grover's search algorithm, which searches through an unordered search space quadratically faster than is possible classically. In addition to such algorithms, there is a plethora of other applications: quantum cryptography, quantum communication, simulation of physical systems, and many others.
The course is taught from a mathematical and theoretical computer science perspective, but should be accessible for physicists as well. This is a theory course, no programming is involved.

Prerequisites:

Familiarity with basic linear algebra, probability theory, discrete math, algorithms, all at the level of a first Bachelor's course. Also general mathematical maturity: knowing how to write down a proof properly and completely. Beware: The expected level of rigour and precision in homework and exam is a bit higher than what is typically expected in physics courses.

Material:

Ronald's lecture notes.
If you have trouble with some of the material, you could have a look at the first few chapters of Nielsen and Chuang's book Quantum Computation and Quantum Information, which takes a slower pace.

Grades and homework:

Your final grade will be determined 40% by homework and 60% by a final 3-hour exam in June (with the possibility of a re-sit of the exam a few weeks later). It's a general rule of Mastermath courses that you need an exam grade of at least 5.0 and a final grade of at least 5.5 to pass the course. The final grade is expressed as a half integer between 1 and 10, with the exception that 5.5 is not allowed as a final grade (this will be rounded to 5 or 6).
There will be 7 homework sets. You can write down your solutions, scan them (for instance using an app on your phone), and upload them as one pdf file on the ELO website before the deadline via the "Homework" assignments that I will set up there. Your homework grade will be determined by the best 6 of your 7 homework grades, so no big problem if you mess up or skip 1 of the homeworks. This also covers cases where you might not be able to hand in a particular homework set on time for whatever reason, so please don't ask me for permission to submit late.

Lectures and location:

Starting September 9: every Monday 14:00-16:45, Amsterdam Science Park room C0.110. Each Monday block consists of 2x45 minutes of oral lectures and a 45-minute exercise session. There won't be a live stream nor recordings of this year's lectures, and I would encourage people to attend in person as much as possible to interact with me and other students, ask questions during the lectures etc.

As a backup you can watch the lectures from 2022 here: https://vimeo.com/showcase/9241142 with password 98rT
The first 14 lectures correspond essentially to the first 14 lectures of this term (the topic of the 15th lecture was not in the 2022 course).

  1. Monday Sep 9, 14:00-16:45
    Introduction to quantum mechanics and qubits, overview of the course
    Chapter 1 of lecture notes. Also make sure you know the material in Appendices A and B

    Sunday Sep 15: Homework set 1 due (upload in ELO before 11:59pm): Ex 4, 7, 11, 12 from Chapter 1

  2. Monday Sep 16, 14:00-16:45
    The circuit model, Deutsch-Jozsa algorithm
    Chapter 2 of lecture notes

  3. Monday Sep 23, 14:00-16:45
    Simon's algorithm
    Chapter 3 of lecture notes

    Sunday Sep 29: Homework set 2 due (upload in ELO before 11:59pm): Ex 2, 5, 9, 12 from Chapter 2 and Ex 3, 4 from Chapter 3

  4. Monday Sep 30, 14:00-16:45
    Quantum Fourier transform
    Chapter 4 of lecture notes

  5. Monday Oct 7, 14:00-16:45
    Shor's factoring algorithm
    Chapter 5 of lecture notes

    Sunday Oct 13: Homework set 3 due (upload in ELO before 11:59pm): Ex 1, 2, 3, 4 from Chapter 4, and Ex 2 and 3 from Chapter 5

  6. Monday Oct 14, 14:00-16:45
    Grover's search algorithm
    Chapter 7 of lecture notes

  7. Monday Oct 21, 14:00-16:45
    Quantum walks
    Chapter 8 of lecture notes

    Sunday Oct 27: Homework set 4 due (upload in ELO before 11:59pm): Ex 1, 8, and 11 from Chapter 7, and Ex 4 and 5 from Chapter 8

  8. Monday Oct 28, 14:00-16:45
    Hamiltonian simulation
    Chapter 9.1-3 of lecture notes

  9. Monday Nov 4, 14:00-16:45
    Finishing Hamiltonian simulation, and the HHL algorithm
    Chapter 9.4 and Chapter 10 of lecture notes

    Sunday Nov 10: Homework set 5 due (upload in ELO before 11:59pm): Ex 2, 8, 9, and 10 from Chapter 9, and Ex 1 and 3 from Chapter 10

  10. Monday Nov 11, 14:00-16:45
    Quantum query lower bounds
    Chapter 11 of lecture notes

  11. Monday Nov 18, 14:00-16:45
    Quantum complexity theory
    Chapter 13 of lecture notes

    Sunday Nov 24: Homework set 6 due (upload in ELO before 11:59pm): Ex 3, 5, 7, 10 from Chapter 11, and Ex 2, 4 from Chapter 13

  12. Monday Nov 25, 14:00-16:45
    Quantum encodings, with a non-quantum application
    Chapter 15 of lecture notes

  13. Monday Dec 2, 14:00-16:45
    Quantum communication complexity
    Chapter 16 of lecture notes

  14. Monday Dec 9, 14:00-16:45
    Quantum cryptography
    Chapter 18 of lecture notes

    Sunday Dec 15: Homework set 7 due (upload in ELO before 11:59pm): Ex 2, 5, 7 from Chapter 15, Ex 5, 12 from Chapter 16, and Ex 2, 4 from Chapter 18

  15. Monday Dec 16, 14:00-16:45
    Error-correction and fault-tolerance
    Chapter 20 of lecture notes


    Monday Jan 27, 14:00-17:00, final exam.

    Monday Feb 24, 14:00-17:00, re-sit of exam

    If you want to practice: here are the exams from 2015, 2017, 2018, 2019, 2020, 2021, 2022, 2022 (resit), Spring 2023, Fall 2023, with solutions.
Last update of this page: Nov 25, 2024