Quantum walks and search algorithms
By: Renato Portugal
Series: Quantum science and technology
Publisher: Springer
Published: 2013
Place of publication: New York
Language: eng
Number of pages: 222
ISBN-13: 9781461463351
Subjects: Quantum theory; Mathematics; Data processing; Algorithms
Description: "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."--from back cover.
Notes: Includes bibliographic references (pages 215-218) and index.
Table of contents: title: The postulates of quantum mechanics; title: Introduction to quantum walks; title: Grover's algorithm and its generalization; title: Quantum walks on infinite graphs; title: Quantum walks on finite graphs; title: Limiting distribution and mixing time; title: Spatial search algorithms; title: Hitting time; title: Linear algebra for quantum computation.