|Current Workshop | Overview||Back | Home | Search ||
Quantum Random Walks and Quantum Algorithms
Harry Buhrman (Amsterdam)
Frank den Hollander (Leiden)
Motivation and Background:
Networks form the backbone of modern society. To deal with the uncertainty, variation, unpredictability, size and complexity inherent in these networks, we need to develop radically new ways of thinking. Progress is expected to come from a combination of stochastics and algorithmics.
Classical random walks have been used successfully to model a variety of phenomena in physics, chemistry and biology. Over the past century a vast body of knowledge has accumulated, leading
to a better understanding of the basic processes underlying these phenomena. Classical random walks also play an important role in the development of classical algorithms, for instance, to explore
the architecture of large networks or to find fast ways to optimise their performance. Much less is known in the quantum setting, for which there are many open questions and many key challenges. The main goal of the workshop was to bring together the classical and the quantum community, discuss these questions and challenges, and look for common ground.
Invited lectures were given by:
Andris Ambainis (Riga)
Alexander Belov (Riga)
Richard Cleve (Waterloo)
Yimin Ge (Munchen)
David Gosset (Waterloo)
Sabine Jansen (Bochum)
Stacey Jeffery (Boston)
Roman Kotecky (Prague & Warwick)
Robin Kothari (Waterloo)
Hans Maassen (Nijmegen & Amsterdam)
Fred Magniez (Paris)
Piotr Milos (Warsaw)
Ashley Montanaro (Bristol)
Maris Ozols (Cambridge)
Frank Redig (Delft)
Jeremy Roland (Brussel)
Mario Szegedy (New Brunswick)
Balint Toth (Budapest & Bristol)
Daniel Ueltschi (Warwick)
Reinhard Werner (Hannover)
There were 15 additional participants. People came from different backgrounds: probability theory, statistical physics, quantum physics, combinatorics, logic, algorithmic theory.
At the opening of the workshop the organisers explained the main goals of the meeting: identify key problems for quantum random walks, investigate their role for developing quantum algorithms, discuss recent developments, and explore the links with classical random walks and classical algorithms.
The workshop had a strategic nature. Each day was devoted to a core topic on the agenda, with a plenary discussion at the end. The meeting was closed with a plenary discussion to reflect on what had been achieved during the week, and to look towards the future.