Online Public Access Catalogue (OPAC)
Library,Documentation and Information Science Division

“A research journal serves that narrow

borderland which separates the known from the unknown”

-P.C.Mahalanobis


Image from Google Jackets

Quantum walks and search algorithms / Renato Portugal.

By: Material type: TextTextSeries: Quantum science and technologyPublication details: New York : Springer, 2013.Description: xi, 222 p. : illustrations ; 24 cmISBN:
  • 9781461463351 (hdbk. : acidfree paper)
Subject(s): DDC classification:
  • 530.120151 23 P853
Contents:
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.
Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Holdings
Item type Current library Call number Status Date due Barcode Item holds
Books ISI Library, Kolkata 530.120151 P853 (Browse shelf(Opens below)) Available 136409
Total holds: 0

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.

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.

There are no comments on this title.

to post a comment.
Library, Documentation and Information Science Division, Indian Statistical Institute, 203 B T Road, Kolkata 700108, INDIA
Phone no. 91-33-2575 2100, Fax no. 91-33-2578 1412, ksatpathy@isical.ac.in