Jump to content

Quantum sort

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by CJLL Wright (talk | contribs) at 07:43, 5 June 2007 (category rename per CfD 2007 May 24 using AWB). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A quantum sort is any sorting algorithm that runs on a quantum computer. Such an algorithm could at best be linearly faster than any existing sort algorithm (if based on comparisons like classical algorithms), but no such algorithm has actually been implemented.

See also

  • Bogosort, a sorting algorithm with a joke quantum implementation
Stub icon

This computer science article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Quantum_sort&oldid=136005815"