| Grover's Algorithm for Multiobject Search in Quantum Computing (2007) | |||||||||||||||
Abstract | |||||||||||||||
| L. K. Grover's search algorithm in quantum computing gives an optimal, square-root speedup in the search for a single object in a large unsorted database. In this paper, we expound Grover's algorithm in a Hilbert-space framework that isolates its geometrical essence, and we generalize it to the case where more than one object satisfies the search criterion. In memory of Daniel Walls 1. Department of Mathematics, Texas A&M University, College Station, TX 77843-3368. 2. Supported in part by Texas A&M University Interdisciplinary Research Grant IRI 99-22. 3. Department of Physics and Institute for Quantum Studies, Texas A&M University, College Station, TX 77843-4242, and Max-Planck Institut fur Quantenoptik, Munich. 4. Supported in part by ONR, NSF, and Welch Foundation. 1 1 Introduction A quantum computer (QC) is envisaged as a collection of 2-state "quantum bits", or qubits (e.g., spin 1/2 particles). Quantum computation does calculations on data densely coded in the entangled state... | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||