Lean, informalized

Nielsen & Chuang · Chapter 10, Quantum error-correction · p. 452

Exercise 10.27 - Conjugation by a string of Pauli operators carries every recovery between the two codes

Signed and shifted CSS codes correct the same errors.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Exercise

Let C1C_1 and C2C_2 be classical linear codes of length nn, subspaces of ℤ2n\mathbb{Z}_2^n, and write |w⟩|w\rangle for the computational basis state of nn qubits labelled by the bit string ww. For a string x∈ℤ2nx \in \mathbb{Z}_2^n, the coset state |x+C2⟩|x + C_2\rangle is the pure state of nn qubits spread uniformly over the coset x+C2x + C_2, |x+C2⟩=1|C2|∑y∈C2|x+y⟩.|x + C_2\rangle = \frac{1}{\sqrt{|C_2|}} \sum_{y \in C_2} |x + y\rangle .(1)✦ For x∈C1x \in C_1 these are the codewords of the Calderbank, Shor and Steane (CSS) code CSS(C1,C2)\mathrm{CSS}(C_1, C_2).✦

Fix two bit strings uu and vv. Shifting every term by vv and giving the term of yy the sign (−1)u⋅y(-1)^{u \cdot y}, where u⋅y=∑iuiyimod⁡2u \cdot y = \sum_i u_i y_i \bmod 2, turns the coset state into the twisted coset state |x+C2⟩u,v=1|C2|∑y∈C2(−1)u⋅y|x+y+v⟩,|x + C_2\rangle_{u,v} = \frac{1}{\sqrt{|C_2|}} \sum_{y \in C_2} (-1)^{u \cdot y}\, |x + y + v\rangle ,(2)✦ and for x∈C1x \in C_1 these are the codewords of a code CSSu,v(C1,C2)\mathrm{CSS}_{u,v}(C_1, C_2).✦ The exercise is to show that this code has the same error correcting properties as CSS(C1,C2)\mathrm{CSS}(C_1, C_2).

The Register

The register of the code is the group system ℂ[ℤ2n]\mathbb{C}[\mathbb{Z}_2^n] of nn qubits: the quantum system whose state space is the space of complex functions on the bit strings w∈ℤ2nw \in \mathbb{Z}_2^n, a finite dimensional complex Hilbert space with the orthonormal computational basis {|w⟩}\{|w\rangle\}, one vector for each string.✦

A state ρ\rho of the register is a positive operator of unit trace on its state space.✦ A pure state |ψ⟩|\psi\rangle of the register is a unit vector in its state space✦, and it determines the state |ψ⟩⟨ψ||\psi\rangle\langle\psi|, the projector onto that vector.✦

A unitary UU of the register is an operator on its state space with U†U=UU†=1U^\dagger U = U U^\dagger = 1, where U†U^\dagger is the adjoint of UU.✦ It acts on a state ρ\rho by conjugation, ρ↦UρU†,\rho \mapsto U \rho U^\dagger ,(3)✦ and two unitaries UU and VV compose to the product UVUV, which applies VV first.✦

Pauli Strings

For a bit string vv, the bit flip string XvX^v is the unitary of the register that adds vv to each basis string, Xv|w⟩=|w+v⟩.X^v |w\rangle = |w + v\rangle .(4)✦ The phase flip string ZuZ^u of a bit string uu is the unitary diagonal in the computational basis with Zu|w⟩=(−1)u⋅w|w⟩.Z^u |w\rangle = (-1)^{u \cdot w}\, |w\rangle .(5)✦ The Pauli string of uu and vv is the unitary W=ZuXv.W = Z^u X^v .(6)

Codes and Correction

