Quantum Walks and Search Algorithms

"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.

שנה

2013

שפה

English

סדרה

Quantum science and technology

הוצאה

Springer

מהדורות

8

עמודים

222

ISBN

9781461463351

מקור הנתונים: Wikidata