Related papers: Renormalisation of Fermionic Cellular Automata
Given a finite set of local constraints, we seek a cellular automaton (i.e., a local and uniform algorithm) that self-stabilises on the configurations that satisfy these constraints. More precisely, starting from a finite perturbation of a…
Tile displacement is a newly-recognized mechanism in DNA nanotechnology that exploits principles analogous to toehold-mediated strand displacement but within the context of self-assembled DNA origami tile arrays. Here, we formulate an…
While for synchronous deterministic cellular automata there is an accepted definition of reversibility, the situation is less clear for asynchronous cellular automata. We first discuss a few possibilities and then investigate what we call…
We introduce creation and annihilation operators of pseudo-Hermitian fermions for two-level systems described by pseudo-Hermitian Hamiltonian with real eigenvalues. This allows the generalization of the fermionic coherent states approach to…
We derive an efficient method for treating renormalization contributions at two-loop level within the functional renormalization group in the one-particle irreducible formalism for fermions. It is based on a decomposition of the…
We apply the dinamically driven renormalization group to study the critical properties of the Domany-Kinzel probabilistic cellular automaton. To preserve the absorbing state clusters with at least one site occupied are renormalized into a…
We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration at each time step) makes both…
We introduce a transformation which allows the fermionization of operators of any one-dimensional spin-chain. This fermionization procedure is independent of any eventual integrable structure and is compatible with it. We illustrate this…
We present a method to eliminate redundancy in the transition tables of Boolean automata: schema redescription with two symbols. One symbol is used to capture redundancy of individual input variables, and another to capture permutability in…
We compute non-perturbatively the renormalization constants of composite operators for overlap fermions by using the regularization independent scheme. The scaling behavior of the renormalization constants is investigated using the data…
In this paper, we look at two ways to implement determinisitic one dimensional cellular automata into hyperbolic cellular automata in three contexts: the pentagrid, the heptagrid and the dodecagrid, these tilings being classically denoted…
We introduce and study cellular automata whose cell spaces are left-homogeneous spaces. Examples of left-homogeneous spaces are spheres, Euclidean spaces, as well as hyperbolic spaces acted on by isometries; uniform tilings acted on by…
We apply the methods of lattice field theories to the quantization of cellular automata. We discuss the quantization of five main categories of cellular automata: bosonic, fermionic, supersymmetric, spin and quantum dot using path integral…
The spin-1 Ising (BEG) model with the nearest-neighbour bilinear and biquadratic interactions and single-ion anisotropy is simulated on a cellular automaton which improved from the Creutz cellular automaton(CCA) for a simple cubic lattice.…
In a probabilistic cellular automaton in which all local transitions have positive probability, the problem of keeping a bit of information indefinitely is nontrivial, even in an infinite automaton. Still, there is a solution in 2…
We study the problem of sequentializing a cellular automaton without introducing any intermediate states, and only performing reversible permutations on the tape. We give a decidable characterization of cellular automata which can be…
Using Schroedinger Functional methods, we compute the non-perturbative renormalisation and renormalisation group running of several four-fermion operators, in the framework of lattice simulations with two dynamical Wilson quarks. Two…
Microscopic modeling of multi-lane traffic is usually done by applying heuristic lane changing rules, and often with unsatisfying results. Recently, a cellular automaton model for two-lane traffic was able to overcome some of these problems…
We study the ground-state properties of spin-1/2 fermionic atoms confined in a one-dimensional optical superlattice with harmonic confinement by using the density matrix renormalization group method. For this purpose, we consider an ionic…
We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration at each time step) makes both…