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

Simple item page
dc.creatorChen, Goong
dc.creatorFulling, Stephen A.
dc.creatorChen, Jeesen
dc.date2000-07-31
dc.date.accessioned2026-07-07T06:00:33Z
dc.date.available2026-07-07T06:00:33Z
dc.descriptionL. 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.
dc.description20 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/0007123
dc.identifierhttp://arxiv.org/abs/quant-ph/0007123
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/88998
dc.subjectQuantum Physics
dc.titleGeneralization of Grover's Algorithm to Multiobject Search in Quantum Computing, Part I: Continuous Time and Discrete Time
dc.typetext

Files

Collections

arXiv