A Limit on the Speed of Quantum Computation for Insertion into an Ordered List

Details A Limit on the Speed of Quantum Computation for Insertion into an Ordered List A Limit on the Speed of Quantum Computation for Insertion into an Ordered List

1998-12-18

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

Physics

Quantum Physics

5 pages

Scientific paper

We consider the problem of inserting a new item into an ordered list of N-1 items. The length of an algorithm is measured by the number of comparisons it makes between the new item and items already on the list. Classically, determining the insertion point requires log N comparisons. We show that, for N large, no quantum algorithm can reduce the number of comparisons below log N/(2 loglog N).

Affiliated with

Also associated with

No associations

Rating

A Limit on the Speed of Quantum Computation for Insertion into an Ordered List 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 A Limit on the Speed of Quantum Computation for Insertion into an Ordered List, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Limit on the Speed of Quantum Computation for Insertion into an Ordered List will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-444341