The CSS code CSS(C1,C2)\mathrm{CSS}(C_1, C_2) is the set of states of the register given by the coset states (1) of the strings of C1C_1, CSS(C1,C2)={|x+C2⟩⟨x+C2|:x∈C1},\mathrm{CSS}(C_1, C_2) = \bigl\{\, |x + C_2\rangle\langle x + C_2| \;:\; x \in C_1 \,\bigr\} ,(7)✦ and the twisted CSS code CSSu,v(C1,C2)\mathrm{CSS}_{u,v}(C_1, C_2) is the set given in the same way by the twisted coset states (2), CSSu,v(C1,C2)={|x+C2⟩u,vu,v⟨x+C2|:x∈C1}.\mathrm{CSS}_{u,v}(C_1, C_2) = \bigl\{\, |x + C_2\rangle_{u,v}\,{}_{u,v}\langle x + C_2| \;:\; x \in C_1 \,\bigr\} .(8)✦

Let ℰ\mathcal{E} and ℛ\mathcal{R} be maps taking states of the register to states, and let CC be a set of its states. The recovery ℛ\mathcal{R} corrects the noise ℰ\mathcal{E} on CC when ℰ\mathcal{E} followed by ℛ\mathcal{R} leaves every state of CC unchanged, ℛ(ℰ(ρ))=ρfor every ρ∈C.\mathcal{R}(\mathcal{E}(\rho)) = \rho \quad \text{for every } \rho \in C .(9)✦

The Claim

Theorem 1. Let C1C_1 and C2C_2 be linear codes of length nn, let uu and vv be bit strings with Pauli string W=ZuXvW = Z^u X^v, and let ℰ\mathcal{E} and ℛ\mathcal{R} be maps taking states of the register to states.

If ℛ\mathcal{R} corrects ℰ\mathcal{E} on CSSu,v(C1,C2)\mathrm{CSS}_{u,v}(C_1, C_2), then the recovery ℛ′(σ)=W†ℛ(WσW†)W\mathcal{R}'(\sigma) = W^\dagger \mathcal{R}(W \sigma W^\dagger) W corrects the noise ℰ′(ρ)=W†ℰ(WρW†)W\mathcal{E}'(\rho) = W^\dagger \mathcal{E}(W \rho W^\dagger) W on CSS(C1,C2)\mathrm{CSS}(C_1, C_2), ℛ′(ℰ′(ρ))=ρfor every ρ∈CSS(C1,C2).\mathcal{R}'(\mathcal{E}'(\rho)) = \rho \quad \text{for every } \rho \in \mathrm{CSS}(C_1, C_2) .(10)✦

If ℛ\mathcal{R} corrects ℰ\mathcal{E} on CSS(C1,C2)\mathrm{CSS}(C_1, C_2), then the recovery ℛ″(σ)=Wℛ(W†σW)W†\mathcal{R}''(\sigma) = W \mathcal{R}(W^\dagger \sigma W) W^\dagger corrects the noise ℰ″(ρ)=Wℰ(W†ρW)W†\mathcal{E}''(\rho) = W \mathcal{E}(W^\dagger \rho W) W^\dagger on CSSu,v(C1,C2)\mathrm{CSS}_{u,v}(C_1, C_2), ℛ″(ℰ″(ρ))=ρfor every ρ∈CSSu,v(C1,C2).\mathcal{R}''(\mathcal{E}''(\rho)) = \rho \quad \text{for every } \rho \in \mathrm{CSS}_{u,v}(C_1, C_2) .(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 C1C_1 and C2C_2 and any strings uu and vv; over the Pauli string WW of (6) and its adjoint, acting on states by conjugation (3); and over any maps ℰ\mathcal{E} and ℛ\mathcal{R} on the states of the register, with correction in the sense of (9).

The library shows that the factor 1/|C2|1/\sqrt{|C_2|} makes each coset state, plain or twisted, a unit vector: the strings x+yx + y, and likewise x+y+vx + y + v, are distinct for distinct y∈C2y \in C_2, and the signs (−1)u⋅y(-1)^{u \cdot y} have modulus one. The phase flip string ZuZ^u is a unitary because its diagonal entries ±1\pm 1 have modulus one. The bit flip string XvX^v permutes an orthonormal basis, so it is an isometry of the state space onto itself, and such an isometry is a unitary✦; WW 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.