The Exercise
Alice wants to send Bob the state of a qubit, qubit 0, and the two share a pair of qubits, 1 and 2, in the Bell state , qubit 2 on Bob’s side. Alice applies a controlled NOT gate from qubit 0 to qubit 1 and a Hadamard gate to qubit 0, measures qubits 0 and 1 in the computational basis with outcomes and , and sends Bob the two bits. Bob corrects qubit 2 with Pauli operators chosen by the bits, and qubit 2 then holds the state Alice started with.
The exercise is to verify this with stabilizers: a state is followed through the circuit by the Pauli operators that fix it, where a Pauli operator fixes a vector when . The inputs are eigenstates of the Pauli operators and : the state for or for , which multiplies by , and the state for or , which multiplies by . Write and for and acting on qubit , with the identity on the other qubits.
The library states what Bob’s correction makes of the measured state, for each of the two inputs.
Pauli Operators
The Pauli matrices are the four complex matrices , the identity, and , , , which in the computational basis are (1)✦
A Pauli string on qubits is the operator that acts on each qubit with one Pauli matrix , chosen by an index . Its matrix element between the bit strings and is the product of single qubit entries, (2)✦ The operators and on three qubits and their products, such as and , are Pauli strings.
Bob’s correction for the outcomes and is the operator on the three qubits that applies and then to qubit 2: (3)✦
The Claim
Theorem 1. Let and let be a vector in the state space of three qubits. If and fix , then (4)✦ If and fix , then (5)✦
What Is Checked
The claim is stated over six Pauli strings on three qubits, , , , , and , each built by (2) from the Pauli matrices (1), and over Bob’s correction (3). About these operators the library proves the two parts of the theorem, (4) for the input in the basis and (5) for the input in the basis.