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 queries. These algorithms are quantum entropy increasing.
© 2001 Optical Society of America
PDF ArticleMore Like This
Ashish Mani and C Patvardhan
QMI28 International Conference on Quantum Information (QIM) 2011
Eduard Olegovich Samsonov and Fedor Dmitrievich Kiselev
F5A.24 Quantum Information and Measurement (QIM) 2019
M. Suhail Zubairy, Marlan O. Scully, and Goong Chen
PB14 International Conference on Quantum Information (QIM) 2001