### Topics

### features

### Publications

### Issue Archive

# Quantum Search in Hilbert Space

- Created: Wednesday, 01 January 2003

### A large database would be searched in one quantum computing operation.

A proposed quantum-computing algorithm would perform a search for an item of information in a database stored in a Hilbert-space memory structure. The algorithm is intended to make it possible to search relatively quickly through a large database under conditions in which available computing resources would otherwise be considered inadequate to perform such a task.

The algorithm would apply, more specifically, to a relational database in which information would be stored in a set of*N*complex orthonormal vectors, each of

*N*dimensions (where

*N*can be exponentially large). Each vector would constitute one row of a unitary matrix, from which one would derive the Hamiltonian operator (and hence the evolutionary operator) of a quantum system. In other words, all the stored information would be mapped onto a unitary operator acting on a quantum state that would represent the item of information to be retrieved. Then one could exploit quantum parallelism: one could pose all search queries simultaneously by performing a quantum measurement on the system. In so doing, one would effectively solve the search problem in one computational step.

One could exploit the direct- and inner-product decomposability of the unitary matrix to make the dimensionality of the memory space exponentially large by use of only linear resources. However, inasmuch as the necessary preprocessing (the mapping of the stored information into a Hilbert space) could be exponentially expensive, the proposed algorithm would likely be most beneficial in applications in which the resources available for preprocessing were much greater than those available for searching.

*This work was done by Michail Zak of Caltech for NASA's Jet Propulsion Laboratory. For further information, access the Technical Support Package (TSP) free on-line at www.techbriefs.com/tsp under the Information Sciences category. NPO-30193. *

### This Brief includes a Technical Support Package (TSP).

** Quantum Search in Hilbert Space** (reference NPO-30193) is currently available for download from the TSP library.

Please Login at the top of the page to download.