Content deleted Content added
→Grover's algorithm: Fixed grammar Tags: canned edit summary Mobile edit Mobile app edit Android app edit |
→Fourier fishing and Fourier checking: Referencing the description of the Hadamard-Fourier transform @ quantum logic gate |
||
Line 98:
===Fourier fishing and Fourier checking===
We have an [[Oracle machine|oracle]] consisting of n random Boolean functions mapping n-bit strings to a Boolean value. We are required to find n n-bit strings z<sub>1</sub>,..., z<sub>n</sub> such that for [[Quantum logic gate#Measurement on registers with pairwise entangled qubits|the Hadamard-Fourier transform]], at least 3/4 of the strings satisfy
:<math>\left| \tilde{f}\left( z_i \right) \right| \geqslant 1</math>
| |||