Quantum sort

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 implemented.

A joke

Quantum sort is also an in-joke among computer scientists. It is a theoretical sort algorithm taking advantage of the multiple-universe theory. It is purely hypothetical however.

In essence, one takes a random permutation of a set of elements. According to the many-worlds theory of quantum mechanics, there will then exist a parallel universe in which the set of elements is sorted. According to the theory, one simply destroys all the universes where the set is not sorted, using the principle of quantum immortality to perform useful calculations.

See also

• Quantum algorithm
• Quantum computing

External Links

• bogo-sort in the Jargon File (with a discussion of the joke Quantum sort)