Quantum versions of random walks for quantum computing
- Event time: 1:00pm
- Event date: 27th October 2003
- Speaker: Vivien Kendon (Imperial College London)
- Location: Room 2511, James Clerk Maxwell Building (JCMB) James Clerk Maxwell Building Peter Guthrie Tait Road Edinburgh EH9 3FD GB
Will you be using a quantum computer for your numerical simulations in five to ten years time? Quantum computing offers the potential for exponentially more efficient calculations than classical computers. But not for all problems - we know of a set that make use of a quantum version of Fourier Transforms for their speed up (including factoring large numbers) and one example using a quantum version of a random walk. Other classes of problems, such as searching an unsorted database, can have at most a quadratic speed up. And then there are all the difficulties of actually building a quantum computer... I will give an introductory overview of quantum computing, suitable for the non-specialist, in the course of which my own work on quantum versions of random walks will get a brief mention.
This is a weekly series of informal talks given primarily by members of the soft condensed matter and statistical mechanics groups, but is also open to members of other groups and external visitors. The aim of the series is to promote discussion and learning of various topics at a level suitable to the broad background of the group. Everyone is welcome to attend..