You can manage bookmarks using lists, please log in to your user account for this.
Media type:
E-Article
Title:
A random walk approach to quantum algorithms
Contributor:
Kendon, Vivien M
Published:
The Royal Society, 2006
Published in:
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 364 (2006) 1849, Seite 3407-3422
Language:
English
DOI:
10.1098/rsta.2006.1901
ISSN:
1364-503X;
1471-2962
Origination:
Footnote:
Description:
The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial; pure quantum dynamics is deterministic, so randomness only enters during the measurement phase, i.e. when converting the quantum information into classical information. The outcome of a quantum random walk is very different from the corresponding classical random walk owing to the interference between the different possible paths. The upshot is that quantum walkers find themselves further from their starting point than a classical walker on average, and this forms the basis of a quantum speed up, which can be exploited to solve problems faster. Surprisingly, the effect of making the walk slightly less than perfectly quantum can optimize the properties of the quantum walk for algorithmic applications. Looking to the future, even with a small quantum computer available, the development of quantum walk algorithms might proceed more rapidly than it has, especially for solving real problems.