Revision as of 12:50, 14 October 2010 edit Bender2k14 (talk \| contribs) Extended confirmed users 1,999 edits →A more complete explanation of the 2 bit algorithm ← Previous edit		Revision as of 23:48, 20 October 2010 edit undo Skippydo (talk \| contribs) 848 edits →A more complete explanation of the 2 bit algorithm Next edit →
Line 132: The key to the algorithm is the final Hadamard transformation on qubit x, which maps the constant functions to <math>\|0\rangle</math> and the balanced functions to <math>\|1\rangle</math> The behaviour is described as part of the description of [[Hadamard_transform#Quantum_computing_applications\|Hadamard Transform Quantum Gates]]. [[User:DavidBoden\|DavidBoden]] ([[User talk:DavidBoden\|talk]]) :I agree with your reasoning for including this. You have my blessing to incorporate this. [[User:Bender2k14\|Bender2k14]] ([[User talk:Bender2k14\|talk]]) 12:50, 14 October 2010 (UTC) :Looks good. I advise against introducing the vector representation, it isn't currently used in the article and I doubt it's needed. [[User:Skippydo\|Skippydo]] ([[User talk:Skippydo\|talk]]) 23:48, 20 October 2010 (UTC)

Talk:Deutsch–Jozsa algorithm: Difference between revisions