On Reversible Cellular Automata with Triplet Local Rules
Cellular Automata and Lattice Gases
2007-05-23 v1
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.
Keywords
Cite
@article{arxiv.nlin/0504058,
title = {On Reversible Cellular Automata with Triplet Local Rules},
author = {Shuichi Inokuchi and Kazumasa Honda and Hyen Yeal Lee and Tatsuro Sato and Yoshihiro Mizoguchi and Yasuo Kawahara},
journal= {arXiv preprint arXiv:nlin/0504058},
year = {2007}
}
Comments
14 pages