---
title: Smallest Interesting Colour Code
url: https://www.emergentmind.com/topics/smallest-interesting-colour-code
type: topic
---

# Smallest Interesting Colour Code

Searching arXiv for papers explicitly using or defining “Smallest Interesting Colour Code,” plus closely related color-code architecture and verification papers.
The **Smallest Interesting Colour Code** is the \([[8,3,2]]\) colour code: a distance-two quantum error-detecting code on eight physical qubits that encodes three logical qubits and is usually presented on the vertices of a cube. The designation “smallest interesting” is tied to a specific fault-tolerant property rather than to minimal size alone: the code is the smallest member of a class of quasi-transversal codes whose logical three-qubit \(CCZ\) gate is realized transversally by single-qubit non-Clifford gates, while still supporting a nontrivial multi-logical-qubit structure within one block [1706.02717]. In later experimental and architectural work, the same phrase is used for the \([[8,3,2]]\) code because it is small enough for near-term hardware yet already supports a transversal logical \(ccz\), logical permutations implementing Clifford structure, and low-overhead error-detecting protocols [2309.09893].

## 1. Definition and nomenclature

In the literature that uses the phrase explicitly, the Smallest Interesting Colour Code is the **\([[8,3,2]]\) colour code**. The parameters mean that the code uses \(n=8\) physical qubits, encodes \(k=3\) logical qubits, and has distance \(d=2\). Distance \(2\) implies that any single-qubit error is detectable, but not generally correctable, so the code is used as an **error-detecting** code rather than as a fully single-error-correcting code [1706.02717].

The qualifier “interesting” is operational. The code is selected in fault-tolerance settings because it encodes **three logical qubits in one block** and supports a **transversal logical \(ccz\)**. That combination is already sufficient for compact non-Clifford fault-tolerant demonstrations, including one-bit addition on trapped-ion hardware, and for early fault-tolerant architectural proposals that alternate between \([[8,3,2]]\) and \([[4,2,2]]\) colour-code blocks [2309.09893].

This naming convention is not a universal claim about all colour-code formalisms. A plausible implication is that “smallest” is criterion-dependent: in other parts of the colour-code literature, the smallest explicitly identified 3D qudit colour code is the **15-qudit tetrahedral 3D color code**, while the smallest nontrivial triangular planar colour code is the **distance-3, 7-qubit code** [1503.08800], [2108.11395]. The phrase “Smallest Interesting Colour Code,” however, is used specifically for the \([[8,3,2]]\) cube code in the fault-tolerance literature [1706.02717].

## 2. Stabilizer, logical, and geometric structure

Geometrically, the code is presented as a **cube**, with one physical qubit at each vertex. In the experimental presentation, the code has five independent stabilizer generators. One convenient generating set is
\[
S_X = X^{\otimes 8} = X_1X_2X_3X_4X_5X_6X_7X_8,
\]
\[
S_Z = Z^{\otimes 8} = Z_1Z_2Z_3Z_4Z_5Z_6Z_7Z_8,
\]
together with three weight-4 \(Z\)-type generators
\[
Z_1Z_2Z_3Z_4,\qquad Z_1Z_2Z_5Z_6,\qquad Z_1Z_3Z_5Z_7.
\]
Since \(n=8\) and there are five independent stabilizers, the code encodes three logical qubits [2309.09893].

A standard choice of logical Pauli operators is
\[
\overline X_1 = X_1X_2X_3X_4, \qquad \overline Z_1 = Z_1Z_5,
\]
\[
\overline X_2 = X_1X_2X_5X_6, \qquad \overline Z_2 = Z_1Z_3,
\]
\[
\overline X_3 = X_1X_3X_5X_7, \qquad \overline Z_3 = Z_1Z_2.
\]
In the cube picture, the logical \(X\) operators are supported on faces and the logical \(Z\) operators on edges, so the code’s distance-two character is visible directly in the existence of weight-2 logical \(Z\) representatives [2309.09893].

The encoded computational basis is explicitly known. For example,
\[
\ket{000} \mapsto \frac{1}{\sqrt{2}}(\ket{00000000} + \ket{11111111}),
\]
\[
\ket{001} \mapsto \frac{1}{\sqrt{2}}(\ket{10101010} + \ket{01010101}),
\]
and the remaining basis states are likewise GHZ-like superpositions determined by the logical-\(X\) structure [1706.02717]. This basis makes the code space concrete as an 8-dimensional subspace of the 8-qubit Hilbert space.

