arxiv: 2509.07099 · v3 · submitted 2025-09-08 · math.QA · cond-mat.str-el· hep-th· math-ph· math.MP· quant-ph

Clifford quantum cellular automata from topological quantum field theories and invertible subalgebras

Bowen Yang, Meng Sun, Nathanan Tantivasadakarn, Yu-An Chen, Zongyuan Wang

abstract

We present a general framework for constructing quantum cellular automata (QCA) from topological quantum field theories (TQFT) and invertible subalgebras (ISA) using the cup-product formalism. This approach explicitly realizes all $\mathbb{Z}_2$ and $\mathbb{Z}_p$ Clifford QCAs (for prime $p$) in all admissible dimensions, in precise agreement with the classification predicted by algebraic $L$-theory. We determine the orders of these QCAs by explicitly showing that finite powers reduce to the identity up to finite-depth quantum circuits (FDQC) and lattice translations. In particular, we demonstrate that the $\mathbb{Z}_2$ Clifford QCAs in $(4l{+}1)$ spatial dimensions can be disentangled by non-Clifford FDQCs. Our construction applies beyond cubic lattices, allowing $\mathbb{Z}_2$ QCAs to be defined on arbitrary cellulations. Furthermore, we explicitly construct invertible subalgebras in higher dimensions, obtaining $\mathbb{Z}_2$ ISAs in $2l$ spatial dimensions and $\mathbb{Z}_p$ ISAs in $(4l{-}2)$ spatial dimensions. These ISAs give rise to $\mathbb{Z}_2$ QCAs in $(2l{+}1)$ dimensions and $\mathbb{Z}_p$ QCAs in $(4l{-}1)$ dimensions. We further prove that the QCAs in $3$ spatial dimensions constructed via TQFTs and ISAs are equivalent by identifying their boundary algebras, and show that this approach extends to higher dimensions. Together, these results establish a unified and dimension-periodic framework for Clifford QCAs, connecting their explicit lattice realizations to field theories.

The Pith

CONDITIONAL ●○○ LOW

strongest claim

Using cup-product TQFT actions (e.g., S = 1/2 (A_l ∪ A_l + A_l ∪ B_l + B_l ∪ B_l) and S = (k/p) A_{2l} ∪ A_{2l}) plus a parallel invertible-subalgebra construction, the authors explicitly realize all Z_2 and Z_p (p prime) Clifford QCA classes predicted by algebraic L-theory in their admissible spatial dimensions, determine their orders (2 or 4 depending on p mod 4), prove TQFT and ISA constructions yield equivalent QCAs in 3D (and argue extension to higher D), and extend Z_2 constructions to arbitrary cellulations.

weakest assumption

Trivializability claims rely on the conjecture (Table I footnote, Sec. IV) that anomalous boundary theories of the (4l)-spacetime-dimensional Z_2 actions admit no commuting-projector Hamiltonians, marked 'No*'. The central matching with the L-theoretic classification also depends on the framework of Refs. [37,38] and on Corollary 1 (Sec. VII B) — that QCAs disentangling the same stabilizer group are equivalent up to FDQC and shifts — which is proved here only for lattices coarsely equivalent to Euclidean space.

novelty7.5

clarity6.5

reproduce7.0

riskmedium

formalnone

free params0

plain-language explainer

1/ Quantum cellular automata (QCAs) are locality-preserving unitaries on lattices. In high dimensions some are nontrivial — they cannot be built from finite-depth circuits + shifts. The 3-fermion QCA in 3+1D is the canonical example. 2/ This paper writes down explicit Clifford QCAs for all Z_2 and Z_p (p prime) classes predicted by algebraic L-theory, in every admissible dimension, by discretizing TQFT actions like (1/2)(A∪A+A∪B+B∪B) using higher cup products, and via a parallel invertible-subalgebra construction. 3/ They compute orders (2 or 4 mod p), show 4l+1 cases trivialize under non-Clifford circuits while 4l−1 do not, prove TQFT≅ISA constructions in 3D via boundary-algebra matching, and extend Z_2 QCAs beyond cubic lattices to arbitrary cellulations.

for a schoolchild

They built recipes for special lattice puzzles in many dimensions, matching a known list, and showed when puzzles can be undone.

red flags (2)

claim_without_derivation · Table I caption, Sec. IV
Table I notes that non-trivializability under non-Clifford FDQCs in 4l spacetime dimensions is 'conjectured ... based on the expectation that the corresponding anomalous boundary theories do not admit commuting-projector Hamiltonians.'
overclaim · Abstract; Sec. I
Abstract states constructions realize 'all' Z_2 and Z_p Clifford QCAs 'in precise agreement with the classification predicted by algebraic L-theory'; completeness is established by matching counts to the cited L-theoretic classification rather than by an independent surjectivity proof in this paper.

axiom audit (4)

standard_math: Algebraic L-theory classification of Clifford QCAs (Refs. [37,38])
Used as the target classification that constructions are matched against.
standard_math: Witt group decomposition of quadratic forms on finite abelian groups
Invoked to organize Z_p classes; cited to Refs. [66,67].
ad_hoc_to_paper: Conjecture: 4l-spacetime-dim Z_2 QCAs are non-trivial under non-Clifford FDQCs
Explicitly flagged in Table I as 'No*' / conjecture about absence of commuting-projector boundary.
ad_hoc_to_paper: QCAs disentangling the same stabilizer group are equivalent up to FDQC + shifts (Corollary 1)
Proved only for lattices coarsely equivalent to Euclidean space; load-bearing for the TQFT/ISA equivalence argument.

rationale

Long, technical math.QA/cond-mat paper with substantial internal consistency: cup-product identities, polynomial-formalism matrix computations, explicit order calculations, and a boundary-algebra argument relating TQFT and ISA constructions. Two independent constructions yield matching QCAs, providing internal cross-checks. Explicit polynomial matrices in appendices and squaring computations are checkable in principle. The classification claim is conjectural in that completeness rests on agreement with Refs. [37,38]'s L-theoretic classification rather than an independent surjectivity proof; some non-trivializability statements are explicitly conjectural (Table I 'No*'). I have not verified all higher-cup-product sign computations or the polynomial-matrix manipulations in Sec. VI. Given the technical depth and that I cannot fully audit every cup-product identity, I assign moderate confidence and a CONDITIONAL verdict pending the conjectural items and the Witt-class equivalence steps. No data/code claims (pure theory). Reproducibility of the math is reasonable since formulas and matrices are explicit.

pith-pipeline@v0.2.0 · 89858 in / 2260 out tokens · 40839 ms · 2026-05-05T05:23:05.587297+00:00