Quantum Search Algorithm for Set Operation

Details Quantum Search Algorithm for Set Operation Quantum Search Algorithm for Set Operation

2008-06-09

arxiv.org/abs/0806.1539v1

Physics

Quantum Physics

15 page 2 Figure

Scientific paper

The operations of data set, such as intersection, union and complement, are the fundamental calculation in mathematics. It's very significant that designing fast algorithm for set operation. In this paper, the quantum algorithm for intersection is presented. And its running time is sqrt(|A|*|B|*|C|) for set operation C = A intersection B, while classical computation needs O (|A| *|B|) steps of computation in general, where |.| denotes the size of set. The presented algorithm is the combination of Grover's algorithm, classical memory and classical iterative computation, and the combination method decrease the complexity of designing quantum algorithm.The method can be used to design other set operations also. Keywords: Set operation, General Grover iteration, Grover's algorithm

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-174022