GeezerVison

In quantum error correction, Calderbank–Shor–Steane (CSS) codes, named after their inventors, Robert Calderbank, Peter Shor^[1] and Andrew Steane,^[2] are a special type of stabilizer code constructed from classical linear codes with some special properties. Examples of CSS codes include the Shor code, Steane code, the toric code, and more general surface codes.

Let $C_1$ and $C_2$ be two (classical) $[n,k_1]$ and $[n,k_2]$ linear codes such, that $C_2\subset C_1$ and $C_1,C_2^{\perp }$ both have minimal distance $\ge 2t+1$, where $C_2^{\perp }$ is the dual code to $C_2$. Then define $\text{CSS}(C_1,C_2)$, the CSS code of $C_1$ over $C_2$ as an $[n,k_1-k_2,d]$ code, with $d\ge 2t+1$ as follows:

Define for $x\in C_1:|x+C_2⟩:=\frac{1}{\sqrt{\left|C_2\right|}}\sum _{y\in C_2}|x+y⟩,$ where $+$ is bitwise addition modulo 2. Then $\text{CSS}(C_1,C_2)$ as quantum correcting code $\left[\right[n,k_1-k_2,d\left]\right]$ defined as $\left\{\right|x+C_2⟩\mid x\in C_1\}$.^[3]

In the stabilizer code formalism, all CSS codes have stabilizers composed of tensor products of Pauli matrices such that each stabilizer contains either only Pauli X operations or only Pauli Z operations. The Shor code and the Steane code are examples of this condition. The five-qubit error correcting code is not a CSS code because it mixes X and Z in its stabilizers.^[4]

As with classical linear codes, the limit of how many qubits can be corrected is also given by the Gilbert–Varshamov bound.^[3]

• Nielsen, Michael A.; Chuang, Isaac L. (2010). Quantum Computation and Quantum Information (2nd ed.). Cambridge: Cambridge University Press. ISBN 978-1-107-00217-3. OCLC 844974180.

This quantum mechanics–related article is a stub. You can help Wikipedia by adding missing information.

• v
• t
• e