Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group
  • Optical Fiber Communication Conference and International Conference on Quantum Information
  • 2001 OSA Technical Digest Series (Optica Publishing Group, 2001),
  • paper PB12
  • https://doi.org/10.1364/ICQI.2001.PB12

Noisy Grover's search algorithm

Not Accessible

Your library or personal account may give you access

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 O(N) after queries. These algorithms are quantum entropy increasing.

© 2001 Optical Society of America

PDF Article
More Like This
A Fast Measurement based fixed-point Quantum Search Algorithm

Ashish Mani and C Patvardhan
QMI28 International Conference on Quantum Information (QIM) 2011

Modeling two-qubit Grovers algorithm implementation in a linear optical chip

Eduard Olegovich Samsonov and Fedor Dmitrievich Kiselev
F5A.24 Quantum Information and Measurement (QIM) 2019

Quantum Optical Implementation of Quantum Computing Algorithms

M. Suhail Zubairy, Marlan O. Scully, and Goong Chen
PB14 International Conference on Quantum Information (QIM) 2001

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All Rights Reserved