Group Theoretical Formulation of Quantum Partial Search Algorithm

Details Group Theoretical Formulation of Quantum Partial Search Algorithm Group Theoretical Formulation of Quantum Partial Search Algorithm

2006-09-27

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

Prog. Theor. Phys. Vol. 116, No. 5 (2006), p. 783

Physics

Quantum Physics

12 pages

Scientific paper

10.1143/PTP.116.783

Searching and sorting used as a subroutine in many important algorithms. Quantum algorithm can find a target item in a database faster than any classical algorithm. One can trade accuracy for speed and find a part of the database (a block) containing the target item even faster, this is partial search. An example is the following: exact address of the target item is given by a sequence of many bits, but we need to know only some of them. More generally partial search considers the following problem: a database is separated into several blocks. We want to find a block with the target item, not the target item itself. In this paper we reformulate quantum partial search algorithm in terms of group theory.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-167649