arXiv:0705.0777 · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE
Binary quantum search
V. E. Korepin, Ying Dong Xu
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.