Lean, informalized

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

Exercise 10.50 - The errors on at most one of five qubits, two dimensions per error, fill the state space exactly

The five qubit code saturates the quantum Hamming bound.

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 five qubit code encodes one qubit in five physical qubits and corrects an arbitrary error on any single one of them.

Take a code that encodes kk qubits in nn and corrects errors on up to tt qubits. The errors to consider are the Pauli errors, tensor products of II, XX, YY and ZZ with at most tt factors other than II; there are (nj)3j\binom{n}{j}3^j of them with exactly jj such factors, since each of the jj qubits carries XX, YY or ZZ. The quantum Hamming bound is ∑j=0t(nj)3j2k≤2n.\sum_{j=0}^{t} \binom{n}{j} 3^j \, 2^k \le 2^n .(1) A code saturates it when the two sides are equal.

Exercise 10.50 asks to show that the five qubit code saturates the bound.✦

Pauli Strings

A Pauli string gg on nn qubits assigns to each qubit ii an index gi∈{0,1,2,3}g_i \in \{0,1,2,3\} and stands for the Pauli error σg1⊗⋯⊗σgn\sigma_{g_1} \otimes \cdots \otimes \sigma_{g_n}, with σ0=I\sigma_0 = I, σ1=X\sigma_1 = X, σ2=Y\sigma_2 = Y and σ3=Z\sigma_3 = Z.

The support of a Pauli string gg on nn qubits is the set of the qubits on which its factor is not the identity, supp⁡g={i:gi≠0},\operatorname{supp} g = \{\, i : g_i \neq 0 \,\},(2)✦ and the number of qubits in it, |supp⁡g||\operatorname{supp} g|, is the weight of gg.

The set 𝒫n,c\mathcal{P}_{n,c} of cc local Pauli strings on nn qubits is the set of Pauli strings on nn qubits of weight at most cc: 𝒫n,c={g:|supp⁡g|≤c}.\mathcal{P}_{n,c} = \{\, g : |\operatorname{supp} g| \le c \,\}.(3)✦

The left side H(n,k,t)H(n,k,t) of the quantum Hamming bound, for a code of kk qubits in nn that corrects errors on up to tt qubits, is the number of Pauli strings of weight at most tt on nn qubits times 2k2^k: H(n,k,t)=|𝒫n,t|2k.H(n,k,t) = |\mathcal{P}_{n,t}| \, 2^k .(4)✦ It is the left side of (1), with the Pauli errors counted as strings rather than by weight.

The Claim

Theorem 1. With n=5n = 5 physical qubits, k=1k = 1 encoded qubit and errors on up to t=1t = 1 qubit, the parameters of the five qubit code, the left side of the quantum Hamming bound equals the dimension of the state space of the five qubits: H(5,1,1)=25.H(5,1,1) = 2^5 .(5)✦

What Is Checked

The claim is stated over the left side HH of (4), the count of the Pauli strings of weight at most tt, the weight of a string being the size of its support (2). What the library proves about these constructions is the equality (5) for the parameters of the five qubit code.