The Exercise
The five qubit code encodes one qubit in five physical qubits and corrects an arbitrary error on any single one of them.
Take a code that encodes qubits in and corrects errors on up to qubits. The errors to consider are the Pauli errors, tensor products of , , and with at most factors other than ; there are of them with exactly such factors, since each of the qubits carries , or . The quantum Hamming bound is (1) A code saturates it when the two sides are equal.
Exercise 10.50 asks to show that the five qubit code saturates the bound.✦
Pauli Strings
A Pauli string on qubits assigns to each qubit an index and stands for the Pauli error , with , , and .
The support of a Pauli string on qubits is the set of the qubits on which its factor is not the identity, (2)✦ and the number of qubits in it, , is the weight of .
The set of local Pauli strings on qubits is the set of Pauli strings on qubits of weight at most : (3)✦
The left side of the quantum Hamming bound, for a code of qubits in that corrects errors on up to qubits, is the number of Pauli strings of weight at most on qubits times : (4)✦ It is the left side of (1), with the Pauli errors counted as strings rather than by weight.
The Claim
Theorem 1. With physical qubits, encoded qubit and errors on up to qubit, the parameters of the five qubit code, the left side of the quantum Hamming bound equals the dimension of the state space of the five qubits: (5)✦
What Is Checked
The claim is stated over the left side of (4), the count of the Pauli strings of weight at most , the weight of a string being the size of its support (2). What the library proves about these constructions is the equality (5) for the parameters of the five qubit code.