Talk:Deutsch-Jozsa algorithm
From Wikipedia, the free encyclopedia
[edit] corrected mistake
I found a small mistake in the description of the algorithm, and I corrected it. To me, the wording of the article is still a bit sloppy; but I'm not going to try to fix it at the moment. At least now the algorithm works. :) Karadoc** 05:27, 3 July 2006 (UTC)
[edit] What the...?
In section History, it is claimed that the original Deutsch algorithm was meant to solve the n=1 case only, and, furthermore, it was randomized, having only a 1/2 probability of successfully recognizing the input function as either constant or not. Well, i don't need a quantum computer for that... Simply toss a coin. If it comes up heads, claim 'constant'; 'non-constant' if tails. Or the other way around. You get the idea: Something must be amiss here. —Preceding unsigned comment added by 89.152.248.155 (talk) 04:02, 10 March 2008 (UTC)
- As I recall, the algorithm would return yes, no or fail (failed with prob 1/2). The gain over a coin flip was that the algorithm guaranteed confidence in the result. That is, a yes answer from the algorithm means it really was constant. Skippydo (talk) 07:45, 23 March 2008 (UTC)
[edit] problem with the formula for the probability of measuring ket 0
The formula that is given for measuring ket 0 does not make sense. Take the case that f(x) is balanced. The current formula is: say f(x) = 1 then the formula evaluates to: this is not equal to 1 as is claimed in the article, so there is an error in the formula
the correct formula should be:
I think that the correct formula for the probability should be:
not
The following article mentions the Deutsch-Jozsa Algorithm and it says that the amplitude of ket(0) is:
And the probability is the square of the amplitude.
http://arxiv.org/PS_cache/quant-ph/pdf/9708/9708016v1.pdf —Preceding unsigned comment added by Ursubaloo (talk • contribs) 16:47, 9 April 2008 (UTC)