arXiv Analytics

Sign in

arXiv:quant-ph/0007124AbstractReferencesReviewsResources

Generalization of Grover's Algorithm to Multiobject Search in Quantum Computing, Part II: General Unitary Transformations

Goong Chen, Shunhua Sun

Published 2000-07-31Version 1

There are major advantages in a newer version of Grover's quantum algorithm utilizing a general unitary transformation in the search of a single object in a large unsorted database. In this paper, we generalize this algorithm to multiobject search. We show the techniques to achieve the reduction of the problem to one on an invariant subspace of dimension just equal to two.

Related articles: Most relevant | Search more
arXiv:quant-ph/0007123 (Published 2000-07-31)
Generalization of Grover's Algorithm to Multiobject Search in Quantum Computing, Part I: Continuous Time and Discrete Time
arXiv:quant-ph/0012143 (Published 2000-12-27)
A Generalization of Grover's Algorithm
arXiv:1006.1234 [quant-ph] (Published 2010-06-07)
Entanglement and final state of a black hole under general unitary transformation