Is Quantum Search Practical?

Details Is Quantum Search Practical? Is Quantum Search Practical?

2004-04-30

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

Physics

Quantum Physics

Comments, criticisms and suggestions for improvement are welcome

Scientific paper

Quantum algorithms and circuits can, in principle, outperform the best non-quantum (classical) techniques for some hard computational problems. However, this does not necessarily lead to useful applications. To gauge the practical significance of a quantum algorithm, one must weigh it against the best conventional techniques applied to useful instances of the same problem. Grover's quantum search algorithm is one of the most widely studied. We identify requirements for Grover's algorithm to be useful in practice: (1) a search application S where classical methods do not provide sufficient scalability; (2) an instantiation of Grover's algorithm Q(S) for S that has a smaller asymptotic worst-case runtime than any classical algorithm C(S) for S; (3) Q(S) with smaller actual runtime for practical instances of S than that of any C(S). We show that several commonly-suggested applications fail to satisfy these requirements, and outline directions for future work on quantum search.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-632818