Content deleted Content added
m Remove |class= |
m →Algorithms based on the quantum Fourier transform: put in wikilink to GF(2) for F_2 in order to satisfy request in (now removed) Clarify tag |
||
Line 45:
==Algorithms based on the quantum Fourier transform==
The [[quantum Fourier transform]] is the quantum analogue of the [[discrete Fourier transform]], and is used in several quantum algorithms. The [[Hadamard transform]] is also an example of a quantum Fourier transform over an n-dimensional vector space over the field [[GF(2)|'''F'''<sub>2</sub>]]{{Clarify|reason=What is this F^2 field?|date=February 2018}}. The quantum Fourier transform can be efficiently implemented on a quantum computer using only a polynomial number of [[quantum gate]]s{{citation needed|date=February 2018}}.
===Deutsch–Jozsa algorithm===
| |||