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

2000/07/31 by Goong Chen, Chen, Goong, Shunhua Sun +1
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Mechanics and Applications #Quantum Physics (quant-ph) #quant-ph

paper · pdf · doi:10.48550/arxiv.quant-ph/0007124

7 pages, 1 figure

arxiv created 2000/07/31 · openalex publication_date 2000/07/31 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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

• Grover's Algorithm for Multiobject Search in Quantum Computing
• Generalization of Grover's Algorithm to Multiobject Search in Quantum Computing, Part I: Continuous Time and Discrete Time
• Grover's Algorithm: Quantum Database Search
• Quantum Database Searching by a Single Query
• Accelerated quantum search using partial oracles and Grover's algorithm