Higher-Form Transversal Gate in Quantum Codes

• Higher-form transversal gates are logical operators defined on codimension-h submanifolds, offering robust fault-tolerance in quantum error correction.
• They utilize commuting on-site unitaries and sparse chain complex maps to achieve constant-depth, parallel, and efficient measurement protocols.
• Applications include fast magic state preparation and enhanced distillation in high-dimensional LDPC and topological codes, driving advances in universal quantum computation.

A higher-form transversal gate is a class of logical operator in quantum error-correcting codes, particularly within the CSS and quantum LDPC frameworks, characterized by nontrivial homological structure and locality on extended submanifolds (codimension-h) rather than individual qubits. Importantly, higher-form transversal gates arise as global symmetries generated by commuting on-site unitaries associated to basis vectors of higher-degree chain spaces, and their logical actions are captured cohomologically. This enriches the set of fault-tolerant gates accessible transversally, enabling fast, parallel, and robust protocols for, e.g., magic state distillation and universal quantum computation, especially in high-dimensional LDPC and topological codes (Williamson, 30 Jan 2026).

1. Formalism and Definition

Let $C_\bullet$ denote a chain complex of $\mathbb{F}_2$-vector spaces associated to a CSS quantum code: $C_0 \xleftrightarrows[\delta_1]{\partial_1} C_1 \xleftrightarrows[\delta_2]{\partial_2} C_2,$ where

• $C_0$: $X$-check labels,
• $C_1$: physical qubits,
• $C_2$: $Z$-check labels.

A higher-form transversal gate generalizes this structure: For some $h \ge 0$, consider a segment of the chain complex

$C_{h-1} \xleftrightarrows[\delta_h]{\partial_h} C_h \xleftrightarrows[\delta_{h+1}]{\partial_{h+1}} C_{h+1}.$

Define a family of commuting on-site unitaries $\{U_s\}_{s \in C_h}$ with $U_s^2 = I$. For any cocycle $c \in \ker \delta_{h+1}$, the operator

$U(c) = \prod_{s \in C_h} U_s^{c_s}$

is called an $h$-form transversal gate. The logical group is isomorphic to $$H^h(C_\bullet) = \ker \delta_{h+1} / \mathrm{Im}\, \delta_h$$, corresponding to global symmetries acting on codimension-$h$ subspaces (e.g., $h=1$ is loop-like, $h=2$ is surface-like). The true logical content is the action of $U(c)$ modulo stabilizer (cohomologically trivial) combinations (Williamson, 30 Jan 2026).

2. Existence Conditions in Quantum Codes

A quantum LDPC (qLDPC) code admits higher-form transversal gates if:

• It comes in a family of growing code distance (no constant-weight logicals).
• The maps $\delta_{h+1}$ and $\partial_{h}$ are sparse, so that every $U_s$ is supported on $O(1)$ qubits and each qubit is acted on by $O(1)$ such unitaries.
• Homology and cohomology distances grow with system size (robust logicals).

Codes with 0-form transversal gates such as $T$ or $\mathrm{CCZ}$ automatically provide 1-form transversal Clifford gates via commutators with logical $X$'s. Furthermore, codes constructed by gauging symmetries in higher-group SPT phases can support exotic higher-form gates even in the absence of 0-form non-Clifford gates (Williamson, 30 Jan 2026).

3. Measurement and Gauging Procedures

To measure logical higher-form transversal operators, the h-form gauging protocol is implemented. For each generator of $C_{h+1}$:

1. Introduce an ancilla initialized in $\ket{0}$.
2. Measure generalized Gauss-law checks $A_v = U_v \prod_{e \in \delta_{h+1}v} X_e$ for $v \in C_h$, obtaining eigenvalues $\varepsilon_v$.
3. Read out all ancillas in $Z$ basis, obtaining outcome $x \in C_{h+1}$.
4. Compute and apply byproduct correction $U(y)$ for minimal-weight $y \in C_h$ with $\partial_{h+1} y = x$.

