nLab quantum Fourier transform

Context

Quantum systems

quantum logic


quantum physics


quantum probability theoryobservables and states


quantum information


quantum technology


quantum computing

Contents

Idea

The quantum Fourier transform (QFT) is an analog of the discrete Fourier transform, acting on quantum states.

The QFT is a crucial ingredient in several quantum algorithms, notably in Shor's algorithm.

Nominally, the QFT on an n n -dimensional Hilbert space requires only 𝒪(n 2)\mathcal{O}(n^2) quantum gates, as opposed to the 𝒪(n2 n)\mathcal{O}(n 2^n) logic gates for the classical discrete Fourier transform on nn-dimensional vectors. However, this nominal speedup is not practically extractable for computation of Fourier transforms, since classical en- and de-coding of the data for the QFT is impractical: the Fourier transformed vector is in the complex phases of the coefficients of the output quantum state, which are not directly measurable. [Nielsen & Chuang 2000 p 220].

However there are practically accessible quantum algorithms with quantum advantage which rely the QFT as a sub-routine, notably “quantum phase estimation” [NC00 §5.2] (used, in turn, in Shor's algorithm).

References

Textbook account:

See also:

Generalization of the QFT algorithm from qbits to a platform of qdits:

Review of the qdit formulation:

Last revised on February 16, 2025 at 16:37:42. See the history of this page for a list of all contributions to it.