Quantum Walks: Definition and Applications
ABSTRACT:
Random walks on graphs are an important tool in computer science. A recently-developed quantum mechanical version of random walks has the potential to become equally important in the study of quantum computation. This talk will provide an introduction to the field of quantum walks, and will be divided into two parts. The first part will explain the concepts behind quantum walks, how they differ from classical random walks, and how a quantum walk on a given graph can be produced. Unlike classical random walks, not every directed graph admits the definition of a quantum walk that respects the structure of the graph. The second part of the talk describes several applications of quantum walks. A number of quantum walk algorithms have been developed that outperform their classical counterparts: I will describe quantum algorithms for network routing, unstructured search, and element distinctness.
No comments:
Post a Comment