Quantum Search Algorithm with more Reliable Behaviour using Partial Diffusion

Details Quantum Search Algorithm with more Reliable Behaviour using Partial Diffusion Quantum Search Algorithm with more Reliable Behaviour using Partial Diffusion

2003-12-02

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

Proceedings of the Seventh International Conference on Quantum Communication, Measurement and Computing, pp. 171 -- 174 (2004)

Physics

Quantum Physics

27 pages, 9 figures

Scientific paper

10.1063/1.1834408

In this paper, we will use a quantum operator which performs the inversion about the mean operation only on a subspace of the system ({\it Partial Diffusion Operator}) to propose a quantum search algorithm runs in $O(\sqrt N/M})$ for searching unstructured list of size $N$ with $M$ matches such that, $1\le M \le N$. We will show that the performance of the algorithm is more reliable than known quantum search algorithms especially for multiple matches within the search space. A performance comparison with Grover's algorithm will be provided.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-688362