Quantum database search can do without sorting

Patel, Apoorva (2001) Quantum database search can do without sorting. In: Physical Review A (Atomic, Molecular, and Optical Physics), 64 (3). 034303/1-4.

Preview

PDF Quantum_database.pdf Download (55kB)

Abstract

Sorting is a fundamental computational process that facilitates subsequent searching of a database. It can be thought of as factorization of the search process. The location of a desired item in a sorted database can be found by classical queries that inspect one letter of the label at a time. For an unsorted database, no such classical quick search algorithm is available. If the database permits quantum queries, however, then mere digitization is sufficient for efficient search. Sorting becomes redundant with the quantum superposition of states. A quantum algorithm is written down that locates the desired item in an unsorted database a factor of two faster than the best classical algorithm can in a sorted database. This algorithm has close resemblance to the assembly process in DNA replication.

Item Type:	Journal Article
Publication:	Physical Review A (Atomic, Molecular, and Optical Physics)
Publisher:	American Physical Society (APS)
Additional Information:	The DOI is currently only displayed. Copyright for this article belongs to American Physical Society (APS)
Keywords:	Quantum database;Sorting
Department/Centre:	Division of Physical & Mathematical Sciences > Centre for Theoretical Studies (Ceased to exist at the end of 2003) Division of Interdisciplinary Sciences > Supercomputer Education & Research Centre
Date Deposited:	09 Jun 2004
Last Modified:	19 Sep 2010 04:12
URI:	http://eprints.iisc.ac.in/id/eprint/299

Actions (login required)

View Item