Quantum lower bound for sorting

Details Quantum lower bound for sorting Quantum lower bound for sorting

2000-09-22

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

Physics

Quantum Physics

This paper has been merged with another paper. See quant-ph/0102078

Scientific paper

We prove that \Omega(n log(n)) comparisons are necessary for any quantum
algorithm that sorts n numbers with high success probability and uses only
comparisons. If no error is allowed, at least 0.110nlog_2(n) - 0.067n + O(1)
comparisons must be made. The previous known lower bound is \Omega(n).

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-532529