Quantum Partial Search of a Database with Several Target Items

Authors:
Byung-Soo Choi;Vladimir E. Korepin
Affiliations:
Department of Electronics Engineering, School of Information and Communication Engineering, Sungkyunkwan University, Sungkyunkwan, Republic of Korea;C.N. Yang Institute for Theoretical Physics, State University of New York, Stony Brook, USA 11794-3840
Venue:
Quantum Information Processing
Year:
2007

Citing 6
Cited 2

A fast quantum mechanical algorithm for database search

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Strengths and Weaknesses of Quantum Computing

SIAM Journal on Computing
Is partial quantum search of a database any easier?

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Simple Algorithm for Partial Quantum Search

Quantum Information Processing
Quest for Fast Partial Search Algorithm

Quantum Information Processing
Sure Success Partial Search

Quantum Information Processing

Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights

Quantum Information Processing
Optimality proofs of quantum weight decision algorithms

Quantum Information Processing

Quantified Score

Hi-index	0.00

Visualization

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.