Lean, informalized

Nielsen & Chuang · Chapter 7, Quantum computers: physical realization · p. 335

Exercise 7.43 - A circuit of three level exchanges turns the thermal deviation of three spins into a logically labeled one

Three gates that relabel the populations of three spins.

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

Three nuclear spins with equal Zeeman energies are in thermal equilibrium at high temperature, as in a nuclear magnetic resonance experiment on a liquid. Their density matrix is close to a multiple of the identity, and what departs from it is diagonal: each spin in |0⟩|0\rangle raises the population of a level and each spin in |1⟩|1\rangle lowers it by the same amount. A pure state would have one level standing above seven equal ones; here the populations take four values.

A circuit of three gates, each exchanging two basis states, rearranges the populations. The exercise is to show that afterwards the first spin labels two subspaces, and in each of them the second and third spins carry, up to sign, the part of the density matrix of the pure state |00⟩|00\rangle that departs from a multiple of the identity. This is logical labeling.

The Deviation Matrix

The basis states of the three spins are ordered |000⟩,|001⟩,…,|111⟩|000\rangle, |001\rangle, \dots, |111\rangle, as the binary numbers 00 to 77. The population pattern DD of the three spins is the diagonal matrix D=diag⁡(6,2,2,−2,2,−2,−2,−6),D = \operatorname{diag}(6,\, 2,\, 2,\, -2,\, 2,\, -2,\, -2,\, -6),(1)✦ whose entry at the basis state |b1b2b3⟩|b_1 b_2 b_3\rangle, with each bib_i equal to 00 or 11, is 2(n0−n1)2(n_0 - n_1), where n0n_0 and n1n_1 are the numbers of spins in |0⟩|0\rangle and in |1⟩|1\rangle. For complex numbers δ\delta and α\alpha, the deviation matrix ρ\rho of the three spins is the operator on their eight dimensional state space ρ=δI+αD,\rho = \delta I + \alpha D,(2)✦ with II the identity.

The relabeled pattern D′D' is the diagonal matrix D′=diag⁡(6,−2,−2,−2,−6,2,2,2)D' = \operatorname{diag}(6,\, -2,\, -2,\, -2,\, -6,\, 2,\, 2,\, 2)(3) in the same basis, and the relabeled deviation matrix ρ′\rho', for the same δ\delta and α\alpha, is ρ′=δI+αD′.\rho' = \delta I + \alpha D'.(4)

The Circuit

Each gate of the circuit exchanges two basis states and fixes the other six. The doubly controlled NOT T01T_{01} flips the first spin when the second and third are in |01⟩|01\rangle: T01=|101⟩⟨001|+|001⟩⟨101|+∑x≠001,101|x⟩⟨x|,T_{01} = |101\rangle\langle 001| + |001\rangle\langle 101| + \sum_{x \neq 001,\, 101} |x\rangle\langle x|,(5) The doubly controlled NOT T10T_{10} on the three spins flips the first spin when the second and third are in |10⟩|10\rangle: T10=|110⟩⟨010|+|010⟩⟨110|+∑x≠010,110|x⟩⟨x|.T_{10} = |110\rangle\langle 010| + |010\rangle\langle 110| + \sum_{x \neq 010,\, 110} |x\rangle\langle x|.(6) The controlled exchange FF acts when the first spin is in |1⟩|1\rangle, and then exchanges |00⟩|00\rangle and |11⟩|11\rangle of the other two: F=|111⟩⟨100|+|100⟩⟨111|+∑x≠100,111|x⟩⟨x|.F = |111\rangle\langle 100| + |100\rangle\langle 111| + \sum_{x \neq 100,\, 111} |x\rangle\langle x|.(7)✦ The logical labeling circuit PP applies T01T_{01}, then T10T_{10}, then FF: P=FT10T01.P = F\, T_{10}\, T_{01}.(8)✦

The Claim

Theorem 1. For any complex numbers δ\delta and α\alpha, the logical labeling circuit PP carries the deviation matrix ρ\rho of the three spins to the relabeled deviation matrix ρ′\rho': PρP†=ρ′.P \rho P^\dagger = \rho'.(9)✦

What Is Checked

The claim is stated over the deviation matrices ρ\rho and ρ′\rho' of (2) and (4), and over the circuit PP of (8). The library proves that PP is unitary, P†P=PP†=I,P^\dagger P = P P^\dagger = I,(10)✦ so that (9) is the evolution of the three spins under the circuit.