## 3. Quasi-transversality and logical gate structure

The code’s defining non-Clifford feature is its logical \(CCZ\). In the verification literature, the physical implementation is written as
\[
\mathrm{CCZ}_{1,2,3}^P
=
T \otimes T^{\dagger} \otimes T^{\dagger} \otimes T \otimes T^{\dagger} \otimes T \otimes T \otimes T^{\dagger},
\]
that is, an alternating pattern of \(T\) and \(T^\dagger\) gates on the eight physical qubits. This acts as a logical \(CCZ\) on the encoded code words [1706.02717]. The existence of this transversal non-Clifford gate is the main reason the code is considered “interesting.”

The code also supports nontrivial Clifford structure. In the experimental one-bit-adder implementation, the logical \(cnot\) can be implemented by **permuting or relabelling the physical qubits**. The paper describes the induced logical action as
\[
\overline X_2 \mapsto \overline X_2 \overline X_3,\qquad
\overline Z_3 \mapsto \overline Z_2 \overline Z_3,
\]
with the other logical operators unchanged, i.e. exactly the action of a \(cnot\) between two logical qubits [2309.09893].

The logical Hadamard is more subtle. The set
\[
\{H, ccz\}
\]
is stated to be universal, but the code does **not** support transversal logical \(H\) in the same direct way as it supports transversal \(ccz\). This motivates later architectures in which logical states are teleported between the \([[8,3,2]]\) code and the \([[4,2,2]]\) colour code, using the former for transversal \(CCZ\) and the latter for transversal \(H\) [2309.09893], [2507.20387].

A recurring misconception is to treat the code as a miniature version of a conventional distance-three topological memory. The literature does not do that. Instead, the code is valued because it combines error detection, multiple logical qubits in a single block, and a transversal non-Clifford gate, which is a different optimization point from that of scalable surface-code-like memories [1706.02717].

## 4. Formal verification in the ZX-calculus

A substantial part of the code’s early literature concerns **formal verification** rather than discovery. The code was analyzed in the ZX-calculus and in the theorem prover **Quantomatic**, where the encoder, decoder, logical Paulis, encoded \(CNOT\), and logical \(CCZ\) were verified graphically [1706.02717].

The encoder is constructed by starting from an 8-qubit GHZ state and composing the logical-\(X\) action associated with the three logical input qubits. The decoder is the adjoint of the encoder. One of the basic machine-checked results is
\[
Dec \circ Enc = I_3,
\]
i.e. encoding followed by decoding is the identity on the three logical qubits. In the reported Quantomatic proof, this required **66 rewrite steps** and took approximately **5 seconds** of real time. The encoder was also shown to be a **unitary embedding**, with an automated normalization stage of **28 rewrite steps** taking approximately **2 seconds** [1706.02717].

The logical Pauli operators were verified in strong form, for example
\[
Enc \circ (1 \otimes 1 \otimes X)
=
(X \otimes X \otimes X \otimes X \otimes 1 \otimes 1 \otimes 1 \otimes 1)\circ Enc,
\]
and analogous identities for the other logical \(X\) and \(Z\) operators. The encoded \(CNOT\) was also established in the weak fault-tolerance form
\[
L = Enc^\dagger \circ P \circ Enc,
\]
with the reported proof requiring **75 steps** [1706.02717].

The logical \(CCZ\) is the place where the formal-method limitations are most visible. Rather than proving the full operator identity directly, the verification proceeds by checking the action of the transversal \(T/T^\dagger\) pattern on a basis of code words. The paper reports that each of the eight basis-state cases required roughly **80–90 steps** and that the strategy “did not appear amenable to automation” [1706.02717]. This has become a standard example of the gap between automated rewriting in angle-free ZX fragments and non-Clifford verification in the full multi-qubit Clifford+\(T\) setting.

## 5. Experimental realization and early fault-tolerant architecture

