TCSLib

10 Quantum Hamming Bound

10.1 Overview

This chapter proves the quantum Hamming bound for non-degenerate qubit stabilizer codes. Working in the Pauli-string formalism, it shows that if a quantum code \(C \le \mathcal{H}_n\) satisfies the Knill–Laflamme conditions for \(t\)-error correction and is non-degenerate, then

\[ \left(\sum _{i=0}^{t}\binom {n}{i}3^i\right)\cdot \dim _{\mathbb {C}}(C) \; \le \; 2^n. \]

10.2 Pauli strings

Definition 10.1 Pauli basis
#

The four Pauli basis elements \(\{ I,X,Y,Z\} \), represented as an inductive type.

Definition 10.2 Pauli string
#

A Pauli string of length \(n\) is a function \(p : \mathrm{Fin}\, n \to \mathrm{PauliBasis}\).

Definition 10.3 Support and weight
#

The support \(\mathrm{supp}(p) \subseteq \mathrm{Fin}\, n\) consists of coordinates where \(p(i) \neq I\); the weight is \(\mathrm{wt}(p) = |\mathrm{supp}(p)|\).

Definition 10.4 Pauli error set
#

The set of all Pauli strings of weight at most \(t\):

\[ \mathcal{E}(n,t) = \bigl\{ p : \mathrm{PauliString}\, n \; \big|\; \mathrm{wt}(p) \le t\bigr\} . \]
Theorem 10.5 Cardinality of the Pauli error set
#
\[ |\mathcal{E}(n,t)| \; =\; \sum _{i=0}^{t}\binom {n}{i}\, 3^i. \]

10.3 \(n\)-qubit Hilbert space

Definition 10.6 \(n\)-qubit Hilbert space
#

The \(n\)-qubit Hilbert space \(\mathcal{H}_n = \ell ^2\! \bigl(\{ 0,1\} ^n,\mathbb {C}\bigr)\), implemented as .

Lemma 10.7 Dimension of \(\mathcal{H}_n\)
#

\(\dim _{\mathbb {C}}(\mathcal{H}_n) = 2^n\).

Definition 10.8 Pauli operator
#

For \(p \in \mathrm{PauliString}\, n\), the associated Pauli operator \(\hat{p} : \mathcal{H}_n \to \mathcal{H}_n\).

10.4 Knill–Laflamme conditions

Definition 10.9 Knill–Laflamme condition
#

A subspace \(C \le \mathcal{H}_n\) satisfies the Knill–Laflamme condition for \(t\)-error correction if for all Pauli strings \(E,F\) with \(\mathrm{wt}(E),\mathrm{wt}(F) \le t\) there exists \(\lambda _{EF}\in \mathbb {C}\) such that \(P_C\, E^\dagger F\, P_C = \lambda _{EF}\, P_C\), where \(P_C\) is the orthogonal projection onto \(C\).

Definition 10.10 Non-degenerate code
#

A code is non-degenerate if it satisfies the Knill–Laflamme condition and additionally \(P_C E^\dagger F P_C = 0\) whenever \(E \neq F\).

10.5 Error sphere and sphere-packing

Definition 10.11 Error sphere
#

The error sphere \(\mathrm{ES}(C,t)\) is the subspace \(\bigvee _{\mathrm{wt}(p)\le t} \hat{p}(C)\), i.e. the supremum of the Pauli images of \(C\) over all \(t\)-errors.

Lemma 10.12 Error subspaces are pairwise orthogonal
#

If \(C\) is non-degenerate and \(E \neq F\) both have weight \(\le t\), then \(\hat{E}(C) \perp \hat{F}(C)\).

Lemma 10.13 Dimension of the error sphere
#

If \(C\) is non-degenerate,

\[ \dim (\mathrm{ES}(C,t)) \; =\; |\mathcal{E}(n,t)|\cdot \dim (C). \]

10.6 Quantum Hamming bound

Theorem 10.14 Quantum Hamming bound
#

If \(C \le \mathcal{H}_n\) is non-degenerate, then

\[ \left(\sum _{i=0}^{t}\binom {n}{i}\, 3^i\right)\cdot \dim _{\mathbb {C}}(C) \; \le \; 2^n. \]