Paper
25 April 2007 Binary quantum search
Author Affiliations +
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.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
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
Lens.org Logo
CITATIONS
Cited by 6 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Databases

Detection and tracking algorithms

Superposition

Binary data

Quantum communications

Physics

Astronomy

Back to Top