Tricycle Codes: Classical & Quantum

• Tricycle codes are coding constructions featuring a three-part cyclic invariant structure, realized in both classical Z2 triple cyclic codes and quantum CSS qLDPC designs.
• In the classical setting, they are modeled as Z2[x]-submodules with blockwise cyclic shifts, clear generator sequences, and duality relations that ensure separability and error-bound properties.
• In the quantum arena, tricycle codes extend bicycle constructions into three-factor products, enabling transversal CCZ gates, single-shot decoding, and efficient fault-tolerant operations.

Searching arXiv for papers on tricycle codes, including both classical triple cyclic codes and recent quantum qLDPC tricycle code work. “Tricycle codes” is used in two distinct coding-theoretic senses in the arXiv literature. In classical algebraic coding theory, the term appears as a synonym for triple cyclic codes over $\mathbb{Z}_2$, namely binary linear codes of block length $(r,s,t)$ whose coordinates are partitioned into three parts and are invariant under cyclic shifts within those parts (Mostafanasab, 2015, Srinivasulu, 2016). In recent quantum error-correction literature, “tricycle codes” denotes several families of CSS quantum LDPC codes that extend bicycle-type constructions to three homological dimensions or three-factor algebraic products, with applications to transversal $CCZ$, magic-state generation, and single-shot decoding (Menon et al., 14 Aug 2025, Jacob et al., 11 Aug 2025). The common thread is a three-part algebraic structure, but the underlying objects, parameters, and intended applications differ substantially.

1. Classical triple cyclic codes over $\mathbb{Z}_2$

A triple cyclic code of length $(r,s,t)$ over $\mathbb{Z}_2$ is a binary linear code of length $r+s+t$ such that the set of coordinates can be partitioned into three parts and any cyclic shift of the coordinates of the parts leaves invariant the code (Mostafanasab, 2015). Equivalently, for a codeword

$$c=(c_{1,0},\ldots,c_{1,r-1}\mid c_{2,0},\ldots,c_{2,s-1}\mid c_{3,0},\ldots,c_{3,t-1}),$$

the blockwise cyclic shift

$$T(c)=(c_{1,r-1},c_{1,0},\ldots,c_{1,r-2}\mid c_{2,s-1},c_{2,0},\ldots,c_{2,s-2}\mid c_{3,t-1},c_{3,0},\ldots,c_{3,t-2})$$

is again in the code (Mostafanasab, 2015). The closely related paper “Z2-Triple cyclic codes and their duals” defines a $\mathbb{Z}_2$-triple cyclic code of block length $(r,s,t)$0 as a binary code of length $(r,s,t)$1 such that the code is partitioned into three parts of lengths $(r,s,t)$2 and $(r,s,t)$3 such that each of the three parts is invariant under the cyclic shifts of the coordinates (Srinivasulu, 2016).

These codes are modeled as $(r,s,t)$4-submodules of

$(r,s,t)$5

with external multiplication

$(r,s,t)$6

for $(r,s,t)$7 (Mostafanasab, 2015). This polynomial-module representation is the basic algebraic device for expressing generators, block projections, and duality. The terminology “tricycle code” in this classical setting therefore refers to a three-block cyclic invariance condition rather than to any quantum or homological construction.

2. Generator structure, minimal generating sets, and separability

For triple cyclic codes over $(r,s,t)$8, one structural description is

$(r,s,t)$9

with $CCZ$0, $CCZ$1, and $CCZ$2 (Mostafanasab, 2015). A closely related form given for $CCZ$3-triple cyclic codes is

$CCZ$4

where $CCZ$5, $CCZ$6, and $CCZ$7 (Srinivasulu, 2016). Both descriptions express the code as a finitely generated $CCZ$8-submodule, and both encode inter-block coupling through nonzero off-diagonal polynomial components.

A minimal generating set over $CCZ$9 is obtained by taking appropriate shifts of the module generators. In the formulation of (Mostafanasab, 2015),

$\mathbb{Z}_2$0

$\mathbb{Z}_2$1

$\mathbb{Z}_2$2

and

$\mathbb{Z}_2$3

The same source states that

$\mathbb{Z}_2$4

The notion of separability isolates the case in which the three blocks decouple. A triple cyclic code is called separable if

$\mathbb{Z}_2$5

where $\mathbb{Z}_2$6 are individual cyclic codes for each block (Mostafanasab, 2015). This is equivalent to the conditions $\mathbb{Z}_2$7 and $\mathbb{Z}_2$8, in which case the generator $\mathbb{Z}_2$9 can be replaced by $(r,s,t)$0 (Mostafanasab, 2015). The companion discussion in (Srinivasulu, 2016) states that a triple cyclic code is the direct sum of three cyclic codes if all $(r,s,t)$1, whereas nonzero interconnection polynomials induce dependencies between the blocks. This suggests that separability is the decisive algebraic distinction between purely blockwise cyclic structure and genuinely coupled three-block codes.

