The Exercise
Let and be classical linear codes of length , subspaces of , and write for the computational basis state of qubits labelled by the bit string . For a string , the coset state is the pure state of qubits spread uniformly over the coset , (1)✦ For these are the codewords of the Calderbank, Shor and Steane (CSS) code .✦
Fix two bit strings and . Shifting every term by and giving the term of the sign , where , turns the coset state into the twisted coset state (2)✦ and for these are the codewords of a code .✦ The exercise is to show that this code has the same error correcting properties as .
The Register
The register of the code is the group system of qubits: the quantum system whose state space is the space of complex functions on the bit strings , a finite dimensional complex Hilbert space with the orthonormal computational basis , one vector for each string.✦
A state of the register is a positive operator of unit trace on its state space.✦ A pure state of the register is a unit vector in its state space✦, and it determines the state , the projector onto that vector.✦
A unitary of the register is an operator on its state space with , where is the adjoint of .✦ It acts on a state by conjugation, (3)✦ and two unitaries and compose to the product , which applies first.✦
Pauli Strings
For a bit string , the bit flip string is the unitary of the register that adds to each basis string, (4)✦ The phase flip string of a bit string is the unitary diagonal in the computational basis with (5)✦ The Pauli string of and is the unitary (6)
Codes and Correction
The CSS code is the set of states of the register given by the coset states (1) of the strings of , (7)✦ and the twisted CSS code is the set given in the same way by the twisted coset states (2), (8)✦
Let and be maps taking states of the register to states, and let be a set of its states. The recovery corrects the noise on when followed by leaves every state of unchanged, (9)✦
The Claim
Theorem 1. Let and be linear codes of length , let and be bit strings with Pauli string , and let and be maps taking states of the register to states.
If corrects on , then the recovery corrects the noise on , (10)✦
If corrects on , then the recovery corrects the noise on , (11)✦
What Is Checked
The claim is stated over the two codes as sets of states of the register, (7) and (8), for any linear codes and and any strings and ; over the Pauli string of (6) and its adjoint, acting on states by conjugation (3); and over any maps and on the states of the register, with correction in the sense of (9).
The library shows that the factor makes each coset state, plain or twisted, a unit vector: the strings , and likewise , are distinct for distinct , and the signs have modulus one. The phase flip string is a unitary because its diagonal entries have modulus one. The bit flip string permutes an orthonormal basis, so it is an isometry of the state space onto itself, and such an isometry is a unitary✦; is a unitary as a product of unitaries. The adjoint of a unitary is a unitary, and conjugating a state by a unitary gives a state.