The Exercise
The Steane code stores one qubit in seven. Its stabilizer is generated by six products of Pauli operators , three built from and three from , and its logical applies to every qubit. The logical zero is an equal superposition of eight computational basis states of the seven qubits. The exercise is to show that the seven operators single this state out: it is an eigenstate of each of them with eigenvalue , and every state of the seven qubits with that property is up to a global phase.
A Quantum System
A quantum system is a physical system whose state space is a finite dimensional complex Hilbert space.✦ A state of is a positive operator of unit trace on the state space of .✦ A pure state of is a unit vector in the state space of , determined physically up to a global phase✦; the state it determines is the rank one projector onto that vector.✦
A unitary of , a closed system evolution of , is an operator on the state space of with .✦ A pure state of is an eigenstate of with eigenvalue the complex number when (1)✦
The register of qubits is the quantum system with one qubit for each of positions.✦ Its state space is the space of complex functions on the bit vectors ✦, and its computational basis is the orthonormal basis with one vector for each bit vector, the function equal to at and to elsewhere. The Pauli operators of a single qubit are , which exchanges its two basis states, and , which changes the sign of the second one. For a bit vector , the bit flip string is the unitary of the register that flips the qubits where has a .✦ For a bit vector , the phase flip string is the unitary of the register that is diagonal in the computational basis.✦ On the basis they act as (2) with the dot product of and modulo .
The Steane Code
Let be the matrix over with three rows and seven columns whose th column is the binary numeral of , most significant bit on top: (3)✦ The Hamming code is the linear code of length over whose codewords are the words annihilated by . The dual Hamming code of is the linear code of length over whose codewords are the words orthogonal to every codeword of ; has dimension and so eight codewords.
For a binary linear code of length and a bit vector , the coset state is the pure state of the register of qubits that superposes with equal amplitudes the basis states , one for each codeword of : (4)✦ The Steane logical zero is the coset state of the dual Hamming code at the zero word, a pure state of seven qubits: (5)✦
The rows of give the six stabilizer generators of the Steane code, unitaries of the seven qubits. The three of type are the bit flip strings ; the three of type are the phase flip strings , for .✦ The logical , where is acting on the th qubit, is the phase flip string on the all ones word.✦ Appended to the six generators, it makes up the list of seven operators (6)✦
The Claim
Theorem 1. The logical zero is an eigenstate with eigenvalue of each of the seven operators (6): (7)✦ Let be a pure state of the seven qubits that is an eigenstate with eigenvalue of each of the seven operators (6). Then (8)✦
What Is Checked
The claim is stated over the register of seven qubits, the seven operators (6) built from the rows of , the logical zero (5), the eigenvalue condition (1) and, in its second part, the states and .
On these constructions the library proves that every coset state (4) has unit norm, so that is a pure state, and that the projector onto a unit vector is a density operator, so that 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 have modulus one.