The code was used to implement **fault-tolerant one-bit addition** on the Quantinuum H1-1 quantum computer. The motivation was explicit: “To encode the three logical qubits necessary for one-bit addition and gain access to a transversal \(ccz\), we select the \(8\) colour code.” The implementation reduces the number of error-prone two-qubit gates and measurements to **36**, namely **24 CNOTs** and **12 measurements** [2309.09893].

The experiment uses **error detection with post-selection**, not full active correction. This follows directly from the code distance \(d=2\). The paper states that the protocol is “fault-tolerant with post-selection/error detection,” and reports a moderate post-selection overhead of about **10\%** [2309.09893]. The arithmetic error criterion is
\[
(s = 3) \lor ((s = 2) \land (a = 0)) \lor ((s = 0) \land (a = 1)),
\]
for measured output register values \((a,s)\).

The reported arithmetic error rates on device were
\[
0.95 \pm 0.19\%
\]
for the non-fault-tolerant circuit and
\[
0.11 \pm 0.07\%
\]
for the fault-tolerant circuit. The abstract also summarizes these as approximately
\[
\sim 9.5 \times 10^{-3}
\quad\text{and}\quad
\sim 1.1 \times 10^{-3},
\]
respectively [2309.09893]. The result is therefore not merely formal: on the stated hardware and task, the encoded \([[8,3,2]]\) protocol reduced the arithmetic error rate by about an order of magnitude.

Later work embeds the code in an **early fault-tolerant quantum computing** architecture together with the \([[4,2,2]]\) colour code. In that proposal, state teleportations between the two codes allow use of the respective transversal \(H\) and \(CCZ\) gates, and the relevant optimization target becomes explicit: **minimizing the number of logical quantum teleportation operations, not the number of logical quantum non-Clifford gates** [2507.20387].

| Code | Parameters | Role in the architecture |
|---|---:|---|
| 2D colour code | \([\![4,2,2]\!]\) | Transversal \(H\) |
| 3D colour code | \([\![8,3,2]\!]\) | Transversal \(CCZ\) |

For \(n_c\) computational logical qubits, the same architecture gives the minimum physical-qubit count
\[
n_{p,\min}=8\left\lceil\frac{n_c}{3}\right\rceil+14.
\]
It also gives a fully parallel ancilla strategy with
\[
n_{p,\mathrm{fast}}=18\left\lceil\frac{n_c}{3}\right\rceil+26,
\]
and a middle-ground strategy with
\[
n_{p,\mathrm{mid}}=10\left\lceil\frac{n_c}{3}\right\rceil+18.
\]
These formulas make clear that the Smallest Interesting Colour Code is now used not only as a pedagogical example, but as a concrete primitive in EFTQC resource models [2507.20387].

## 6. Scope, limitations, and broader context

The code’s limitations are intrinsic to its parameters. Because it is a \([[8,3,2]]\) code, it is an **error-detecting** code, not a fully error-correcting one. Experimental protocols based on it therefore rely on **post-selection**, and architectural proposals based on it are explicitly framed as **early fault-tolerant** rather than utility-scale schemes [2309.09893], [2507.20387].

It is also not the only small code called “interesting” in adjacent colour-code research. In planar decoding studies, the smallest nontrivial triangular colour code is the **distance-3 code with \(n=7\) qubits**, while the smallest sizes that already show the full decoding subtleties of the Möbius-strip decoder are around **\(d=7\)** or **\(d=9\)** [2108.11395]. In qudit colour-code work, the smallest explicitly identified 3D example is the **15-qudit tetrahedral 3D color code**, which is the first small instance supporting the paper’s non-Clifford transversal phenomena in that formalism [1503.08800]. This suggests that “smallest interesting” is a context-sensitive label rather than a universal minimization theorem.

The specific historical role of the Smallest Interesting Colour Code is therefore narrower and more precise. It names the \([[8,3,2]]\) cube code because that code is the smallest one in its line of work that already exhibits the combination of features needed for nontrivial fault-tolerant computation: three encoded logical qubits, explicit logical Pauli geometry, a transversal logical \(CCZ\), logical Clifford structure via permutations, and experimentally viable error-detecting protocols [1706.02717], [2309.09893]. Within that scope, it remains a canonical compact platform for studying non-Clifford fault tolerance, graphical verification, and EFTQC architecture.

Source: https://www.emergentmind.com/topics/smallest-interesting-colour-code