Course pages 2016–17

# Quantum Computing

### Slides

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:

- Bits and qubits
- Review of linear algebra
- Postulates of quantum mechanics
- The model of quantum computation
- Quantum information processing protocols

### Exercise sheets

### Extra material

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

- You can take a look at the first few pages of a tutorial on Quantum computation by Samuel L. Braunstein.
- Take a look at John Watrous lecture 1 notes. I also recommend the book Linear Algebra Done Right by Sheldon Axler.
- This lecture is based on Section 2.2 of [
**NC**] (see below). - 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.

### References

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