2005/04/28 by Shuichi Inokuchi, Inokuchi, Shuichi, Kazumasa Honda +9
Biochemistry, Genetics and Molecular Biology · Computer Science · Physics and Astronomy · #Cellular Automata and Applications #Cellular Automata and Lattice Gases (nlin.CG) #Computability, Logic, AI Algorithms #DNA and Biological Computing #FOS: Physical sciences #nlin.CG
paper · pdf · doi:10.48550/arxiv.nlin/0504058
14 pages
arxiv created 2005/04/28 · openalex publication_date 2005/04/28 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.