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.

It is an in-joke among some computer scientists that, based on the many-worlds interpretation of quantum mechanics, quantum sorting consists of permuting the list randomly and using the outcome in the universe where it is correctly sorted (how to determine this universe is not specified, nor are the mechanics of the other operations).

See also

• Quantum algorithm
• Quantum computing

External Links

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