Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Quantum Partial Search of a Database with Several Target Items

Quantum Partial Search of a Database with Several Target Items We consider unstructured database separated into blocks of equal size. Blocks containing target items are called target blocks. Blocks without target items are called non-target blocks. We present a fast quantum algorithm, which finds one of the target blocks. The algorithm uses the same oracle, which the main Grover algorithm does. We study the simplest case, when each target block has the same number of target items. Our algorithm is based on Boyer, Brassard, Hoyer, and Tapp algorithm of searching database with several target items and on Grover–Radhakrishnan algorithm of partial search. We minimize the number of queries to the oracle. We analyze the algorithm for blocks of large size. In next publications we shall consider more general case when the number of target items is different in different target blocks. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

Quantum Partial Search of a Database with Several Target Items

Loading next page...
 
/lp/springer-journals/quantum-partial-search-of-a-database-with-several-target-items-VfNSeJH1gu

References (18)

Publisher
Springer Journals
Copyright
Copyright © 2007 by Springer Science+Business Media, LLC
Subject
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
ISSN
1570-0755
eISSN
1573-1332
DOI
10.1007/s11128-007-0056-3
Publisher site
See Article on Publisher Site

Abstract

We consider unstructured database separated into blocks of equal size. Blocks containing target items are called target blocks. Blocks without target items are called non-target blocks. We present a fast quantum algorithm, which finds one of the target blocks. The algorithm uses the same oracle, which the main Grover algorithm does. We study the simplest case, when each target block has the same number of target items. Our algorithm is based on Boyer, Brassard, Hoyer, and Tapp algorithm of searching database with several target items and on Grover–Radhakrishnan algorithm of partial search. We minimize the number of queries to the oracle. We analyze the algorithm for blocks of large size. In next publications we shall consider more general case when the number of target items is different in different target blocks.

Journal

Quantum Information ProcessingSpringer Journals

Published: Aug 22, 2007

There are no references for this article.