TY  - BOOK
AU  - Portugal,Renato
TI  - Quantum walks and search algorithms
T2  - Quantum science and technology
SN  - 9781461463351 (hdbk. : acidfree paper)
U1  - 530.120151 23
PY  - 2013///
CY  - New York
PB  - Springer
KW  - Quantum theory
KW  - Mathematics
KW  - Data processing
KW  - Algorithms
N1  - Includes bibliographic references and index; 1. Introduction --
2. The Postulates of Quantum Mechanics --
3. Introduction to Quantum Walks --
4. Grover's Algorithm and Its Generalization --
5. Quantum Walks on Infinite Graphs --
6. Quantum Walks on Finite Graphs --
7. Limiting Distribution and Mixing Time --
8. Spatial Search Algorithms --
9. Hitting Time--
A. Linear algebra for quantum computation--
References--
Index
N2  - This book addresses an interesting area of quantum computation called quantum walks, which play an important role in building quantum algorithms, in particular search algorithms. Quantum walks are the quantum analogue of classical random walks. It is known that quantum computers have great power for searching unsorted databases. This power extends to many kinds of searches, particularly to the problem of finding a specific location in a spatial layout, which can be modeled by a graph. The goal is to find a specific node knowing that the particle uses the edges to jump from one node to the next
ER  -