3. Projections, distance bounds, and duality in the classical setting

The block projections of a triple cyclic code are themselves cyclic codes. Specifically,

$(r,s,t)$2

with sizes determined by the degrees of these generator polynomials (Mostafanasab, 2015). The same source gives the minimum-distance inequality

$(r,s,t)$3

and states that equality holds if the code is separable.

Duality preserves the triple cyclic structure. The dual $(r,s,t)$4 of a triple cyclic code is again a triple cyclic code of the same block structure (Mostafanasab, 2015). A bilinear form is introduced on $(r,s,t)$5: $(r,s,t)$6 where $(r,s,t)$7 and $(r,s,t)$8 denotes reciprocal polynomial (Mostafanasab, 2015). Then

$(r,s,t)$9

Explicit relations between code generators and dual generators are also given. For example,

$\mathbb{Z}_2$0

and

$\mathbb{Z}_2$1

where

$\mathbb{Z}_2$2

(Mostafanasab, 2015). The paper (Srinivasulu, 2016) likewise states that dual generators are derived from parity-check polynomials, in analogy with the dual of an ordinary cyclic code. In the classical literature, then, “tricycle” primarily denotes a structured generalization of cyclic and double cyclic codes, organized by module-theoretic generators, reciprocal polynomials, and gcd relations.

4. Quantum tricycle codes as finite-blocklength qLDPC constructions

In quantum error correction, “tricycle codes” refers to CSS quantum LDPC codes obtained by extending bicycle-type constructions to three homological dimensions or to three-factor balanced products. “Magic tricycles: efficient magic state generation with finite block-length quantum LDPC codes” introduces tricycle codes as a class of finite block-length quantum LDPC codes generalizing bicycle codes to three homological dimensions (Menon et al., 14 Aug 2025). In that work, the codes are defined using three group-algebra elements $\mathbb{Z}_2$3 from a group algebra $\mathbb{Z}_2$4, with parity-check matrices

$\mathbb{Z}_2$5

$\mathbb{Z}_2$6

acting on $\mathbb{Z}_2$7 qubits grouped into three blocks or sectors (Menon et al., 14 Aug 2025).

A related but distinct family is the trivariate tricycle (TT) code family, introduced as CSS codes based on a length-3 chain complex and defined from three trivariate polynomials (Jacob et al., 11 Aug 2025). In that formulation,

$\mathbb{Z}_2$8

and the CSS check matrices are

$\mathbb{Z}_2$9

with meta-checks

$r+s+t$0

(Jacob et al., 11 Aug 2025). The 3D toric code belongs to this construction via the choice $r+s+t$1, $r+s+t$2, $r+s+t$3 (Jacob et al., 11 Aug 2025).

The more general perspective of “Multivariate Multicycle Codes for Complete Single-Shot Decoding” places tricycle or TT codes at $r+s+t$4 within a Koszul-complex framework. Over

$r+s+t$5

the length-3 Koszul complex yields explicit boundary maps

$r+s+t$6

with TT codes supporting only $r+s+t$7-metachecks, hence only partial single-shot decoding (Mian et al., 26 Jan 2026). A plausible implication is that current quantum usage reserves “tricycle” for three-factor CSS/qLDPC constructions, while different papers emphasize either balanced-product language, chain-complex language, or group-algebra language.

5. Fault-tolerant gates, single-shot features, and decoding

A major motivation for quantum tricycle codes is the coexistence of LDPC structure with logical non-Clifford gates. The finite-blocklength tricycle codes of (Menon et al., 14 Aug 2025) support constant-depth physical circuits that implement logical $r+s+t$8 gates between three code blocks. For the standard $r+s+t$9 codes, a depth-18 circuit is always possible, and by imposing further constraints, depths as low as $$c=(c_{1,0},\ldots,c_{1,r-1}\mid c_{2,0},\ldots,c_{2,s-1}\mid c_{3,0},\ldots,c_{3,t-1}),$$0 are attainable at some cost in code rate and/or distance (Menon et al., 14 Aug 2025). The same paper states that tricycle codes are single-shot in the $$c=(c_{1,0},\ldots,c_{1,r-1}\mid c_{2,0},\ldots,c_{2,s-1}\mid c_{3,0},\ldots,c_{3,t-1}),$$1 basis, with meta-checks

