Computational matematics series/Computational mathematics series

Generalization of Grover’s algorithm to multiobject search in quantum computing, Part I

Goong Chen, S. A. Fulling, Jeesen Chen

Published Feb 14, 2002• 1 citation

Publisher

DOI: 10.1201/9781420035377.ch6

Related papers

Generalization of Grover’s algorithm to multiobject search in quantum computing, Part II

Goong Chen, Shunhua Sun Chen

Computational matematics series/Computational mathematics seriesFeb 14, 20020 citations

Grover’s Algorithm for Multiobject Search in Quantum Computing

Goong Chen, S. A. Fulling, Hwang Lee +1 more

arXiv:quant-ph/9909040Springer eBooksNov 16, 200719 citations

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

Goong Chen, Shunhua Sun

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.

arXiv:quant-ph/0007124Jul 31, 20000 citations

Generalization of Grover’s algorithm to multiobject search in quantum computing, Part II: general unitary transfor- mations

Goong Chen, Shunhua Sun

Abstract There are major advantages in a newer version of Grover’s quantum algorithm [4] 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.

Chapman & Hall/CRC eBooksFeb 14, 20024 citations

Problem-Solution Symmetry in Grover’s Quantum Search Algorithm

Fumiaki Morikoshi

International Journal of Theoretical PhysicsFeb 7, 20116 citations

Generalization of Grover's Algorithm to Multiobject Search in Quantum Computing, Part I: Continuous Time and Discrete Time

Goong Chen, S. A. Fulling, Jeesen Chen

L. K. Grover's search algorithm in quantum computing gives an optimal, quadratic speedup in the search for a single object in a large unsorted database. In this paper, we generalize Grover's algorithm in a Hilbert-space framework for both continuous and discrete time cases that isolates its geometrical essence to the case where more than one object satisfies the search criterion.

arXiv:quant-ph/0007123Jul 31, 20000 citations