A quantum sort is any sorting algorithm that runs on a quantum computer. Any comparison-based quantum sorting algorithm would take at least steps,[1] which is already achievable by classical algorithms. Thus, for this task, quantum computers are no better than classical ones, and should be disregarded when it comes to time complexity. However, in space-bounded sorts, quantum algorithms outperform their classical counterparts.[2]
General | |||||||||
---|---|---|---|---|---|---|---|---|---|
Theorems | |||||||||
Quantum communication |
| ||||||||
Quantum algorithms | |||||||||
Quantum complexity theory | |||||||||
Quantum processor benchmarks | |||||||||
Quantum computing models | |||||||||
Quantum error correction | |||||||||
Physical implementations |
| ||||||||
Quantum programming | |||||||||
Theory | |
---|---|
Exchange sorts | |
Selection sorts | |
Insertion sorts | |
Merge sorts | |
Distribution sorts | |
Concurrent sorts | |
Hybrid sorts | |
Other | |
Impractical sorts |