Computer Laboratory

Course pages 2016–17

Quantum Computing


This year's lectures will be uploaded as we go. Their content is somewhat different from previous years, but you can still access a full set of last year's notes. Below are slides from this year's lectures so far:

  1. Bits and qubits
  2. Review of linear algebra
  3. Postulates of quantum mechanics
  4. The model of quantum computation
  5. Quantum information processing protocols
  6. Quantum search
  7. Quantum factoring

Exercise sheets

  1. Exercise sheet 1

Extra material

If you are looking for more background material, here are some suggestions for each lecture:

  1. You can take a look at the first few pages of a tutorial on Quantum computation by Samuel L. Braunstein.
  2. Take a look at John Watrous lecture 1 notes. I also recommend the book Linear Algebra Done Right by Sheldon Axler.
  3. This lecture is based on Section 2.2 of [NC] (see below).
  4. Check out The IBM Quantum Experience where you can learn more about quantum computing and try running your own algorithms! Reversible classical computation is covered well in Section 3 of [Bra]. Deutsch's algorithm is covered well in Section 2.2 of [Mer]. Relevant sections of [NC]: 1.4.1 Classical computations on a quantum computer, 1.4.2 Quantum parallelism, 1.4.3 Deutsch's algorithm. Relevant sections of [KLM]: 1.5 Reversible computation, 6.2 Phase kick-back, 6.3 The Deutsch Algorithm.


  1. [Bra] Braunstein S.L., Quantum computation.
  2. [KLM] Kaye P., Laflamme R., Mosca M. (2007). An Introduction to Quantum Computing. Oxford University Press.
  3. [Mer] Mermin N.D. (2007). Quantum Computer Science: An Introduction. Cambridge University Press.
  4. [NC] Nielsen M.A., Chuang I.L. (2010). Quantum Computation and Quantum Information. Cambridge University Press.