On Reversible Cellular Automata with Triplet Local Rules
Shuichi Inokuchi, Kazumasa Honda, Hyen Yeal Lee, Tatsuro Sato, Yoshihiro Mizoguchi, Yasuo Kawahara
Abstract
Bijections between sets may be seen as discrete (or crisp) unitary transformations used in quantum computations. So discrete quantum cellular automata are cellular automata with reversible transition functions. This note studies on 1d reversible cellular automata with triplet local rules.
Create a lesson
Related papers
Optical free space extreme learning machine for the implementation of emergent complex systems
Elena Moreno, Fernando Soldevila, Daniel Torrent
The istr-graph: Interactive Visualisation of any Classic-Graph in DDLab
Andrew Wuensche
Game of Life on Archimedean Lattices: Glider Guns and Phase Dynamics
Henrik Schou Guttesen
Dynamics in a Low-Rank Separable Field Cellular Automaton
Xiaorui Shi, Mengsha Huang
Trigonometric Plot of Ising Model
Goktug Islamoglu
Kramers-Wannier Duality at the Heart of Traffic
Goktug Islamoglu