Quantum Fourier transform

In quantum computing, the quantum Fourier transform (QFT) is a linear transformation on quantum bits, and is the quantum analogue of the discrete Fourier transform. The quantum Fourier transform is a part of many quantum algorithms, notably Shor's algorithm for factoring and computing the discrete logarithm, the quantum phase estimation algorithm for estimating the eigenvalues of a unitary operator, and algorithms for the hidden subgroup problem. The quantum Fourier transform was discovered by Don Coppersmith.[1]

The quantum Fourier transform can be performed efficiently on a quantum computer, with a particular decomposition into a product of simpler unitary matrices. Using a simple decomposition, the discrete Fourier transform on amplitudes can be implemented as a quantum circuit consisting of only Hadamard gates and controlled phase shift gates, where is the number of qubits.[2] This can be compared with the classical discrete Fourier transform, which takes gates (where is the number of bits), which is exponentially more than .

The quantum Fourier transform acts on a quantum state vector (a quantum register), and the classical Fourier transform acts on a vector. Both types of vectors can be written as lists of complex numbers, in the quantum case it is a sequence of probability amplitudes for the different outcomes upon measurement. Because measurement collapses the quantum state to a single value (called basis state, or eigenstate), not every task that uses the classical Fourier transform can take advantage of the quantum Fourier transform's exponential speedup.

The best quantum Fourier transform algorithms known (as of late 2000) require only gates to achieve an efficient approximation.[3]


The quantum Fourier transform is the classical discrete Fourier transform applied to the vector of amplitudes of a quantum state, where we usually consider vectors of length  .

The classical Fourier transform acts on a vector   and maps it to the vector   according to the formula:


where   and   is an N-th root of unity.

Similarly, the quantum Fourier transform acts on a quantum state   and maps it to a quantum state   according to the formula:


(Conventions for the sign of the phase factor exponent vary; here we use the convention that the quantum Fourier transform has the same effect as the inverse discrete Fourier transform, and vice versa.)

Since   is a rotation, the inverse quantum Fourier transform acts similarly but with:


In case that   is a basis state, the quantum Fourier Transform can also be expressed as the map


Equivalently, the quantum Fourier transform can be viewed as a unitary matrix (or quantum gate) acting on quantum state vectors, where the unitary matrix   is given by


where  . We get, for example, in the case of   and phase   the transformation matrix




Most of the properties of the quantum Fourier transform follow from the fact that it is a unitary transformation. This can be checked by performing matrix multiplication and ensuring that the relation   holds, where   is the Hermitian adjoint of  . Alternately, one can check that orthogonal vectors of norm 1 get mapped to orthogonal vectors of norm 1.

From the unitary property it follows that the inverse of the quantum Fourier transform is the Hermitian adjoint of the Fourier matrix, thus  . Since there is an efficient quantum circuit implementing the quantum Fourier transform, the circuit can be run in reverse to perform the inverse quantum Fourier transform. Thus both transforms can be efficiently performed on a quantum computer.

Circuit implementationEdit

The quantum gates used in the circuit are the Hadamard gate and the phase gate  , here in terms of


with   the primitive  -th root of unity. The circuit is composed of   gates and the controlled version of  


As already stated, we assume  . We have the orthonormal basis consisting of the vectors


The basis states enumerate all the possible states of the qubits:


where, with tensor product (or Kronecker product) notation  ,   indicates that qubit   is in state  , with   either 0 or 1. By convention, the basis state index   is the binary number encoded by the  , with   the most significant bit. With this convention, we may write the quantum Fourier transform as:


It is also useful to borrow fractional binary notation:


With this notation, the action of the quantum Fourier transform can be expressed in a compact manner:


To obtain this state from the circuit depicted above, a swap operation of the qubits must be performed to reverse their order. At most   swaps are required.[2]

In other words, the discrete Fourier transform, an operation on n qubits, can be factored into the tensor product of n single-qubit operations, suggesting it is easily represented as a quantum circuit (up to an order reversal of the output). In fact, each of those single-qubit operations can be implemented efficiently using a Hadamard gate and controlled phase gates. The first term requires one Hadamard gate and   controlled phase gates, the next one requires a Hadamard gate and   controlled phase gate, and each following term requires one fewer controlled phase gate. Summing up the number of gates, excluding the ones needed for the output reversal, gives   gates, which is quadratic polynomial in the number of qubits.


Consider the quantum Fourier transform on 3 qubits. It is the following transformation:


where   is a primitive eighth root of unity satisfying   (since  ).

For short, setting  , the matrix representation of this transformation on 3 qubits is:


The 3-qubit quantum Fourier transform can be rewritten as:


In the following sketch, we have the respective circuit for   (with reversed order of output qubits with respect to the proper QFT):


As calculated above, the number of gates used is   which is equal to  , for  .

Relation to quantum Hadamard transformEdit

Using the generalized Fourier transform on finite (abelian) groups, there are actually two natural ways to define a quantum Fourier transform on an n-qubit quantum register. The QFT as defined above is equivalent to the DFT, which considers these n qubits as indexed by the cyclic group  . However, it also makes sense to consider the qubits as indexed by the Boolean group  , and in this case the Fourier transform is the Hadamard transform. This is achieved by applying a Hadamard gate to each of the n qubits in parallel.[4][5] Note that Shor's algorithm uses both types of Fourier transforms, both an initial Hadamard transform as well as a QFT.


  1. ^ Coppersmith, D. (1994). "An approximate Fourier transform useful in quantum factoring". Technical Report RC19642, IBM.
  2. ^ a b Michael Nielsen and Isaac Chuang (2000). Quantum Computation and Quantum Information. Cambridge: Cambridge University Press. ISBN 0-521-63503-9. OCLC 174527496.
  3. ^ Hales, L.; Hallgren, S. (November 12–14, 2000). "An improved quantum Fourier transform algorithm and applications". Proceedings 41st Annual Symposium on Foundations of Computer Science: 515–525. CiteSeerX doi:10.1109/SFCS.2000.892139. ISBN 0-7695-0850-2. S2CID 424297.
  4. ^ Fourier Analysis of Boolean Maps– A Tutorial –, pp. 12-13
  5. ^ Lecture 5: Basic quantum algorithms, Rajat Mittal, pp. 4-5
  • K. R. Parthasarathy, Lectures on Quantum Computation and Quantum Error Correcting Codes (Indian Statistical Institute, Delhi Center, June 2001)
  • John Preskill, Lecture Notes for Physics 229: Quantum Information and Computation (CIT, September 1998)

External linksEdit