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

Simple item page
dc.creatorChen, Goong
dc.creatorSun, Shunhua
dc.date2000-07-31
dc.date.accessioned2026-07-07T06:00:33Z
dc.date.available2026-07-07T06:00:33Z
dc.descriptionThere 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.
dc.description7 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/quant-ph/0007124
dc.identifierhttp://arxiv.org/abs/quant-ph/0007124
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/88999
dc.subjectQuantum Physics
dc.titleGeneralization of Grover's Algorithm to Multiobject Search in Quantum Computing, Part II: General Unitary Transformations
dc.typetext

Files

Collections

arXiv