Lean, informalized

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

Exercise 10.35 - In a subgroup of the Pauli group that leaves out −I-I, every element squares to the identity and is Hermitian

Elements of a Pauli subgroup without −I-I square to II.

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

Let SS be a subgroup of the Pauli group GnG_n on nn qubits, the group of operators isi^s times a tensor product of I,X,Y,ZI, X, Y, Z with ss an integer modulo 44, defined below, that does not contain −I-I. The exercise asks for two facts about every element gg of SS: it squares to the identity, and it is Hermitian.

The Pauli Group

The Pauli matrices are the four complex 2×22 \times 2 matrices σ0,σ1,σ2,σ3\sigma_0, \sigma_1, \sigma_2, \sigma_3, with σ0=I\sigma_0 = I the identity and σ1=X\sigma_1 = X, σ2=Y\sigma_2 = Y, σ3=Z\sigma_3 = Z, where X=(0110),Y=(0−ii0),Z=(100−1).X = \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix}, \qquad Y = \begin{pmatrix} 0 & -i \\ i & 0 \end{pmatrix}, \qquad Z = \begin{pmatrix} 1 & 0 \\ 0 & -1 \end{pmatrix}.(1)

For a choice a=(a1,…,an)a = (a_1, \dots, a_n) of one index in {0,1,2,3}\{0,1,2,3\} for each of nn qubits, the Pauli string σa1⊗⋯⊗σan\sigma_{a_1} \otimes \cdots \otimes \sigma_{a_n} is the operator on the nn qubits whose matrix, with rows and columns labelled by bit strings x,y∈{0,1}nx, y \in \{0,1\}^n, has the entries (σa1⊗⋯⊗σan)xy=∏k=1n(σak)xkyk.(\sigma_{a_1} \otimes \cdots \otimes \sigma_{a_n})_{xy} = \prod_{k=1}^{n} (\sigma_{a_k})_{x_k y_k}.(2)✦

The phase isi^s of an integer ss modulo 44 is the imaginary unit raised to the representative of ss in {0,1,2,3}\{0,1,2,3\}, one of the four fourth roots of unity 1,i,−1,−i1, i, -1, -i.✦

The Pauli group GnG_n on nn qubits consists of the operators isσa1⊗⋯⊗σani^s \sigma_{a_1} \otimes \cdots \otimes \sigma_{a_n}. An element gg of GnG_n is given by its phase power s∈ℤ4s \in \mathbb{Z}_4 and its Pauli string a∈{0,1,2,3}na \in \{0,1,2,3\}^n, which puts one of I,X,Y,ZI, X, Y, Z on each qubit.✦ The matrix MgM_g of gg is its Pauli string multiplied by its phase, Mg=isσa1⊗⋯⊗σan,M_g = i^s \, \sigma_{a_1} \otimes \cdots \otimes \sigma_{a_n},(3)✦ a complex 2n×2n2^n \times 2^n matrix with rows and columns labelled by {0,1}n\{0,1\}^n.

The element −I-I of GnG_n is the identity string I⊗⋯⊗II \otimes \cdots \otimes I with phase power s=2s = 2, whose matrix is i2I=−Ii^2 I = -I.✦

The Claim

Theorem 1. Let SS be a subgroup of the Pauli group GnG_n on nn qubits that does not contain −I-I, and let gg be an element of SS. Then gg squares to the identity of GnG_n, g2=I,g^2 = I,(4)✦ and its matrix MgM_g is Hermitian, Mg†=Mg.M_g^\dagger = M_g.(5)✦

What Is Checked

The claim is stated over the Pauli group GnG_n for any number nn of qubits and over any subgroup SS of it that leaves out −I-I; its second half is stated over the matrix MgM_g of (3). The library proves of these constructions that the one hypothesis −I∉S-I \notin S suffices: the square in (4) is the square in the group GnG_n itself, and the adjoint in (5) is the conjugate transpose of the complex 2n×2n2^n \times 2^n matrix MgM_g.