Share Email Print

Proceedings Paper

Binary quantum search
Author(s): Vladimir E. Korepin; Ying Xu
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

We consider a database with one target item. Partial search is designed to find a part of the database [a block] containing the target item. After a user finds the target block he/she might want to make another partial search: subdivide the target block into sub-blocks and look for a sub-block containing the target item. An example: if we need to go to a hotel, we first look at a State map [to find highways] and then at a town map [to find a local approach to the hotel]. Number of queries necessary for sequential searches is calculated in the paper. Sequential partial search can be done faster the first one.

Paper Details

Date Published: 25 April 2007
PDF: 10 pages
Proc. SPIE 6573, Quantum Information and Computation V, 65730C (25 April 2007); doi: 10.1117/12.717282
Show Author Affiliations
Vladimir E. Korepin, State Univ. of New York at Stony Brook (United States)
Ying Xu, State Univ. of New York at Stony Brook (United States)

Published in SPIE Proceedings Vol. 6573:
Quantum Information and Computation V
Eric J. Donkor; Andrew R. Pirich; Howard E. Brandt, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?