ISBN-13: 9781461463351 / Angielski / Twarda / 2013 / 222 str.
ISBN-13: 9781461463351 / Angielski / Twarda / 2013 / 222 str.
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.This book is self-contained with main topics that include: