Quantum Fourier transform

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In quantum computing, the quantum Fourier transform (for short: 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 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.[1] This can be compared with the classical discrete Fourier transform, which takes gates (where is the number of bits), which is exponentially more than . However, the quantum Fourier transform acts on a quantum state, whereas the classical Fourier transform acts on a vector, so not every task that uses the classical Fourier transform can take advantage of this exponential speedup.[citation needed]

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

Definition[edit]

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 is a Nth root of unity.

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

with defined as above.

In case that is a basis state, this can also be expressed as the map

Equivalently, the quantum Fourier transform can be viewed as a unitary matrix (or a quantum gate, similar to a boolean logic gate for classical computers) acting on quantum state vectors, where the unitary matrix is given by

Since and is a primitive Nth root of unity, we get, for example, in the case of and phase the transformation matrix

Properties[edit]

Unitarity[edit]

Quantum circuit simulations of a 2-qubit QFT using Q-Kit

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.

Quantum circuit simulations of both possible implementations of a 2-qubit QFT, using and are shown to give the same results using Q-Kit, a graphical quantum circuit simulator. Moreover, starting from the matrix operators for quantum gates, the circuits are built intuitively leading to the QFT matrix.

Circuit implementation[edit]

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

with the -th root of unity.

Quantum circuit for Quantum-Fourier-Transform with n qubits (without rearranging the order of output states). It uses the binary fraction notation introduced below.

All quantum operations must be linear, so it suffices to describe the function on each one of the basis states and let the mixed states be defined by linearity. This is in contrast to how Fourier transforms are usually described. We normally describe Fourier transforms in terms of how the components of the results are calculated on an arbitrary input. This is how you would calculate the path integral or show BQP is in PP. But it is much simpler here (and in many cases) to just explain what happens to a specific arbitrary basis state, and the total result can be found by linearity.

The quantum Fourier transform can be approximately implemented for any N; however, the implementation for the case where N is a power of 2 is much simpler. 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 notation , indicates that qubit is in state , with either 0 or 1. By convention, the basis state index orders the possible states of the qubits lexicographically, i.e., by converting from binary to decimal in this way:

It is also useful to borrow fractional binary notation:

For instance, and

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

or

This can be seen by rewriting the formula for the fourier transform in the binary expansion

As can be seen, the output qubit 1 is in a superposition of state and , and so on for the other qubits (take a second look at the sketch of the circuit above).

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 (ignoring the reverse order of outputs). 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 (n-1) controlled phase gates, the next one requires a Hadamard gate and (n-2) controlled phase gate, and each following term requires one fewer controlled phase gate. Summing up the number of gates gives gates, which is quadratic polynomial in the number of qubits.

Example[edit]

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

It could be simplified further by using , and

and then even more given that , and .

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

or

In case that we use the circuit we obtain the factorization in reverse order, namely

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

QFT for 3 Qubits (without rearranging the order of the output qubits)

Possible implementations of a 3-qubit QFT circuit using Q-Kit

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

Moreover, the following link shows the situation for 1-, 2- and 3-qubit case: Sketch and simulator for 1-, 2- and 3-qubit QFT

Simulations of up to 20-qubit QFTs can be done on Q-Kit, a quantum circuit simulator with a graphical interface. Figure shows 2 different implementations of a 3-qubit QFT are equivalent.

References[edit]

  1. ^ Michael Nielsen and Isaac Chuang (2000). Quantum Computation and Quantum Information. Cambridge: Cambridge University Press. ISBN 0-521-63503-9. OCLC 174527496. 
  2. ^ L. Hales, S. Hallgren, An improved quantum Fourier transform algorithm and applications, Proceedings of the 41st Annual Symposium on Foundations of Computer Science, p. 515, November 12–14, 2000 (pdf)
  • 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 links[edit]