Results 51 to 60 of about 58,244 (329)
Reversible quantum cellular automata
, 2004 20 pages, revtex4, 10 ...
Schumacher, B., Werner, R. F.
openaire +2 more sources
On the Bernoulli Automorphism of Reversible Linear Cellular Automata
, 2015 This investigation studies the ergodic properties of reversible linear cellular automata over $\mathbb{Z}_m$ for $m \in \mathbb{N}$. We show that a reversible linear cellular automaton is either a Bernoulli automorphism or non-ergodic.
Chang, Chih-Hung, Chang, Huilan
core +1 more source
Metastability for reversible probabilistic cellular automata with self--interaction [PDF]
, 2007 The problem of metastability for a stochastic dynamics with a parallel updating rule is addressed in the Freidlin--Wentzel regime, namely, finite volume, small magnetic field, and small temperature.
A. Bovier +14 more
core +2 more sources
Block cipher based on T-shaped cellular automata
Tongxin xuebao, 2009 In order to overcome the defect on insecurity of block cipher with few reversible cellular automata, T-shaped cellular automata was proposed, which needed two initial states and applied their characteristics to construct more re-versible cellular ...
WU Ying-zhi1, HAO Li-bo2, CHEN Ju-hua1
doaj +2 more sources
QUANTUM-DOT CELLULAR AUTOMATA-BASED SUPERIOR DESIGN OF CONSERVATIVE REVERSIBLE PARITY LOGIC CIRCUITS
Jordanian Journal of Computers and Information Technology, 2021 Quantum-dot Cellular Automata (QCA) is an innovative technology in the nano-scale for changing the CMOS revolution with an alternative one. It provides some benefits in reversible logic, like competitive power consumption and feature size.
Ali H. Majeed
doaj +1 more source
Data in Brief, 2017 Quantum-dot cellular automata (QCA) is a developing nanotechnology, which seems to be a good candidate to replace the conventional complementary metal-oxide-semiconductor (CMOS) technology.
Md. Kamrul Hassan +5 more
doaj +1 more source
On algebraic cellular automata
, 2011 We investigate some general properties of algebraic cellular automata, i.e., cellular automata over groups whose alphabets are affine algebraic sets and which are locally defined by regular maps.
Ceccherini-Silberstein, Tullio +1 more
core +1 more source
On reversibility in cellular automata
Journal of Computer and System Sciences, 1975 The notion of reversibility, or backward determinism, for cellular automata is investigated. Various intuitively different definitions are offered which coalesce in three inequivalent properties. Two of these are the well-known injectivity and surjectivity properties of the global transition function of a cellular automaton.
Di Gregorio, S., Trautteur, G.
openaire +2 more sources
On the structure of Clifford quantum cellular automata
, 2008 We study reversible quantum cellular automata with the restriction that these are also Clifford operations. This means that tensor products of Pauli operators (or discrete Weyl operators) are mapped to tensor products of Pauli operators.
Bernstein E. +13 more
core +1 more source
Modelling reliability of reversible circuits with 2D second-order cellular automata [PDF]
, 2023 Alexander Yu. Vlasov
openalex +2 more sources