The data qubits are projected by

$$\Pi_{\rm gauge} = \prod_{[\ell] \in H^h(C_\bullet)} \frac{1 + \sigma_{[\ell]} U(\ell)}{2},$$

simultaneously extracting all logical measurement outcomes. The code is restored to its original space by syndrome extraction before and after measurement (Williamson, 30 Jan 2026).

4. Performance and Fault-Tolerance

The protocol achieves optimal scaling:

• Time overhead $T_{\rm overhead} = O(1)$ (constant depth): Only three rounds of parallel operations plus two rounds of syndrome extraction.
• Qubit overhead $N_{\rm total} = O(n)$: One ancilla per basis vector of $C_{h+1}$, so overhead is linear in system size; constant rate for code families.
• Fault-tolerance: The procedure's code-distance is lower bounded by $\phi_h(C_\bullet) d/2$, where $d$ is code distance and $\phi_h$ is the $h$-Cheeger constant. Measurement-fault distance equals the $h$-th homology group distance, and local "meta-checks" from $\operatorname{Im} \delta_h$ enable detection with no repeated syndrome extraction (Williamson, 30 Jan 2026).

5. Applications to Magic State Preparation

Higher-form transversal gates enable fast and parallel preparation of logical magic states:

• Prepare an $X$-Pauli eigenstate (e.g., $\ket{+^{\otimes k}}$).
• Apply $h$-form gauging measurement for a 1-form transversal Clifford gate.
• The resulting state has additional stabilizers from 1-form logical Cliffords, yielding many encoded magic states in parallel. The preparation is single-shot and constant depth.

For example, a 1-form $XS$ gate (from transversal $T$) enables preparation of many $\ket{T}$ states at rate $\dim H^1 / n$; a 1-form $CZ$ gate (from a suitably structured code) enables clusters of $\ket{\mathrm{CCZ}}$-type magic states (Williamson, 30 Jan 2026).

6. Explicit Constructions and Examples

3D Color Code: In a 4-colorable 3D simplicial complex, the transversal $T$ on black versus white tetrahedra induces a 1-form $XS$ gate. The gauging protocol prepares $T$-magic states at constant depth and linear overhead, inheriting code distance and robust noise thresholds.

Twisted Higher-Group Gauge Theory: Starting from a $$\mathbb{Z}_2^{(0)} \times \mathbb{Z}_2^{(0)} \times \mathbb{Z}_2^{(1)}$$ SPT phase, gauging 0-form symmetry yields decoupled 3D toric codes, with residual 1-form symmetry supporting transversal logical $CZ$, realized by a product of local unitaries. Gauging this symmetry prepares clusters of $\ket{CZ}$-type hypergraph magic states (Williamson, 30 Jan 2026).

Dimension–Hierarchy Connection: In D-dimensional topological codes, the highest possible level-D transversal gate in the Clifford hierarchy is supported (e.g., 2D toric code: $CZ$; 3D: $CCZ$; 4D: $CCCZ$), matching the intersection structure of logical operators with Clifford hierarchy levels (Jochym-O'Connor et al., 2020, Hsin et al., 19 Nov 2025).

7. Impact and Outlook

Higher-form transversal gates fundamentally expand the class of fault-tolerant protocols available in quantum LDPC and topological code families. Their unique properties—commutativity, locality on higher-dimensional submanifolds, efficient measurability, and intrinsic cohomological structure—unlock high-throughput, parallelized magic state factories and constant-overhead distillation for universal quantum computation, provided suitable qLDPC code families exist that support the required higher-form symmetries. This establishes a clear direction for the development of codes with richer higher-form logical gate sets and optimized resource overheads, with direct implications for future fault-tolerant quantum architectures (Williamson, 30 Jan 2026, Jochym-O'Connor et al., 2020).