Results 11 to 20 of about 5,964 (241)
From quantum cellular automata to quantum lattice gases [PDF]
Journal of Statistical Physics, 1996 A natural architecture for nanoscale quantum computation is that of a quantum cellular automaton. Motivated by this observation, in this paper we begin an investigation of exactly unitary cellular automata.
B. Hasslacher +39 more
core +5 more sources
Partitioned quantum cellular automata are intrinsically universal [PDF]
Natural Computing, 2011 16 pages, 7 figures. 2009 Physics and Computation workshop, special issue.
Arrighi, Pablo, Grattage, Jonathan
openaire +4 more sources
Broadcasting Automata and Patterns on Z^2 [PDF]
, 2014 The Broadcasting Automata model draws inspiration from a variety of sources such as Ad-Hoc radio networks, cellular automata, neighbourhood se- quences and nature, employing many of the same pattern forming methods that can be seen in the superposition ...
Igor Potapov +5 more
core +2 more sources
Simple and Efficient Local Codes for Distributed Stable Network Construction [PDF]
, 2014 In this work, we study protocols so that populations of distributed processes can construct networks. In order to highlight the basic principles of distributed network construction we keep the model minimal in all respects.
Michail, Othon, Spirakis, Paul G.
core +2 more sources
Local Unitary Quantum Cellular Automata [PDF]
, 2007 In this paper we present a quantization of Cellular Automata. Our formalism is based on a lattice of qudits, and an update rule consisting of local unitary operators that commute with their own lattice translations. One purpose of this model is to act as
B. Chopard +10 more
core +2 more sources
Coarse Graining of Partitioned Cellular Automata
, 2019 Partitioned cellular automata are known to be an useful tool to simulate linear and nonlinear problems in physics, specially because they allow for a straightforward way to define conserved quantities and reversible dynamics. Here we show how to construct a local coarse graining description of partitioned cellular automata.
Costa, Pedro C. S., De Melo, Fernando
openaire +3 more sources
Impartial games emulating one-dimensional cellular automata and undecidability [PDF]
, 2012 We study two-player \emph{take-away} games whose outcomes emulate two-state one-dimensional cellular automata, such as Wolfram's rules 60 and 110. Given an initial string consisting of a central data pattern and periodic left and right patterns, the rule
Larsson, Urban
core +2 more sources
A geometric view of quantum cellular automata
, 2012 Nielsen, et al. [1, 2] proposed a view of quantum computation where determining optimal algorithms is equivalent to extremizing a geodesic length or cost functional.
Alsing, Paul M. +2 more
core +1 more source
On the Computational Power of DNA Annealing and Ligation [PDF]
, 1995 In [20] it was shown that the DNA primitives of Separate, Merge, and Amplify were not sufficiently powerful to invert functions defined by circuits in linear time.
Winfree, Erik
core +3 more sources
On the absence of homogeneous scalar unitary cellular automata
, 1995 Failure to find homogeneous scalar unitary cellular automata (CA) in one dimension led to consideration of only ``approximately unitary'' CA---which motivated our recent proof of a No-go Lemma in one dimension.
Bialynicki-Birula +23 more
core +4 more sources