Quantum algorithm: Difference between revisions

Content deleted Content added
Line 46:
 
==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 '''F'''<sub>2</sub>{{Clarify|reason=What is this F^2 field?}}. The quantum Fourier transform can be efficiently implemented on a quantum computer using only a polynomial number of [[quantum gate]]s{{citation needed}}.
 
===Deutsch–Jozsa algorithm===