Series Title
Topological Quantum Computing

Series Abstract:
Quantum computing is a computational model introduced in the 1980's by Feynman and others, and has the potential to exponentially speed up classical computation as demonstrated by Shor's algorithm for factoring integers. I will explain a new paradigm for quantum computing pursued by our Microsoft team including Freedman, Kitaev, Nayak, Walker: topological quantum computing. Topological quantum computing is an inherently fault tolerant model based on topological quantum field theories (TQFTs). The lectures will first cover the standard quantum circuit model of quantum computing, the connection to Witten-Reshetikhin-Turaev Chern-Simons TQFT, and the possibility of building topological quantum computers based on the fractional quantum Hall effect exhibited in 2-dimensional electron liquids (which led to the 1998 Nobel Prize). I will not assume any background in quantum computing or quantum physics

Lecture 1
Nexus between quantum computing and quantum topology
Monday, Nov 28, 3 PM, MS 5137
Abstract                               ***(Download Lecture 1 here)***

Lecture 2
Quantum computing using anyons: representation of the braid groups
Wednesday, Nov 30, 3 PM, MS 6229
Abstract                               ***(Download Lecture 2 here)***

Lecture 3
Quantum computing by topological states of matter: TQFT
Friday, Dec 2, 1 PM, MS 5203
Abstract                               ***(Download Lecture 3 here)***