Searching in Grover's Algorithm

Simple item page
dc.creatorJozsa, Richard
dc.date1999-01-09
dc.date.accessioned2026-07-07T06:16:02Z
dc.date.available2026-07-07T06:16:02Z
dc.descriptionGrover's algorithm is usually described in terms of the iteration of a compound operator of the form $Q = - H I_{0} H I_{x_0}$. Although it is quite straightforward to verify the algebra of the iteration, this gives little insight into why the algorithm works. What is the significance of the compound structure of $Q$? Why is there a minus sign? Later it was discovered that $H$ could be replaced by essentially any unitary $U$. What is the freedom involved here? We give a description of Grover's algorithm which provides some clarification of these questions.
dc.description8 pages, Latex
dc.identifierhttps://arxiv.org/abs/quant-ph/9901021
dc.identifierhttp://arxiv.org/abs/quant-ph/9901021
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/93938
dc.subjectQuantum Physics
dc.titleSearching in Grover's Algorithm
dc.typetext

Files

Collections

arXiv