Note: this is an information page, the course is given through LiU's e-learning system lisam
TSIT11 Quantum Algorithms and Quantum Information
This course provides an introduction to the main ideas and techniques of the field of quantum algorithms and quantum information. The course attempts to introduce the needed background in computer science, mathematics and physics necessary to understand the field comprehensible to students from the main engineering programs at LiU. The most important requirements are a certain level of mathematical maturity, and the desire to learn about quantum algorithms and quantum information.
The course contains lectures, problem solving sessions, and labs where we use equipment from https://www.phasespacecomputing.com/
Course book
Nielsen, Michael A.; Chuang, Isaac L., Quantum Computation and Quantum Information, Cambridge University Press, 2nd ed or later.
Labs:
Groups of three people, you choose yourselves. There are preparatory exercises you need to submit before doing the lab.
Lectures and Q&A sessions:
NB: “Exercises” and “Problems” are different in N&C, the below refers to “Exercises”
| No. | Subject | Read | Exercises |
|---|---|---|---|
| 1 | Classical computation, complexity, reversibility | N&C ch 3 | 3.8, 3.9, 3.11, 3.13, 3.17, 3.19, 3.28, 3.29, 3.31, 3.32 Optional: 3.1, 3.2, 3.3, 3.15, 3.16, 3.24, 3.26 |
| 2 | Quantum bits, preparation, measurement, transformation, composite systems | N&C ch 1.1-1.3, 2.1-2.2 except 2.2.4 and 2.2.6, in 2.5 read Theorem 2.7 | 2.16, 2.17, 2.18, 2.19, 2.26, 2.27, 2.33, 2.51, 2.52, 2.53, 2.79 Optional: 2.22, 2.23, 2.24, 2.35, 2.76, 2.80 |
| 3 | Quantum circuits, No-cloning, completeness of the quantum Toffoli | N&C ch 4, Box 12.1 | 4.1, 4.2, 4.4, 4.6, 4.7, 4.12, 4.13, 4.20, 4.22, 4.24, 4.31, 4.36 Optional: 4.41, 4.42, 4.43 |
| Q&A1 | Beforehand do N&C exercises, I think we may only have time to cover lecture 1 and 2 | ||
| 4 | First quantum algorithms: Deutsch-Jozsa, Bernstein-Vazirani, quantum parallellism, phase kickback | N&C 1.4, more details in 2.2 except 2.2.4 and 2.2.6 | 2.35, 2.58, 2.59, 2.60, 2.66 Optional: 2.54, 2.56 |
| 5 | Simon’s algorithm, Quantum Fourier Transform, Shor’s algorithm | N&C 5.1, 5.2 | |
| 5 1/2 | Shor’s algorithm (continued) | N&C 5.3, 5.4 | 5.4, 5.7, 5.10, 5.12, 5.13, 5.18, 5.19 Optional: 5.6, 5.20, 5.25 |
| Q&A2 | |||
| 6 | Quantum uncertainty, Quantum entanglement, contextuality | 2.1.9, 2.6 | 2.61, 2.69 Optional: Problem 2.3 |
| Q&A3 | |||
| 7 | Quantum teleportation, Superdense coding, Quantum Key Distribution (Quantum Cryptography) | 1.3.7, 2.3, 12.6 | |
| Lab1/ lab2 |
Deutsch-Jozsa/ Shor’s algorithm |
Lab-PM in lisam | Exercises in Lab-PM |
| 8 | Mixed states, Generalized measurements | 2.1.8, 2.2.3-2.2.4 and 2.2.6, 2.4-2.5 | 2.70, 2.71, 2.72, 2.74, 2.75, 2.78, 2.82:(1-2) Optional: 2.81, 2.82:(3), 2.62 |
| Lab2/ lab1 |
Shor’s algorithm/ Deutsch-Jozsa |
Lab-PM in lisam | Exercises in Lab-PM |
| 9 | Quantum error correction | 8.1-8.3, 10.1-10.3.1 | 8.4, 8.5, 8.15, 8.20, 8.22, 10.2, 10.3, 10.5, 10.6 Optional: 8.3, 8.28, 8.29, 10.7 |
| Q&A4 | |||
| Lab3/ lab4 |
Quantum Teleportation/ Quantum Key Distribution |
Lab-PM in lisam | Exercises in Lab-PM |
| 10 | Grover’s algorithm, search problems | N&C ch 6 | 6.2, 6.3, Show that if N=4M then one Grover iteration gives success probability 1 |
| 11 | The quantum advantage, hidden linear functions, Boson sampling | ||
| Lab4/ lab3 |
Quantum Key Distribution/ Quantum Teleportation |
Lab-PM in lisam | Exercises in Lab-PM |
| 12 | Quantum annealing, Adiabatic Quantum computation |