Canonical ring: Difference between revisions
Jump to navigation
Jump to search
en>Brad7777 removed Category:Complex manifolds; added Category:Structures on manifolds using HotCat |
en>Addbot m Bot: Migrating 1 interwiki links, now provided by Wikidata on d:q2251151 |
||
| Line 1: | Line 1: | ||
A '''quantum sort''' is any [[sorting algorithm]] that runs on a [[quantum computer]]. Any comparison-based quantum sorting algorithm would take at least <math>\Omega(n \log n)</math> steps,<ref>{{cite conference | |||
| author = P. Høyer, J. Neerbek, Y. Shi | |||
| title = Quantum complexities of ordered searching, sorting, and element distinctness | |||
| booktitle = 28th International Colloquium on Automata, Languages, and Programming | |||
| pages = 62–73 | |||
| year = 2001 | |||
| url = http://www.springerlink.com/content/25gl9elr5rxr3q6a/ | |||
}} [http://arxiv.org/abs/quant-ph/0102078 Also in quant-ph/0102078] | |||
</ref> which is already achievable by classical algorithms. Thus, for this task, quantum computers are no better than classical ones. Do note, that in space-bounded sorts, quantum algorithms outperform their classical counterparts.<ref>{{cite conference | |||
| last = Klauck | |||
| first = Hartmut | |||
| title = Quantum Time-Space Tradeoffs for Sorting | |||
| url=http://portal.acm.org/citation.cfm?id=780553 | |||
| booktitle=Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | |||
| year=2003 | |||
}}</ref> | |||
==References== | |||
<!-- this 'empty' section displays references defined elsewhere --> | |||
{{reflist}} | |||
==See also== | |||
* [[Bogosort]], a sorting algorithm with a joke quantum implementation | |||
{{quantum computing}} | |||
{{sorting}} | |||
[[Category:Sorting algorithms]] | |||
[[Category:Quantum information science]] | |||
{{comp-sci-theory-stub}} | |||
Revision as of 05:36, 14 March 2013
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. Do note, that in space-bounded sorts, quantum algorithms outperform their classical counterparts.[2]
References
43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.
See also
- Bogosort, a sorting algorithm with a joke quantum implementation
Template:Quantum computing Template:Sorting
- ↑ 55 years old Systems Administrator Antony from Clarence Creek, really loves learning, PC Software and aerobics. Likes to travel and was inspired after making a journey to Historic Ensemble of the Potala Palace.
You can view that web-site... ccleaner free download Also in quant-ph/0102078 - ↑ 55 years old Systems Administrator Antony from Clarence Creek, really loves learning, PC Software and aerobics. Likes to travel and was inspired after making a journey to Historic Ensemble of the Potala Palace.
You can view that web-site... ccleaner free download