@inproceedings{6e32d475686d45d4979f3f6c64d79d4d,
title = "Binary quantum search",
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.",
keywords = "Binary search, Grover algorithm, Grover oracle, Partial search, Quantum search, Unsorted database",
author = "Korepin, \{Vladimir E.\} and Xu Ying",
year = "2007",
doi = "10.1117/12.717282",
language = "English",
isbn = "0819466956",
series = "Proceedings of SPIE - The International Society for Optical Engineering",
booktitle = "Quantum Information and Computation V",
note = "Quantum Information and Computation V ; Conference date: 10-04-2007 Through 12-04-2007",
}