Grover's Quantum Search Algorithm and Diophantine Approximation

Details Grover's Quantum Search Algorithm and Diophantine Approximation Grover's Quantum Search Algorithm and Diophantine Approximation

2005-07-25

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

Physical Review A 73 022308 (2006)

Physics

Quantum Physics

8 pages, revtex, Title changed

Scientific paper

10.1103/PhysRevA.73.022308

In a fundamental paper [Phys. Rev. Lett. 78, 325 (1997)] Grover showed how a quantum computer can find a single marked object in a database of size N by using only O(N^{1/2}) queries of the oracle that identifies the object. His result was generalized to the case of finding one object in a subset of marked elements. We consider the following computational problem: A subset of marked elements is given whose number of elements is either M or K, M

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-53472