Jump to content

Quantum sort

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Davelong (talk | contribs) at 08:47, 30 June 2005 (Stub-sorting. You can help!). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A quantum sort is any sort 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 devised.

See also