Lean, informalized

Nielsen & Chuang · Chapter 10, Quantum error-correction · p. 493

Exercise 10.73 - The logical zero of the Steane code as the one state left unchanged by its six generators and the logical ZZ

Seven operators pin down the Steane logical zero.

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

The Steane code stores one qubit in seven. Its stabilizer is generated by six products of Pauli operators g1,…,g6g_1, \dots, g_6, three built from XX and three from ZZ, and its logical Z‾\bar Z applies ZZ to every qubit. The logical zero |0L⟩|0_L\rangle is an equal superposition of eight computational basis states of the seven qubits. The exercise is to show that the seven operators g1,…,g6,Z‾g_1, \dots, g_6, \bar Z single this state out: it is an eigenstate of each of them with eigenvalue +1+1, and every state of the seven qubits with that property is |0L⟩|0_L\rangle up to a global phase.

A Quantum System

A quantum system SS is a physical system whose state space is a finite dimensional complex Hilbert space.✦ A state ρ\rho of SS is a positive operator of unit trace on the state space of SS.✦ A pure state |ψ⟩|\psi\rangle of SS is a unit vector in the state space of SS, determined physically up to a global phase✦; the state |ψ⟩⟨ψ||\psi\rangle\langle\psi| it determines is the rank one projector onto that vector.✦

A unitary UU of 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.✦ A pure state |ψ⟩|\psi\rangle of SS is an eigenstate of UU with eigenvalue the complex number μ\mu when U|ψ⟩=μ|ψ⟩.U|\psi\rangle = \mu|\psi\rangle .(1)✦

The register of nn qubits is the quantum system with one qubit for each of nn positions.✦ Its state space is the space of complex functions on the bit vectors w∈ℤ2nw \in \mathbb{Z}_2^n✦, and its computational basis {|w⟩}\{|w\rangle\} is the orthonormal basis with one vector |w⟩|w\rangle for each bit vector, the function equal to 11 at ww and to 00 elsewhere. The Pauli operators of a single qubit are XX, which exchanges its two basis states, and ZZ, which changes the sign of the second one. For a bit vector vv, the bit flip string Xv=Xv1⊗⋯⊗XvnX^v = X^{v_1} \otimes \cdots \otimes X^{v_n} is the unitary of the register that flips the qubits where vv has a 11.✦ For a bit vector uu, the phase flip string Zu=Zu1⊗⋯⊗ZunZ^u = Z^{u_1} \otimes \cdots \otimes Z^{u_n} is the unitary of the register that is diagonal in the computational basis.✦ On the basis they act as Xv|w⟩=|w+v⟩,Zu|w⟩=(−1)u⋅w|w⟩,X^v|w\rangle = |w + v\rangle, \qquad Z^u|w\rangle = (-1)^{u \cdot w}|w\rangle,(2) with u⋅wu \cdot w the dot product of uu and ww modulo 22.

The Steane Code

Let HH be the matrix over ℤ2\mathbb{Z}_2 with three rows and seven columns whose jjth column is the binary numeral of jj, most significant bit on top: H=(000111101100111010101).H = \begin{pmatrix} 0&0&0&1&1&1&1 \\ 0&1&1&0&0&1&1 \\ 1&0&1&0&1&0&1 \end{pmatrix}.(3)✦ The Hamming code CC is the linear code of length 77 over ℤ2\mathbb{Z}_2 whose codewords are the words annihilated by HH. The dual Hamming code C2=C⟂C_2 = C^\perp of CC is the linear code of length 77 over ℤ2\mathbb{Z}_2 whose codewords are the words orthogonal to every codeword of CC; C2C_2 has dimension 33 and so eight codewords.

For a binary linear code C2C_2 of length nn and a bit vector x∈ℤ2nx \in \mathbb{Z}_2^n, the coset state |x+C2⟩|x + C_2\rangle is the pure state of the register of nn qubits that superposes with equal amplitudes the basis states |x+y⟩|x + y\rangle, one for each codeword yy of C2C_2: |x+C2⟩=1|C2|∑y∈C2|x+y⟩.|x + C_2\rangle = \frac{1}{\sqrt{|C_2|}} \sum_{y \in C_2} |x + y\rangle .(4)✦ The Steane logical zero |0L⟩|0_L\rangle is the coset state of the dual Hamming code at the zero word, a pure state of seven qubits: |0L⟩=|0+C2⟩=18∑y∈C2|y⟩.|0_L\rangle = |0 + C_2\rangle = \frac{1}{\sqrt 8} \sum_{y \in C_2} |y\rangle .(5)✦

The rows h1,h2,h3h_1, h_2, h_3 of HH give the six stabilizer generators g1,…,g6g_1, \dots, g_6 of the Steane code, unitaries of the seven qubits. The three of XX type are the bit flip strings gi=Xhig_i = X^{h_i}; the three of ZZ type are the phase flip strings gi+3=Zhig_{i+3} = Z^{h_i}, for i=1,2,3i = 1, 2, 3.✦ The logical Z‾=Z1Z2⋯Z7\bar Z = Z_1 Z_2 \cdots Z_7, where ZiZ_i is ZZ acting on the iith qubit, is the phase flip string Z1111111Z^{1111111} on the all ones word.✦ Appended to the six generators, it makes up the list of seven operators (g1,…,g6,Z‾)=(Xh1,Xh2,Xh3,Zh1,Zh2,Zh3,Z1111111).(g_1, \dots, g_6, \bar Z) = (X^{h_1}, X^{h_2}, X^{h_3}, Z^{h_1}, Z^{h_2}, Z^{h_3}, Z^{1111111}).(6)✦

The Claim

Theorem 1. The logical zero is an eigenstate with eigenvalue +1+1 of each of the seven operators (6): gj|0L⟩=|0L⟩(j=1,…,6),Z‾|0L⟩=|0L⟩.g_j |0_L\rangle = |0_L\rangle \quad (j = 1, \dots, 6), \qquad \bar Z |0_L\rangle = |0_L\rangle .(7)✦ Let |ψ⟩|\psi\rangle be a pure state of the seven qubits that is an eigenstate with eigenvalue +1+1 of each of the seven operators (6). Then |ψ⟩⟨ψ|=|0L⟩⟨0L|.|\psi\rangle\langle\psi| = |0_L\rangle\langle 0_L| .(8)✦

What Is Checked

The claim is stated over the register of seven qubits, the seven operators (6) built from the rows of HH, the logical zero (5), the eigenvalue condition (1) and, in its second part, the states |ψ⟩⟨ψ||\psi\rangle\langle\psi| and |0L⟩⟨0L||0_L\rangle\langle 0_L|.

On these constructions the library proves that every coset state (4) has unit norm, so that |0L⟩|0_L\rangle is a pure state, and that the projector onto a unit vector is a density operator, so that |ψ⟩⟨ψ||\psi\rangle\langle\psi| is a state. It proves each bit flip string unitary as a linear isometry of the state space onto itself, and each phase flip string unitary as a diagonal operator whose entries ±1\pm 1 have modulus one.