Formulation of a Family of Sure-Success Quantum Search Algorithms

Details Formulation of a Family of Sure-Success Quantum Search Algorithms Formulation of a Family of Sure-Success Quantum Search Algorithms

2002-10-30

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

International Journal of Quantum Information, Vol. 2, No. 3, pp. 285-294 (2004)

Physics

Quantum Physics

10 pages, 3 figures

Scientific paper

In this work, we consider a family of sure-success quantum algorithms, which is grouped into even and odd members for solving a generalized Grover search problem. We prove the matching conditions for both groups and give the corresponding formulae for evaluating the iterations or oracle calls required in the search computation. We also present how to adjust the phase angles in the generalized Grover operator to ensure the sure-success if minimal oracle calls are demanded in the search.

Affiliated with

Also associated with

No associations

Rating

Formulation of a Family of Sure-Success Quantum Search 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 Formulation of a Family of Sure-Success Quantum Search Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Formulation of a Family of Sure-Success Quantum Search Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-535093