Lean, informalized

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

Problem 5.6 - Phases between a Fourier transform and its inverse add a constant to the label of a qudit basis state

Adding a constant as a phase in the Fourier basis.

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

Take a system with dd levels and computational basis |0⟩,…,|d−1⟩|0\rangle, \dots, |d-1\rangle, and fix a level yy. Adding yy to the label, |x⟩↦|x+ymod⁡d⟩|x\rangle \mapsto |x + y \bmod d\rangle, permutes the basis states cyclically. The exercise is to show that this shift is carried out by phases e2πiyk/de^{2\pi i yk/d} on the levels kk, placed between a quantum Fourier transform and its inverse.

The Fourier transform turns a shift of the label into a phase.

The Qudit

A quantum system SS is a physical object whose state space is a finite dimensional complex Hilbert space.✦ The qudit with dd levels is the quantum system whose state space is ℂd\mathbb{C}^d with its standard inner product; for d=2nd = 2^n it is a register of nn qubits.✦ A pure state |ψ⟩|\psi\rangle of a quantum system SS is a unit vector in the state space of SS.✦ For a level ii of the qudit, the computational basis state |i⟩|i\rangle is the pure state whose vector is the standard basis vector of ℂd\mathbb{C}^d, with entry 11 at ii and 00 elsewhere.✦

A unitary UU of a quantum system SS, a closed system evolution of SS, is an operator on the state space of SS with U†U=UU†=1U^\dagger U = U U^\dagger = 1.✦ Applied to a pure state |ψ⟩|\psi\rangle of SS, it gives the pure state U|ψ⟩U|\psi\rangle.✦ The adjoint U†U^\dagger of a unitary UU of SS is the unitary of SS given by the Hilbert space adjoint of the operator UU.✦ For two unitaries UU and VV of SS, UU after VV is the unitary UVUV of SS, which applies first VV and then UU.✦

The Fourier Transform

The primitive ddth root of unity is ω=e2πi/d\omega = e^{2\pi i/d}.✦ The quantum Fourier transform matrix in dimension dd is the d×dd \times d complex matrix, with rows and columns labelled 0,…,d−10, \dots, d-1, whose entries are Fkj=ωjkd.F_{kj} = \frac{\omega^{jk}}{\sqrt{d}}.(1)✦ For d≥1d \geq 1, the quantum Fourier transform FF of the qudit with dd levels is the unitary whose matrix in the computational basis is (1).✦ The inverse Fourier transform F−1F^{-1} of the qudit is the adjoint F†F^\dagger of FF.✦

The Circuit

For real angles θ0,…,θd−1\theta_0, \dots, \theta_{d-1}, one for each level of the qudit, the diagonal phase gate DD is the unitary of the qudit that is diagonal in the computational basis, D=diag⁡(eiθ0,…,eiθd−1).D = \operatorname{diag}\bigl(e^{i\theta_0}, \dots, e^{i\theta_{d-1}}\bigr).(2)✦ For a level yy, the Fourier phase layer DyD_y is the gate (2) with angles θk=2πyk/d\theta_k = 2\pi yk/d: Dy=diag⁡(1,ωy,ω2y,…,ω(d−1)y).D_y = \operatorname{diag}\bigl(1, \omega^{y}, \omega^{2y}, \dots, \omega^{(d-1)y}\bigr).(3)✦ For d≥1d \geq 1, the Fourier addition circuit AyA_y is the unitary of the qudit that applies the phase layer between the Fourier transform and its inverse: Ay=F−1DyF.A_y = F^{-1} D_y F.(4)✦

The Claim

Theorem 1. Let d≥1d \geq 1, and let xx and yy be levels of the qudit with dd levels. Then the Fourier addition circuit AyA_y carries the basis state |x⟩|x\rangle to the basis state of the level x+yx + y, the sum taken modulo dd: Ay|x⟩=|x+y⟩.A_y|x\rangle = |x + y\rangle.(5)✦

What Is Checked

The claim (5) is stated over the circuit (4), acting on the computational basis states of the qudit as a unitary acts on pure states.

The library proves that the matrix (1) is unitary, and that the phase gate (2) is unitary because each of its entries has modulus one. The adjoint of a unitary and the composite of two unitaries are again unitaries, and a unitary preserves norms, so Ay|x⟩A_y|x\rangle is a pure state of the qudit.