On Reversible Cellular Automata with Triplet Local Rules

Simple item page
dc.creatorInokuchi, Shuichi
dc.creatorHonda, Kazumasa
dc.creatorLee, Hyen Yeal
dc.creatorSato, Tatsuro
dc.creatorMizoguchi, Yoshihiro
dc.creatorKawahara, Yasuo
dc.date2005-04-28
dc.date.accessioned2026-07-07T05:36:26Z
dc.date.available2026-07-07T05:36:26Z
dc.descriptionBijections 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.
dc.description14 pages
dc.identifierhttps://arxiv.org/abs/nlin/0504058
dc.identifierhttp://arxiv.org/abs/nlin/0504058
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/80994
dc.subjectCellular Automata and Lattice Gases
dc.titleOn Reversible Cellular Automata with Triplet Local Rules
dc.typetext

Files

Collections

arXiv