This article was nominated for deletion. Please review prior discussions if you are considering renomination. Keep, June 16, 2005, see discussion. Keep, May 30, 2005, see discussion.

This article is rated Stub-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Computing: Software / CompSci Low‑importance This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing Low This article has been rated as Low-importance on the project's importance scale. This article is supported by WikiProject Software (assessed as Low-importance). This article is supported by WikiProject Computer science (assessed as Low-importance). This article is supported by Computer hardware task force (assessed as Low-importance). Things you can help WikiProject Computer science with: edit history watch purge Here are some tasks awaiting attention: Article requests : Requested articles/Applied arts and sciences/Computer science, computing, and Internet Cleanup : Computer science articles needing attention Computer science articles needing expert attention Copyedit : Computing Expand : Computer science Infobox : Computer science articles without infoboxes Maintain : Timeline of computing 2020–present Photo : Find pictures for the biographies of computer scientists (see List of computer scientists) Computing articles needing images Stubs : Computer science stubs Unreferenced : WikiProject Computer science/Unreferenced BLPs Project-related : Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}} Computer science Low‑importance This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science Low This article has been rated as Low-importance on the project's importance scale. Things you can help WikiProject Computer science with: Here are some tasks awaiting attention: Article requests : Requested articles/Applied arts and sciences/Computer science, computing, and Internet Cleanup : Computer science articles needing attention Computer science articles needing expert attention Copyedit : Computing Expand : Computer science Infobox : Computer science articles without infoboxes Maintain : Timeline of computing 2020–present Photo : Find pictures for the biographies of computer scientists (see List of computer scientists) Computing articles needing images Stubs : Computer science stubs Unreferenced : WikiProject Computer science/Unreferenced BLPs Project-related : Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Speedy deletion reason by User:WAS_4.250:

No source listed. No source found when I searched. This is a dictionary definition with an unprovable assertion as the Quantum computer does not exist and the Quantum algoritm does not exist.

I removed this deletion tag because I don't think an article that has already been AfD'd twice can be subjected to a speedy delete.

Unprovable or not, remember that our criterion is verifiability, not truth. It looks like there is sufficient source material to build a decent article on this concept, regardless of whether such a thing will ever actually be constructed. ~ Booya ^Bazooka 14:40, 17 June 2007 (UTC)Reply

• "Quantum sort is sorting on a quantum computer" really isn't saying much. I suggest we redirect this article to Bogosort, which is sourced. >Radiant< 11:16, 18 June 2007 (UTC)Reply

There is more to the concept of sorting on a quantum machine than the bogosort joke, though. The article doesn't currently say much of anything, you're right. But it should say a lot more. ~ Booya ^Bazooka 11:46, 18 June 2007 (UTC)Reply

• If it could say anything not already covered in sorting and quantum computing and such, go for it. Frankly I'm no expert on the subject, it's just that at present this article is pretty close to our definition of lack of content. >Radiant< 13:15, 18 June 2007 (UTC)Reply

I can't believe I'm the only person to have thought of this, but every time I explain it physicists start edging away from me. Quantum sorting is in fact very swift and very simple. All one has to do is randomly rearrange your items to be sorted using some kind of seed derived from an interaction in quantum dynamics (like radioactive decay noise). If the randomly rearranged items are not in order, destroy the universe^*. Due to the branching of universes, at least one universe will now exist in which the items are in order. Naturally, as this constitutes original research, for which I undoubtedly deserve some sort of prize, I shall not be adding it to the article.

^*Details are left as an exercise for the reader.

That is called post-selection, and sadly you are not the first to think of it anon. I reccomend taking a look at the work of Scott Aaronson or Jargon file :P. --DFRussia (talk) 20:53, 29 June 2010 (UTC)Reply

This article does not deserve to be on its own, and should be merged into the general sorting article. --DFRussia (talk) 20:53, 29 June 2010 (UTC)Reply