Jump to content

Quantum sort

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Chris-martin (talk | contribs) at 19:55, 14 August 2006 (External link exists in Bogosort, and Quantum computing is already linked in text, merge bogosort text with bogosort article). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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
Quantum algorithm

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