This is a 32-lecture course, with each lecture being about 45 minutes, given by Chris Godsil. Note that the 17th lecture was not recorded, but slides are at least available for it. The other 31 lectures are still of interest, but this needs to be known.
This course will provide an introduction to problems in quantum computing that can be studied using tools from algebraic graph theory. The quantum topics will relate to quantum walks and to quantum homomorphisms, automorphisms and colouring. The tools from algebraic graph theory include graphs automorphisms and homomorphisms, spectral decomposition and generating functions.
Prerequisites: I will assume a solid background in linear algebra and knowledge of what a permutation group is. Other topics will be covered in class, or in the notes. I will assume the knowledge of physics I had when I started on this topic, that is, no knowledge.
- Lecture 1
- Lecture 2
- Lecture 3
- Lecture 4
- Lecture 5
- Lecture 6
- Lecture 7
- Lecture 8
- Lecture 9
- Lecture 10
- Lecture 11
- Lecture 12
- Lecture 13
- Lecture 14
- Lecture 15
- Lecture 16
- Lecture 17
- Lecture 18
- Lecture 19
- Lecture 20
- Lecture 21
- Lecture 22
- Lecture 23
- Lecture 24
- Lecture 25
- Lecture 26
- Lecture 27
- Lecture 28
- Lecture 29
- Lecture 30
- Lecture 31
- Lecture 32
These videos were produced by the Fields Institute, as a graduate course (link to course page).
