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
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
A Hyperbolic Cycle Basis algorithm is introduced within a unified framework for constructing and benchmarking CSS quantum error correction codes on hyperbolic lattices, with performance metrics evaluated on two example codes.
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.
-
Systematic Approach to Hyperbolic Quantum Error Correction Codes
A Hyperbolic Cycle Basis algorithm is introduced within a unified framework for constructing and benchmarking CSS quantum error correction codes on hyperbolic lattices, with performance metrics evaluated on two example codes.