Lean, informalized

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

Exercise 10.7 - Three qubits, the code projector and noise of at most one bit flip

The bit flip code satisfies the error correction conditions.

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

The three qubit bit flip code stores one qubit in three, in the subspace spanned by |000⟩\lvert 000\rangle and |111⟩\lvert 111\rangle. The noise flips each of the three qubits independently with probability pp, and it is described by four operation elements: one for the event that no qubit flips, and one for each event in which exactly one qubit flips. Exercise 10.7 asks one to verify that this code and this noise satisfy the quantum error correction conditions.

Three Qubits

A quantum system SS is a physical system whose state space is a finite dimensional complex Hilbert space.✦ The composite system S⊗TS \otimes T of two systems SS and TT is the system whose state space is the tensor product of the state spaces of SS and TT.✦ The qubit QQ is the system whose state space is ℂ2\mathbb{C}^2✦, and the three qubit register R=Q⊗(Q⊗Q)R = Q \otimes (Q \otimes Q) is the composite of three qubits, the system that carries the code.✦

A pure state |ψ⟩\lvert\psi\rangle of a system SS is a vector of unit norm in the state space of SS.✦ For pure states |ψ⟩\lvert\psi\rangle of SS and |φ⟩\lvert\varphi\rangle of TT, the product |ψ⟩⊗|φ⟩\lvert\psi\rangle \otimes \lvert\varphi\rangle is the pure state of S⊗TS \otimes T whose vector is the tensor product of the two vectors.✦ The basis states |0⟩\lvert 0\rangle and |1⟩\lvert 1\rangle of the qubit are the pure states whose vectors are the standard basis vectors e0e_0 and e1e_1 of ℂ2\mathbb{C}^2.✦ For bits q1,q2,q3q_1, q_2, q_3 the basis state of the register is their product, |q1q2q3⟩=|q1⟩⊗(|q2⟩⊗|q3⟩),\lvert q_1 q_2 q_3\rangle = \lvert q_1\rangle \otimes \bigl(\lvert q_2\rangle \otimes \lvert q_3\rangle\bigr),(1)✦ and the eight of them form the computational basis of RR.

Bit Flips

An observable AA of a system SS is a self adjoint operator on the state space of SS, A†=AA^\dagger = A.✦ The identity observable II of SS is the identity operator on its state space.✦ For an observable AA of SS and an observable BB of TT, the tensor product A⊗BA \otimes B is the observable of S⊗TS \otimes T whose operator is the tensor product of the operators of AA and BB; it measures AA on the first factor and BB on the second.✦

The Pauli matrices are X=(0110),Y=(0−ii0),Z=(100−1),X = \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix}, \qquad Y = \begin{pmatrix} 0 & -i \\ i & 0 \end{pmatrix}, \qquad Z = \begin{pmatrix} 1 & 0 \\ 0 & -1 \end{pmatrix},(2)✦ and, writing σ→=(X,Y,Z)\vec{\sigma} = (X, Y, Z) for the Pauli vector, for a real vector n→=(nx,ny,nz)\vec{n} = (n_x, n_y, n_z) in three dimensions the Pauli observable n→⋅σ→=nxX+nyY+nzZ\vec{n} \cdot \vec{\sigma} = n_x X + n_y Y + n_z Z is the observable of the qubit with that matrix as its operator. The bit flip XX is the Pauli observable along nˆ=(1,0,0)\hat{n} = (1, 0, 0).✦ On the register, the flip of qubit jj acts as XX on that qubit and as the identity on the other two: X1=X⊗(I⊗I),X2=I⊗(X⊗I),X3=I⊗(I⊗X).X_1 = X \otimes (I \otimes I), \qquad X_2 = I \otimes (X \otimes I), \qquad X_3 = I \otimes (I \otimes X).(3)✦

The Code and the Noise

The three qubit bit flip code has four syndromes, one for no flip and one for a flip of each qubit, labelled by i∈{0,1,2,3}i \in \{0, 1, 2, 3\}, and each carries a pair (ai,bi)(a_i, b_i) of three bit strings: (000,111)(000, 111) for 00, the two codewords, and (100,011)(100, 011), (010,101)(010, 101) and (001,110)(001, 110) for 11, 22 and 33, the codewords with bit ii flipped.✦ For a label ii, the syndrome projector PiP_i is the operator on the state space of RR that is the sum of the projectors onto the basis states (1) of its pair, Pi=|ai⟩⟨ai|+|bi⟩⟨bi|.P_i = \lvert a_i\rangle\langle a_i\rvert + \lvert b_i\rangle\langle b_i\rvert.(4)✦ The code projector P0P_0 of the three qubit bit flip code is the projector onto its code space.

The noise is built from the error operators on the state space of RR, T0=I,Tj=Xj(j=1,2,3),T_0 = I, \qquad T_j = X_j \quad (j = 1, 2, 3),(5)✦ and from the coefficients c0=(1−p)3,c1=c2=c3=p(1−p)2.c_0 = \sqrt{(1-p)^3}, \qquad c_1 = c_2 = c_3 = \sqrt{p(1-p)^2}.(6)✦ For 0≤p≤10 \le p \le 1, c02c_0^2 is the probability that no qubit flips and cj2c_j^2 the probability that qubit jj flips while the other two do not. The noise elements EiE_i of the three qubit bit flip noise are the operators on the state space of RR obtained by weighting the error operators with these coefficients, Ei=ciTi,i=0,1,2,3.E_i = c_i\, T_i, \qquad i = 0, 1, 2, 3.(7)✦

The Claim

An operator PP on the state space of a system and a family of operators EiE_i on the same space satisfy the quantum error correction conditions when there is a Hermitian complex matrix α\alpha, indexed by the labels of the family, with PEi†EjP=αijPP E_i^\dagger E_j P = \alpha_{ij} P for all labels ii and jj.✦

Theorem 1. Let 0≤p≤10 \le p \le 1. The code projector P0P_0 of the three qubit bit flip code and the noise elements E0,…,E3E_0, \dots, E_3 satisfy the quantum error correction conditions, with a Hermitian 4×44 \times 4 complex matrix α\alpha such that P0Ei†EjP0=αijP0,i,j=0,1,2,3.P_0 E_i^\dagger E_j P_0 = \alpha_{ij} P_0, \qquad i, j = 0, 1, 2, 3.(8)✦

What Is Checked

The claim is stated over the code projector P0P_0 of (4) and the noise elements of (7). About these constructions the library proves that each flip XjX_j of (3) is an observable, self adjoint as a tensor product of self adjoint operators, the bit flip XX being self adjoint because its matrix is Hermitian; and that each basis state |q1q2q3⟩\lvert q_1 q_2 q_3\rangle of (1) has unit norm, the norm of a product vector being the product of the norms.