Revision as of 22:19, 14 October 2022 edit Jehochman (talk \| contribs) Extended confirmed users, Page movers, Pending changes reviewers, Rollbackers 46,327 edits →Ancilla bit: new section Tag: New topic ← Previous edit		Revision as of 18:11, 15 October 2022 edit undo Jehochman (talk \| contribs) Extended confirmed users, Page movers, Pending changes reviewers, Rollbackers 46,327 edits →Ancilla bit: not quite right Next edit →
Line 170: == Ancilla bit == The circuit diagram shows the use of an ancilla bit and computing y + f(x). This complexity is not necessary. The algorithm can be implemented with n hadamard gates before and after a [[phase oracle]] and then measure all the outputs. I think ifwe itshould ~~were~~show ~~rewritten~~this ~~that~~alternative ~~way~~description. The two are equivalent, ~~the~~but ~~article~~it ~~would~~can be easier to understand ~~in addition to being more~~the ~~accurate~~second. [[User:Jehochman\|Jehochman]] <sup>[[User talk:Jehochman\|Talk]]</sup> 2218:1911, 1415 October 2022 (UTC)

Talk:Deutsch–Jozsa algorithm: Difference between revisions