# Sebastian Pokutta's Blog

Mathematics and related topics

## A great lecture series on “Computational Complexity and Quantum Computation”

A great lecture series on “Computational Complexity and Quantum Computation” by Timothy Gowers is available online at the University of Cambridge. The lecture is actually available in several formats including one suitable for iPhones and iPods so that you could even watch them on the go ;-). The next time you are bored while waiting in line you know what to do… (that is probably the natural extension of listening to audio books while driving)

Especially the part on Razborov’s result is interesting. The known exponential size lower bounds on the size of Gomory-Chvátal cutting plane proofs are based on this result and monotone interpolation, i.e., splitting up a proof of infeasibility into two for certain subsystems using only monotone operations. Timothy Gowers tries to provide a motivation *how* one actually can come up with a construction as Razborov’s. See also his great overview article on Razborov’s proof and its motivation (and his blog post on both).  I bet that the part on quantum computing is great as well but I have to admit that I haven’t been waiting in lines often enough recently…

Computational complexity is the study of what resources, such as time and memory, are needed to carry out given computational tasks, with a particular focus on lower bounds for the amount needed of these resources. Proving any result of this kind is notoriously difficult, and includes the famous problem of whether P = N P . This course will be focused on two major results in the area. The first is a lower bound, due to Razborov, for the number of steps needed to determine whether a graph contains a large clique, if only “monotone” computations are allowed. This is perhaps the strongest result in the direction of showing that P and N P are distinct (though there is unfortunately a very precise sense in which the proof cannot be developed to a proof of the whole conjecture). The second is Peter Shor’s remarkable result that a quantum computer can factorize large integers in
polynomial time. In order to present these two results, it will be necessary to spend some time discussing some of the basic concepts of computational complexity, such as the relationship between Turing machines and the more obviously mathematical notion of circuit complexity, and an introduction to what a quantum computation actually is. For the latter, no knowledge of quantum mechanics will be expected, and scarcely any will be imparted during the course: it is possible to understand quantum computation in a very “pure mathematics” way. The reason this is a graduate course rather than a Part III course is that I intend to give several lectures in an informal style that would be hard to examine. It is not because the material will be more advanced: indeed, my aim will be to make allowances for the fact that people will not be working on it with an exam in mind, and to make the course as easy to follow as I can. Having said that, the main results will be proved in full: the informal discussion will be with a view to making these proofs more comprehensible.

The collection will have 12 graduate level lectures which are currently being given during the Easter term 2009. Many thanks to Adrian Callum-Hinshaw for his help with these video lectures.