On Reversible Cellular Automata with Triplet Local Rules

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
14 pages

Keywords

Cellular Automata and Lattice Gases

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/80994

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/nlin/0504058
 http://arxiv.org/abs/nlin/0504058

Collections

arXiv