Lean, informalized

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

Exercise 10.34 - The condition on each generator is necessary, and sufficient once the generators commute and have independent check rows

Which generators keep minus the identity out of a stabilizer.

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 stabilizer on nn qubits is a group SS of Pauli operators given by generators: S=⟨g1,…,gl⟩S = \langle g_1, \dots, g_l \rangle is the group of all products of the gjg_j. The exercise asks to show that −I-I is not an element of SS if and only if every generator satisfies gj2=Ig_j^2 = I and gj≠−Ig_j \neq -I.

The library states one direction for every set of generators, and the other under extra conditions on the generators.

The Pauli Group

The Pauli group GnG_n on nn qubits consists of the operators isP1⊗⋯⊗Pn,s∈ℤ4,P1,…,Pn∈{I,X,Y,Z},i^s\, P_1 \otimes \cdots \otimes P_n, \qquad s \in \mathbb{Z}_4, \quad P_1, \dots, P_n \in \{I, X, Y, Z\},(1)✦ each given by its phase power ss and its Pauli string P1⊗⋯⊗PnP_1 \otimes \cdots \otimes P_n. The element −I-I of GnG_n is the string I⊗⋯⊗II \otimes \cdots \otimes I with phase power s=2s = 2, so that i2I=−Ii^2 I = -I.✦

A Pauli PP on a single qubit has two check bits in ℤ2\mathbb{Z}_2, its XX bit xPx_P, which marks an XX factor, and its ZZ bit zPz_P, which marks a ZZ factor: (xI,zI)=(0,0),(xX,zX)=(1,0),(xY,zY)=(1,1),(xZ,zZ)=(0,1).(x_I, z_I) = (0, 0), \quad (x_X, z_X) = (1, 0), \quad (x_Y, z_Y) = (1, 1), \quad (x_Z, z_Z) = (0, 1).(2)✦ The check row r(g)r(g) of a Pauli string g=P1⊗⋯⊗Png = P_1 \otimes \cdots \otimes P_n is the vector of ℤ22n\mathbb{Z}_2^{2n} formed by its XX part xx and its ZZ part zz, which list the check bits of the Paulis on the nn qubits in turn: r(g)=(x|z),x=(xP1,…,xPn),z=(zP1,…,zPn).r(g) = (x \,|\, z), \qquad x = (x_{P_1}, \dots, x_{P_n}), \quad z = (z_{P_1}, \dots, z_{P_n}).(3)✦ The check row of an element of GnG_n is that of its string, whatever the phase: r(isg)=r(g)r(i^s g) = r(g).✦

The Claim

Theorem 1. Let TT be a set of elements of GnG_n such that −I-I is not in the group ⟨T⟩\langle T \rangle generated by TT. Then g2=Iandg≠−Ifor every g∈T.g^2 = I \quad \text{and} \quad g \neq -I \qquad \text{for every } g \in T.(4)✦

On a single qubit, the operators XX and −X-X square to II, neither is −I-I, and they commute, yet X(−X)=−IX(-X) = -I.

Theorem 2. There is a set TT of elements of the Pauli group G1G_1 on one qubit such that g2=Iandg≠−Ifor every g∈T,−I∈⟨T⟩.g^2 = I \quad \text{and} \quad g \neq -I \quad \text{for every } g \in T, \qquad -I \in \langle T \rangle.(5)✦ There is even one whose elements commute pairwise: gh=hg,g2=Iandg≠−Ifor all g,h∈T,−I∈⟨T⟩.gh = hg, \quad g^2 = I \quad \text{and} \quad g \neq -I \quad \text{for all } g, h \in T, \qquad -I \in \langle T \rangle.(6)✦

The operators XX and −X-X have the same check row (1|0)(1|0). The pair XX and ZZ has the independent check rows (1|0)(1|0) and (0|1)(0|1), but XX and ZZ anticommute, and (XZ)2=−I(XZ)^2 = -I. Commutation and independent check rows together exclude both pairs.

Theorem 3. Let g1,…,glg_1, \dots, g_l be elements of GnG_n that commute pairwise and whose check rows r(g1),…,r(gl)r(g_1), \dots, r(g_l) are linearly independent over ℤ2\mathbb{Z}_2. Then −I∉⟨g1,…,gl⟩⇔gj2=I and gj≠−I for j=1,…,l.-I \notin \langle g_1, \dots, g_l \rangle \iff g_j^2 = I \text{ and } g_j \neq -I \text{ for } j = 1, \dots, l.(7)✦

What Is Checked

The theorems are stated over the Pauli group GnG_n of (1) with its element −I-I, over the group that a set of its elements generates, and, for the equivalence, over the check rows (3) of the generators, built from the check bits (2).