Math 2.0

Quantum theory Definition

Quantum Fourier transform

Builds on Discrete Fourier transformUnitary operatorOrthonormal basisQuantum logic gate

Definition

Let N≥2N \ge 2 and let ℂN\C^N have the orthonormal basis ∣0⟩,…,∣N−1⟩\lvert 0 \rangle, \dots, \lvert N-1 \rangle. Let ω=e2πi/N\omega = e^{2\pi i/N}. The quantum Fourier transform on ℂN\C^N is the linear operator FNF_N with FN∣x⟩=1N∑y=0N−1ωxy∣y⟩for x=0,…,N−1.F_N \lvert x \rangle = \frac{1}{\sqrt N} \sum_{y=0}^{N-1} \omega^{xy} \lvert y \rangle \quad \text{for } x = 0, \dots, N-1. When N=2nN = 2^n, the space ℂN\C^N is the space of nn qubits and xx is read in binary. Then FNF_N is called the quantum Fourier transform on nn qubits.

Remarks

FNF_N is unitary: the inner product of two columns is 1N∑yω(x′−x)y\frac1N \sum_y \omega^{(x' - x)y}, which is 11 if x=x′x = x' and 00 otherwise. On amplitudes, FNF_N maps ∑xax∣x⟩\sum_x a_x \lvert x \rangle to ∑yby∣y⟩\sum_y b_y \lvert y \rangle with by=N−1/2∑xωxyaxb_y = N^{-1/2} \sum_x \omega^{xy} a_x, a normalised discrete Fourier transform with the sign convention e+2πi/Ne^{+2\pi i/N}.

Example: for N=2N = 2, ω=−1\omega = -1 and F2=12(111−1)F_2 = \frac{1}{\sqrt2}\begin{pmatrix} 1 & 1 \\ 1 & -1 \end{pmatrix}, the Hadamard gate.

Non-example: the map ∣x⟩↦∑yωxy∣y⟩\lvert x \rangle \mapsto \sum_y \omega^{xy} \lvert y \rangle without the factor N−1/2N^{-1/2} is not unitary, since it sends the unit vector ∣0⟩\lvert 0 \rangle to a vector of norm N\sqrt N.

For N=2nN = 2^n, writing x=x1⋯xnx = x_1 \cdots x_n in binary, FN∣x⟩F_N \lvert x \rangle is the product state ⨂k=1n12(∣0⟩+e2πi x/2k∣1⟩)\bigotimes_{k=1}^{n} \frac{1}{\sqrt2}\left(\lvert 0 \rangle + e^{2\pi i\, x / 2^k} \lvert 1 \rangle\right). This product form gives a circuit of nn Hadamard gates, n(n−1)/2n(n-1)/2 controlled phase gates and a reversal of the order of the qubits.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Discrete Fourier transform concept
  2. Orthonormal basis concept
  3. Quantum logic gate concept
  4. Unitary operator concept
  5. Quantum Fourier transform definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Quantum_Fourier_transform
About this page
TagA43W22Z2GY
URIm2://A43W22Z2GY
Kinddefinition
WritingW0 stub
MSC81P68, 68Q12, 65T50
DefinesQuantum Fourier transform
UsesDiscrete Fourier transform, Unitary operator, Orthonormal basis, Quantum logic gate
Changed3 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.