Editing Quantum algorithm (section)

===Fourier fishing and Fourier checking===
Consider an [[Oracle machine|oracle]] consisting of ''n'' random Boolean functions mapping ''n''-bit strings to a Boolean value, with the goal of finding n ''n''-bit strings ''z''<sub>1</sub>,..., ''z<sub>n</sub>'' such that for the Hadamard-Fourier transform, at least 3/4 of the strings satisfy

:<math>| \tilde{f}(z_i)| \geqslant 1</math>

and at least 1/4 satisfy

:<math>| \tilde{f}(z_i) | \geqslant 2.</math>

This can be done in [[BQP|bounded-error quantum polynomial time]] (BQP).<ref>
{{Cite arXiv
 | last = Aaronson | first = S.
 | year = 2009
 | title = BQP and the Polynomial Hierarchy
 | class = quant-ph
 | eprint = 0910.4698
}}</ref>