Talk:Deutsch–Jozsa algorithm: Difference between revisions

Content deleted Content added
Cewbot (talk | contribs)
m Maintain {{WPBS}}: 3 WikiProject templates. Keep majority rating "C" in {{WPBS}}. Remove 3 same ratings as {{WPBS}} in {{WikiProject Physics}}, {{WikiProject Computer science}}, {{WikiProject Computing}}.
Line 171:
 
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 we should show this alternative description. The two are equivalent, but it can be easier to understand the second. [[User:Jehochman|Jehochman]] <sup>[[User talk:Jehochman|Talk]]</sup> 18:11, 15 October 2022 (UTC)
 
== Shortened Qiskit code example and explanation ==
 
I received feedback on other Qiskit code examples that I recently added, mainly that the code was too long and over-explained. I shortened the code example in this article, and made the explanation more concise. [[User:JavaFXpert|JavaFXpert]] ([[User talk:JavaFXpert|talk]]) 19:48, 18 February 2025 (UTC)