2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/94240L. 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.11 pages, LaTeX; for proceedings of Jackson Hole Quantum Optics Workshop in honor of Daniel Walls Corrections and minor revisionsQuantum Physicstext