Binary quantum search

Vladimir E. Korepin; Ying Xu

doi:10.1117/12.717282

25 April 2007 Binary quantum search

Vladimir E. Korepin, Ying Xu

Proceedings Volume 6573, Quantum Information and Computation V; 65730C (2007) https://doi.org/10.1117/12.717282
Event: Defense and Security Symposium, 2007, Orlando, Florida, United States

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.

Citation Download Citation

Vladimir E. Korepin and Ying Xu "Binary quantum search", Proc. SPIE 6573, Quantum Information and Computation V, 65730C (25 April 2007); https://doi.org/10.1117/12.717282

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available