Lean, informalized

Nielsen & Chuang · Chapter 5, The quantum Fourier transform and its applications · p. 217

Exercise 5.1 - The quantum Fourier transform on a finite basis, as a unitary matrix

The quantum Fourier transform is a unitary matrix.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Exercise

A quantum system has a state space of dimension NN with orthonormal basis |0⟩,|1⟩,…,|N−1⟩|0\rangle, |1\rangle, \dots, |N-1\rangle. The quantum Fourier transform on this space is the linear map that takes the basis state |j⟩|j\rangle to the superposition 1N∑k=0N−1e2πijk/N|k⟩\tfrac{1}{\sqrt{N}} \sum_{k=0}^{N-1} e^{2\pi i jk/N} |k\rangle of all of them.✦ The exercise is to show that this map is unitary, so that it is an allowed evolution of the system.

The Quantum Fourier Transform

For a positive integer NN, the quantum Fourier transform FNF_N is the N×NN \times N complex matrix, with rows and columns labelled by the integers modulo NN, whose entries are (FN)jk=1Ne2πijk/N.(F_N)_{jk} = \frac{1}{\sqrt{N}}\, e^{2\pi i jk/N} .(1)✦ The map of the exercise has FNF_N as its matrix in the basis |0⟩,…,|N−1⟩|0\rangle, \dots, |N-1\rangle.

The Claim

Theorem 1. For every positive integer NN, the quantum Fourier transform FNF_N is unitary: with FN†F_N^\dagger its conjugate transpose and II the N×NN \times N identity, FN†FN=FNFN†=I.F_N^\dagger F_N = F_N F_N^\dagger = I .(2)✦

What Is Checked

The claim is stated over one construction, the matrix FNF_N of (1), for every dimension N≥1N \ge 1. What the library proves about it is (2): FNF_N belongs to the group of N×NN \times N unitary matrices.✦