A higher-order non-uniform cellular automata algorithm is introduced for translationally invariant Euclidean and hyperbolic lattices, demonstrated on the {5,4} lattice to generate subsystem symmetry-protected topological states and simulate directed percolation.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Universal Design and Physical Applications of Non-Uniform Cellular Automata on Translationally Invariant Lattices
A higher-order non-uniform cellular automata algorithm is introduced for translationally invariant Euclidean and hyperbolic lattices, demonstrated on the {5,4} lattice to generate subsystem symmetry-protected topological states and simulate directed percolation.