The Exercise
A stabilizer code on qubits that encodes qubits can have its check matrix brought to standard form. The qubits then fall into three blocks, of , and qubits, and the first generators carry a binary matrix on the last block of their part. From the book reads off the encoded operators , one logical for each encoded qubit, each a tensor product of ’s and identities. The exercise is to show that these operators are independent: none of them can be dropped without shrinking the group they generate.✦
The Encoded Operators
The Pauli group on qubits is the group of operators , with the phase power an integer modulo and each one of , , , . The Pauli string of an element of is the tensor product of its single-qubit factors, with the phase left out.
The pure string of a string of bits is the Pauli string on qubits with on each qubit where and on the others: (1)✦
Fix a binary matrix and a size of the middle block. The support of the th encoded operator, for , is the string of bits made of column of , then zeros, then a single in place of the last block: (2)✦
The encoded operator is the element of with phase factor and Pauli string : (3)✦
The Claim
A family of elements of a group is independent when none of its members is redundant: for every , the subgroup generated by the other members is strictly smaller than the subgroup generated by all of them.✦
Theorem 1. Let , and be natural numbers and a binary matrix. Then the encoded operators of (3) are independent in the Pauli group : for every , (4)✦
What Is Checked
The claim is stated over the Pauli group , of which the encoded operators of (3) are elements, and over independence of a family of group elements as defined above.