Quantum sort
From Infogalactic: the planetary knowledge core
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. However, in space-bounded sorts, quantum algorithms outperform their classical counterparts.[2]
References
- ↑ Lua error in package.lua at line 80: module 'strict' not found. Also in quant-ph/0102078
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
| General |
 |
||||||||
|---|---|---|---|---|---|---|---|---|---|
| Quantum communication | |||||||||
| Quantum algorithms | |||||||||
| Quantum complexity theory | |||||||||
| Quantum computing models | |||||||||
| Decoherence prevention | |||||||||
| Physical implementations |
|
||||||||
<templatestyles src="Asbox/styles.css"></templatestyles>
