• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Quantum Walks and Search Algorithms

Quantum Walks and Search Algorithms

Hardcover

Series: Quantum Science and Technology

General ComputersPhysics

ISBN10: 1461463351
ISBN13: 9781461463351
Publisher: Springer Nature
Published: Feb 16 2013
Pages: 222
Weight: 1.12
Height: 0.56 Width: 6.14 Depth: 9.21
Language: English

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.

Also in

General Computers