The Exercise
Alice and Bob share Bell pairs . Alice holds the first qubit of each pair and Bob the second, so each of them holds a register of qubits. In the computational basis their joint state is a sum over bit strings, each string in Alice’s register paired with the same string in Bob’s, all with the same amplitude.✦ The exercise is to show that the state keeps this form in a basis built from a binary linear code , whose states superpose the codewords shifted by one bit string, with signs set by another: each such state of Alice’s appears paired with the same state of Bob’s, again with equal amplitudes.
A Register of Qubits
A quantum system is described by its state space, a finite dimensional complex Hilbert space✦, and every such space is the state space of a quantum system.✦ A pure state of is a vector of unit norm in the state space of , determined physically up to a global phase.✦
For a finite group , the group system is the quantum system whose state space is the space of complex functions on with its standard inner product.✦ The bit register of qubits, one for each element of a finite index set, is the group system of the additive group of bit strings.✦ The computational basis of the bit register of qubits is the standard basis of its state space, indexed by the bit strings : is the function on equal to at and to elsewhere.✦
Coset States of a Code
A binary linear code on bits is a subspace of , whose elements are its codewords. The dual code of a binary linear code on bits is the subspace of consisting of the strings with for every codeword of , where modulo .✦
For bit strings , and , the twisted coset state of is the state of the register (1)✦
For bit strings and , the phase coset state of is the twisted coset state of the register with , and .✦ These states are labelled by the pairs of a coset of in and a coset of .✦ With a representative fixed in each coset of and a representative in each coset of , the state of the pair is .✦
The Claim
The pairs live on two copies of the register, the first qubit of every pair in the first copy and the second qubit in the second. The library’s vector of the pairs is unnormalised, (2)✦
Theorem 1. Let be a binary linear code on bits and its phase coset states. In the computational basis of the register, (3)✦ and in the phase coset states of , (4)✦
What Is Checked
The claim is stated over the vector of (2) on two copies of the bit register, expanded in (3) over the register’s computational basis and in (4) over the phase coset states of , labelled by pairs of cosets of and .
The library proves that the computational basis is orthonormal, and that every twisted coset state (1), the phase coset states among them, has unit norm and so is a pure state of the register.