arXiv · quant-ph/0110010
Noisy Grover's search algorithm
Abstract
External 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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Demosthenes Ellinas, Christos Konstadakis. 2001-10-01. Noisy Grover's search algorithm. https://searcharxiv.com/abs/quant-ph/0110010
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.