Editing Deutsch–Jozsa algorithm (section)

==History==
The Deutsch–Jozsa algorithm generalizes earlier (1985) work by David Deutsch, which provided a solution for the simple case where <math> n = 1 </math>. 
<br />Specifically, finding out if a given [[Boolean function]] whose input is one bit, <math>f: \{0,1\} \to \{0,1\}</math>, is constant.<ref name="Deu85">
{{cite journal
 |author  = David Deutsch
 |author-link  = David Deutsch
 |title   = Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer
 |journal = Proceedings of the Royal Society of London A
 |volume  = 400
 |issue   = 1818
 |pages   = 97–117
 |year    = 1985
 |bibcode = 1985RSPSA.400...97D
 | doi     = 10.1098/rspa.1985.0070
| citeseerx   = 10.1.1.41.2382
 |s2cid = 1438116
 }}
</ref>

The algorithm, as Deutsch had originally proposed it, was not deterministic. The algorithm was successful with a probability of one half. 
In 1992, Deutsch and Jozsa produced a deterministic algorithm which was generalized to a function which takes <math>n</math> bits for its input. Unlike Deutsch's algorithm, this algorithm required two function evaluations instead of only one.

Further improvements to the Deutsch–Jozsa algorithm were made by Cleve et al.,<ref name="CEMM98" /> resulting in an algorithm that is both deterministic and requires only a single query of <math>f</math>. This algorithm is still referred to as Deutsch–Jozsa algorithm in honour of the groundbreaking techniques they employed.<ref name="CEMM98" />