$$c=(c_{1,0},\ldots,c_{1,r-1}\mid c_{2,0},\ldots,c_{2,s-1}\mid c_{3,0},\ldots,c_{3,t-1}),$$2

enabling single-shot state preparation and error correction in constant depth (Menon et al., 14 Aug 2025).

The TT-code paper presents a different but related set of fault-tolerant features. It states that TT codes combine partial single-shot decodability, a large set of transversal Clifford gates and automorphisms within and between code blocks, and, for several sub-constructions, constant-depth implementations of a non-Clifford $$c=(c_{1,0},\ldots,c_{1,r-1}\mid c_{2,0},\ldots,c_{2,s-1}\mid c_{3,0},\ldots,c_{3,t-1}),$$3 gate (Jacob et al., 11 Aug 2025). All TT codes possess several transversal $$c=(c_{1,0},\ldots,c_{1,r-1}\mid c_{2,0},\ldots,c_{2,s-1}\mid c_{3,0},\ldots,c_{3,t-1}),$$4 gates that can partially address logical qubits between two code blocks, and shift automorphisms induced by monomial translations can implement Clifford gates within a code block (Jacob et al., 11 Aug 2025). For codes where $$c=(c_{1,0},\ldots,c_{1,r-1}\mid c_{2,0},\ldots,c_{2,s-1}\mid c_{3,0},\ldots,c_{3,t-1}),$$5 are all weight-2, or more generally for polynomials admitting a cup-product structure, a depth-2 circuit of physical $$c=(c_{1,0},\ldots,c_{1,r-1}\mid c_{2,0},\ldots,c_{2,s-1}\mid c_{3,0},\ldots,c_{3,t-1}),$$6 gates on triples of qubits within each cube can implement logical $$c=(c_{1,0},\ldots,c_{1,r-1}\mid c_{2,0},\ldots,c_{2,s-1}\mid c_{3,0},\ldots,c_{3,t-1}),$$7 gates between code blocks (Jacob et al., 11 Aug 2025).

The paper “Transversal dimension jump for product qLDPC codes” uses “bivariate tricycle codes” for small 3D qLDPC examples embedded in a broader lifted-product framework (Li et al., 8 Oct 2025). It identifies explicit 3D–2D code pairs, including the $$c=(c_{1,0},\ldots,c_{1,r-1}\mid c_{2,0},\ldots,c_{2,s-1}\mid c_{3,0},\ldots,c_{3,t-1}),$$8–$$c=(c_{1,0},\ldots,c_{1,r-1}\mid c_{2,0},\ldots,c_{2,s-1}\mid c_{3,0},\ldots,c_{3,t-1}),$$9 pair, where the 3D tricycle codes admit depth-2 $$T(c)=(c_{1,r-1},c_{1,0},\ldots,c_{1,r-2}\mid c_{2,s-1},c_{2,0},\ldots,c_{2,s-2}\mid c_{3,t-1},c_{3,0},\ldots,c_{3,t-2})$$0, weight-6 stabilizers, and pseudo-thresholds $$T(c)=(c_{1,r-1},c_{1,0},\ldots,c_{1,r-2}\mid c_{2,s-1},c_{2,0},\ldots,c_{2,s-2}\mid c_{3,t-1},c_{3,0},\ldots,c_{3,t-2})$$1 (Li et al., 8 Oct 2025). That work also describes a code-switching protocol between a 3D tricycle code and a 2D component code using one-way transversal CNOTs and teleportation logic (Li et al., 8 Oct 2025). In this line of research, tricycle codes are not merely storage codes; they are positioned as ingredients in universal fault-tolerant computation.

6. Concrete code instances, layouts, thresholds, and generalizations

