A Family of Grover's Quantum Searching Algorithms

Details A Family of Grover's Quantum Searching Algorithms A Family of Grover's Quantum Searching Algorithms

2000-09-21

arxiv.org/abs/quant-ph/0009086v1

Physics

Quantum Physics

REVTEX file, 6 pages, two-column, 3 eps figures; accepted in Phys. Rev. A

Scientific paper

10.1103/PhysRevA.62.062303

We introduce the concepts of Grover operators and Grover kernels to systematically analyse Grover's searching algorithms. Then, we investigate a one-parameter family of quantum searching algorithms of Grover's type and we show that the standard Grover's algorithm is a distinguished member of this family. We show that all the algorithms of this class solve the searching problem with an efficiency of order $O(\sqrt{N})$, with a coefficient which is class-dependent. The analysis of this dependence is a test of the stability and robustness of the algorithms. We show the stability of this constructions under perturbations of the initial conditions and extend them upon a very general class of Grover operators.

Affiliated with

Also associated with

No associations

Rating

A Family of Grover's Quantum Searching Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Family of Grover's Quantum Searching Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Family of Grover's Quantum Searching Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-131740