Mitten code[1]
Description
Member of a family of LP codes \(\mathrm{LP}(A,B)\) with one-by-two base matrices \(A=[a_0~a_1]\) and \(B=[b_0~b_1]\) whose entries are weight-three elements of the group algebra \(\mathbb{F}_2[G]\) of a non-Abelian group \(G\) [1]. The \(G\)-lift of this shape yields five blocks of \(|G|\) data qubits and two blocks each of \(X\)- and \(Z\)-type checks, hence check weight nine and encoding rate at least \(20\%\). A non-Abelian \(G\) evades the distance ceiling of Abelian lifts of the same shape, allowing distances of about \(20\) with a few hundred data qubits.
In the canonical form of the base matrices, \begin{align} A = [\,g_1+g_2+g_3~~e+g_4+g_5\,]~,\qquad B = [\,h_1+h_2+h_3~~e+h_4+h_5\,]~, \tag*{(1)}\end{align} \(e\) is the identity and \(g_i,h_i\) are group elements, and the left regular representation of \(a_1\) and the right regular representation of \(b_1\) are required to be full rank [1]. Each row of the block check matrices spans five column blocks, four similar ones (the fingers) carrying one regular action of \(G\) and a distinguished one (the thumb) carrying the other, whence the name. The full-rank condition guarantees a canonical logical basis related by the group action, which underlies the modular surgery toolkit [1].
Instances include a \([[540,108,18]]\) code over \(C_9 \rtimes C_{12}\) [1]. See Ref. [1; Table I] for eight instances from \([[150,30,10]]\) to \([[975,195,\leq 24]]\) and their lift groups.
Protection
For an Abelian lift group, the minimum-weight codeword of the first base matrix produces a logical operator of that weight [1]. This caps the distance at the weight of the base matrices, hence at six for this shape.Gates
Mitten codes admit a canonical logical basis [1]. Its \(X\)-type and \(Z\)-type logical operators each form a single orbit of the group action on the operator labeled by the identity element. Each logical operator is supported on only two of the five data blocks, and the supports of a conjugate pair intersect in exactly one data qubit. This structure yields a modular logical toolkit based on graph surgery [1]. All Clifford operations follow either from bridging two reusable seed surgery gadgets of tens of qubits each, or from a single fixed extractor [1]. The extractor can measure any logical Pauli product. Many logical measurements can be executed in parallel by parallel surgery [1]. Magic states can be injected into all logical qubits at once, supplying the non-Clifford resource for universal computation [1].Decoding
Telescoping decoder, which sends progressively harder shots through successive BP, Relay-BP, and integer-programming stages [1].Fault Tolerance
Syndrome-extraction schedules found with sQetch are estimated to preserve circuit-level distance for the reported instances other than the \([[150,30,10]]\) code [1]. The best schedule for the \([[150,30,10]]\) code has estimated circuit-level distance eight [1]. Surgery schedules are likewise estimated to preserve distance [1].Threshold
Circuit-level depolarizing noise with no idling noise: effective finite-size threshold of about \(0.7\%\) for the family as a memory [1]. Under the same noise model and without extrapolation, the \([[300,60,14]]\) code attains a block logical error rate of about \(10^{-11}\) per round at \(0.1\%\) physical error rate [1]. At \(0.4\%\), the \([[975,195,\leq 24]]\) code reaches about \(4\times 10^{-8}\), nearly two orders of magnitude below a \([[112320,195,24]]\) stack of rotated surface codes decoded by MWPM [1]. The mitten code uses two orders of magnitude fewer physical qubits than the stack. Decoding \(15\) billion logical surgery operations on the \([[540,108,18]]\) code at \(0.1\%\) yielded two logical failures [1].Primary Hierarchy
References
- [1]
- A. Bhardwaj, M. Ma, N. Meister, R. King, D. Bluvstein, J. Preskill, M. Cain, Q. Xu, and H.-Y. Huang, “High-rate qLDPC processors”, (2026) arXiv:2607.28795
Page edit log
- Victor V. Albert (2026-09-26) — most recent
- Victor V. Albert (2026-08-24)
- Victor V. Albert (2026-08-22)
- Victor V. Albert (2026-08-17)
- Victor V. Albert (2026-08-15)
Cite as:
“Mitten code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/mitten, arXiv:2606.11484