Quantum Searching via Entanglement and Partial Diffusion

Details Quantum Searching via Entanglement and Partial Diffusion Quantum Searching via Entanglement and Partial Diffusion

2004-06-27

arxiv.org/abs/quant-ph/0406207v3

Physica D. Vol. 237(8) pp. 1074-1078 (2007)

Physics

Quantum Physics

19 pages. Submitted to IJQI. Please forward comments/enquires for the first author to ayounes2@yahoo.com

Scientific paper

10.1016/j.physd.2007.12.005

In this paper, we will define a quantum operator that performs the inversion about the mean only on a subspace of the system (Partial Diffusion Operator). This operator is used in a quantum search algorithm that runs in O(sqrt{N/M}) for searching an unstructured list of size N with M matches such that 1<= M<=N. We will show that the performance of the algorithm is more reliable than known {fixed operators quantum search algorithms} especially for multiple matches where we can get a solution after a single iteration with probability over 90% if the number of matches is approximately more than one-third of the search space. We will show that the algorithm will be able to handle the case where the number of matches M is unknown in advance such that 1<=M<=N in O(sqrt{N/M}). A performance comparison with Grover's algorithm will be provided.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-281159