Noisy Grover's search algorithm

Simple item page
dc.creatorEllinas, Demosthenes
dc.creatorKonstadakis, Christos
dc.date2001-10-01
dc.date.accessioned2026-07-07T06:02:46Z
dc.date.available2026-07-07T06:02:46Z
dc.descriptionExternal environment influences on Grover's search algorithm modeled by quantum noise are investigated. The algorithm is shown to be robust under that external dissipation. Explicitly we prove that the resulting search positive maps acting on unsorted N-dimensional database made of projective density matrices depend on x the strength of the environment, and that there are infinitely many x values for which search is successful after O(\sqrt{N}) queries. These algorithms are quantum entropy increasing.
dc.descriptionContribution to ICQI-2001, 5pages
dc.identifierhttps://arxiv.org/abs/quant-ph/0110010
dc.identifierhttp://arxiv.org/abs/quant-ph/0110010
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/89738
dc.subjectQuantum Physics
dc.titleNoisy Grover's search algorithm
dc.typetext

Files

Collections

arXiv