Quantum Partial Search of a Database with Several Target Items
Quantum Physics
2007-06-06 v2
Abstract
We consider a database separated into blocks. Blocks containing target items are called target blocks. Blocks without target items are called non-target blocks. We consider a case, when each target block has the same number of target items. We present a fast quantum algorithm, which finds one of the target blocks. Our algorithm is based on Grover-Radhakrishnan algorithm of partial search. We minimize the number of queries to the oracle.
Keywords
Cite
@article{arxiv.quant-ph/0608106,
title = {Quantum Partial Search of a Database with Several Target Items},
author = {Byung-Soo Choi and Vladimir Korepin},
journal= {arXiv preprint arXiv:quant-ph/0608106},
year = {2007}
}
Comments
13 pages