Talk:Grover's algorithm
From Wikipedia, the free encyclopedia
 |
This article is within the scope of WikiProject Physics, which collaborates on articles related to physics. | |
| ??? | This article has not yet received a rating on the assessment scale. [FAQ] | |
| ??? | This article has not yet received an importance rating within physics. | |
|
Please rate this article, and then leave comments here to explain the ratings and/or to identify the strengths and weaknesses of the article. |
||
This article needs to flesh out the potential uses for Grover's algorithm.
[edit] Incorrect use of O-notation?
from the article: Furthermore, the probability of obtaining the wrong answer becomes O(1/N), which goes to zero for large N.
I could be way off the mark, especially because I don't understand the content of the article, but I understand O-notation is used in expressing the performance of an algorithm, not for the probability of a particular output. However, I really know nothing about quantum physics, barely more about the study of algorithms, and I haven't even read the entire article. Moskvax 14:34, 16 November 2005 (UTC)
It's also used for describing errors and the like ("infinitesimal asymptotics"), exactly in this case. See Big_O_notation. Captain Segfault 19:05, 23 November 2005 (UTC)