Several explicit quantum code families and parameter points appear in the recent literature. The finite-blocklength tricycle paper reports examples such as $$T(c)=(c_{1,r-1},c_{1,0},\ldots,c_{1,r-2}\mid c_{2,s-1},c_{2,0},\ldots,c_{2,s-2}\mid c_{3,t-1},c_{3,0},\ldots,c_{3,t-2})$$2, $$T(c)=(c_{1,r-1},c_{1,0},\ldots,c_{1,r-2}\mid c_{2,s-1},c_{2,0},\ldots,c_{2,s-2}\mid c_{3,t-1},c_{3,0},\ldots,c_{3,t-2})$$3, $$T(c)=(c_{1,r-1},c_{1,0},\ldots,c_{1,r-2}\mid c_{2,s-1},c_{2,0},\ldots,c_{2,s-2}\mid c_{3,t-1},c_{3,0},\ldots,c_{3,t-2})$$4, and $$T(c)=(c_{1,r-1},c_{1,0},\ldots,c_{1,r-2}\mid c_{2,s-1},c_{2,0},\ldots,c_{2,s-2}\mid c_{3,t-1},c_{3,0},\ldots,c_{3,t-2})$$5, states a circuit-noise threshold of $$T(c)=(c_{1,r-1},c_{1,0},\ldots,c_{1,r-2}\mid c_{2,s-1},c_{2,0},\ldots,c_{2,s-2}\mid c_{3,t-1},c_{3,0},\ldots,c_{3,t-2})$$6 with a Belief-Propagation + Ordered-Statistics Decoder (BPOSD), and gives an optimal CNOT-depth-$$T(c)=(c_{1,r-1},c_{1,0},\ldots,c_{1,r-2}\mid c_{2,s-1},c_{2,0},\ldots,c_{2,s-2}\mid c_{3,t-1},c_{3,0},\ldots,c_{3,t-2})$$7 syndrome measurement schedule for the standard instances (Menon et al., 14 Aug 2025). The TT-code paper reports circuit-level thresholds of $$T(c)=(c_{1,r-1},c_{1,0},\ldots,c_{1,r-2}\mid c_{2,s-1},c_{2,0},\ldots,c_{2,s-2}\mid c_{3,t-1},c_{3,0},\ldots,c_{3,t-2})$$8 in the $$T(c)=(c_{1,r-1},c_{1,0},\ldots,c_{1,r-2}\mid c_{2,s-1},c_{2,0},\ldots,c_{2,s-2}\mid c_{3,t-1},c_{3,0},\ldots,c_{3,t-2})$$9 error channel and $\mathbb{Z}_2$0 in the $\mathbb{Z}_2$1 error channel with single-shot decoding, and states that numerical searches found candidates with improved parameters relative to the 3D toric code, using up to $\mathbb{Z}_2$2 fewer data qubits as equivalent 3DTC encodings (Jacob et al., 11 Aug 2025). It also gives examples such as $\mathbb{Z}_2$3, $\mathbb{Z}_2$4, and $\mathbb{Z}_2$5 (Jacob et al., 11 Aug 2025).

The resource-oriented paper on transversal dimension jump emphasizes a small bivariate tricycle code $\mathbb{Z}_2$6 as an example with depth-2 $\mathbb{Z}_2$7 and highly efficient magic-state preparation: a single round of stabilizer measurements followed by depth-2 $\mathbb{Z}_2$8 and postselection produces states with error $\mathbb{Z}_2$9 and success probability $(r,s,t)$00 (Li et al., 8 Oct 2025). By contrast, “Magic tricycles” emphasizes deterministic low-overhead distillation without requiring post-selection, using single-shot state preparation and error correction (Menon et al., 14 Aug 2025). These are different protocols in different constructions, not interchangeable statements about a single universal tricycle family.

A neighboring line of work, “Multivariate Bicycle Codes,” focuses on trivariate bicycle (TB) codes rather than tricycle codes, but it is closely adjacent conceptually because it also exploits a three-variable algebraic structure in QLDPC design (Voss et al., 2024). TB-QLDPC codes are introduced as an extension of multivariate bicycle constructions and include explicit weight-5 examples with bi-planar structure, toric layouts, and syndrome circuits of depth $(r,s,t)$01 (Voss et al., 2024). The paper reports that one example can encode $(r,s,t)$02 logical qubits with distance $(r,s,t)$03 into $(r,s,t)$04 physical qubits using weight-5 check measurements of circuit depth $(r,s,t)$05, whereas a comparable surface code requires $(r,s,t)$06 physical qubits (Voss et al., 2024). This does not make TB codes identical to tricycle codes, but it suggests a broader three-variable design trend in finite-length qLDPC research.

The generalization beyond tricycle codes is made explicit in “Multivariate Multicycle Codes for Complete Single-Shot Decoding,” which states that multivariate multicycle (MM) codes unify and generalize bivariate bicycle codes, multivariate bicycle codes, abelian two-block group algebra codes, generalized bicycle codes, trivariate tricycle codes, and $(r,s,t)$07-dimensional toric codes (Mian et al., 26 Jan 2026). In that framework, tricycle codes correspond to length-$(r,s,t)$08 chain complexes, while MM codes with $(r,s,t)$09 possess both $(r,s,t)$10- and $(r,s,t)$11-metachecks and therefore complete single-shot decoding (Mian et al., 26 Jan 2026). This places tricycle codes in a larger algebraic hierarchy: they are sufficiently structured to support partial single-shot decoding and logical non-Clifford gates, but not the full metacheck symmetry available in longer multicycle constructions.