Simple Algorithm for Partial Quantum Search

Authors:
Vladimir E. Korepin;Lov K. Grover
Affiliations:
C.N. Yang Institute for Theoretical Physics, State University of New York at Stony Brook, Stony Brook, USA 11794-3840;Bell Laboratories, Lucent Technologies, Murray Hill, USA 07974
Venue:
Quantum Information Processing
Year:
2006

Citing 1
Cited 9

Quantum computation and quantum information

Quantum computation and quantum information

Is partial quantum search of a database any easier?

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

Quantum Information Processing
Sure Success Partial Search

Quantum Information Processing
Quantum Partial Search of a Database with Several Target Items

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

Quantum Information Processing
Tree search and quantum computation

Quantum Information Processing
A quantum production model

Quantum Information Processing
Optimality proofs of quantum weight decision algorithms

Quantum Information Processing
Multiparty controlled quantum secure direct communication based on quantum search algorithm

Quantum Information Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Quite often in database search, we only need to extract portionof the information about the satisfying item. We consider thisproblem in the following form: the database of N items is separatedinto K blocks of size b = N / K elements each and an algorithm hasjust to find the block containing the item of interest. The queriesare exactly the same as in the standard database search problem. Wepresent a quantum algorithm for this problem of partial search thattakes about 0.34 √b fewer iterations than thequantum search algorithm.