Grover's Algorithm for Multiobject Search in Quantum Computing

Simple item page
dc.creatorChen, G.
dc.creatorFulling, S. A.
dc.creatorScully, M. O.
dc.date1999-09-13
dc.date1999-11-11
dc.date.accessioned2026-07-07T06:16:56Z
dc.date.available2026-07-07T06:16:56Z
dc.descriptionL. 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.
dc.description11 pages, LaTeX; for proceedings of Jackson Hole Quantum Optics Workshop in honor of Daniel Walls Corrections and minor revisions
dc.identifierhttps://arxiv.org/abs/quant-ph/9909040
dc.identifierhttp://arxiv.org/abs/quant-ph/9909040
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/94240
dc.subjectQuantum Physics
dc.titleGrover's Algorithm for Multiobject Search in Quantum Computing
dc.typetext

Files

Collections

arXiv