Modified Grover's search algorithm for the cases where the number of solutions is known

Simple item page
dc.creatorGupta, A. S.
dc.creatorGupta, M.
dc.creatorPathak, A.
dc.date2005-06-14
dc.date.accessioned2026-07-07T06:12:59Z
dc.date.available2026-07-07T06:12:59Z
dc.descriptionGrover's search algorithm searches a database of $N$ unsorted items in $O(\sqrt{N/M})$ steps where $M$ represents the number of solutions to the search problem. This paper proposes a scheme for searching a database of $N$ unsorted items in $O(logN)$ steps, provided the value of $M$ is known. It is also shown that when $M$ is unknown but if we can estimate an upper bound of possible values of $M$, then an improvement in the time complexity of conventional Grover's algorithm is possible. In that case, the present scheme reduces the time complexity to $O(MlogN)$.
dc.description6 pages, No Figure, Latex 2e
dc.identifierhttps://arxiv.org/abs/quant-ph/0506105
dc.identifierhttp://arxiv.org/abs/quant-ph/0506105
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/92954
dc.subjectQuantum Physics
dc.titleModified Grover's search algorithm for the cases where the number of solutions is known
dc.typetext

Files

Collections

arXiv