Introduction to Quantum Information

The classical theory of computation usually does not refer to physics. Pioneers such as Turing, Church, Post and Goedel managed to capture the correct classical theory by intuition alone and, as a result, it is often falsely assumed that its foundations are self-evident and purely abstract. They are not! Computers are physical objects and computation is a physical process. Hence when we improve our knowledge about physical reality, we may also gain new means of improving our knowledge of computation. From this perspective it should not be very surprising that the discovery of quantum mechanics has changed our understanding of the nature of computation. In this series of lectures you will learn how inherently quantum phenomena, such as quantum interference and quantum entanglement, can make information processing more efficient and more secure, even in the presence of noise. 

Prerequisites and Desirable Previous Knowledge

The course material should be of interest to physicists, mathematicians, computer scientists, and engineers. The following will be assumed as prerequisites for this course:

  • elementary probability, complex numbers, vectors and matrices;
  • Dirac bra-ket notation;
  • a basic knowledge of quantum mechanics especially in the simple context of finite dimensional state spaces (state vectors, composite systems, unitary matrices, Born rule for quantum measurements);
  • basic ideas of classical theoretical computer science (complexity theory) would be helpful but are not essential.

Prerequisite notes will be provided giving an account of the necessary material. It would be desirable for you to look through these notes slightly before the start of the course.

Prerequisite notes

  • In statu nascendi

Lectures 2017

Tuesday 9am: L4 (week 2-4,6-8) L5 (week 5)
Wednesday 3pm: L6 (week 3,5-7) L3 (weeks 2,4), L2 (week 8) 

  • WEEK1: Basic concepts, quantum interference, “impossible” logic gates, qubits and single qubit interference (Hadamard, phase, Hadamard), 

Old Lecturenotes

Each lecture is summarised in no more than two pages.

  • Lecture 0   Bits, gates, networks, Boolean functions, reversible and probabilistic computation
  • Lecture 1   "Impossible" logic gates, amplitudes, quantum interference
  • Lecture 2   One, two and many qubits
  • Lecture 3   Entanglement and entangling gates
  • Lecture 4   From interference to quantum algorithms
  • Lecture 5   Algorithms, computational complexity and Quantum Fourier Transform
  • Lecture 6   Phase estimation and quantum factoring
  • Lecture 7   Non-local correlations and cryptography
  • Lecture 8   Bell's inequalities 
  • Lecture 9   Density matrices and CP maps
  • Lecture 10  Decoherence and quantum error correction

The notes are half-baked and may contain errors. Please let me know if you find any.

Problem Sheets

Supplementary Material