Quantum lower bound for sorting
Quantum Physics
2007-05-23 v3
Abstract
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).
Cite
@article{arxiv.quant-ph/0009091,
title = {Quantum lower bound for sorting},
author = {Yaoyun Shi},
journal= {arXiv preprint arXiv:quant-ph/0009091},
year = {2007}
}
Comments
This paper has been merged with another paper. See quant-ph/0102078