Related papers: Renormalisation of Fermionic Cellular Automata
We study a coarse-graining procedure for quantum cellular automata on hypercubic lattices that consists in grouping neighboring cells into tiles and selecting a subspace within each tile. This is done in such a way that multiple evolution…
We consider quantum cellular automata for one-dimensional chains of Fermionic modes and study their implementability as finite depth quantum circuits. Fermionic automata have been classified in terms of an index modulo circuits and the…
A renormalization scheme for interacting fermionic systems is presented where the renormalization is carried out in terms of the fermionic degrees of freedom. The scheme is based on continuous unitary transformations of the hamiltonian…
We apply a recently proposed dynamically driven renormalization group scheme to probabilistic cellular automata having one absorbing state. We have found just one unstable fixed point with one relevant direction. In the limit of small…
How do cellular automata behave in the limit of a very large number of cells? Is there a continuum limit with simple properties? We attack this problem by mapping certain classes of automata to quantum field theories for which powerful…
We improve a recently proposed dynamically driven renormalization group algorithm for cellular automata systems with one absorbing state, introducing spatial correlations in the expression for the transition probabilities. We implement the…
We classify quantum cellular automata whose cells are qubits, on hypercubic lattices $\mathbb Z^s$, with the von Neumann neighborhood scheme, in terms of realizability as finite-depth quantum circuits. We show the most general structure of…
We propose and test an algorithm to simulate a lattice system of interacting fermions in two spatial dimensions. The approach is an extension of the entanglement renormalization technique [Phys. Rev. Lett. 99, 220405 (2007)] and the related…
We perform renormalization group transformations to construct optimally local perfect lattice actions for free scalar fields of any mass. Their couplings decay exponentially. The spectrum is identical to the continuum spectrum, while…
One-dimensional cellular automata are discrete dynamical systems that operate on an infinite lattice of sites and are characterized by the locality and uniformity of their update rule. Permutations of the state set and isometric…
Supersymmetry provides a natural playground for the construction of dynamically constrained lattice fermion models. We here illustrate how supersymmetry can be used to construct a fermionic equivalent of the PXP model with an adjustable…
In this paper we study the space evolution in the Rule 54 reversible cellular automaton, which is a paradigmatic example of a deterministic interacting lattice gas. We show that the spatial translation of time configurations of the…
We present a renormalization group analysis of two-dimensional interacting fermion systems with a closed and partially flat Fermi surface. Numerical solutions of the one-loop flow equations show that for a bare local repulsion, the system…
We study self-similarity in one-dimensional probabilistic cellular automata (PCA) using the renormalization technique. We introduce a general framework for algebraic construction of renormalization groups (RG) on cellular automata and apply…
We construct entanglement renormalization schemes which provably approximate the ground states of non-interacting fermion nearest-neighbor hopping Hamiltonians on the one-dimensional discrete line and the two-dimensional square lattice.…
The cellular automata with local permutation invariance are considered. We show that in the two-state case the set of such automata coincides with the generalized Game of Life family. We count the number of equivalence classes of the rules…
We present non-perturbative renormalization constants of fermionic bilinears on the lattice in the quenched approximation at beta=6.1 using an overlap fermion action with hypercubic(HYP)-blocked links. We consider the effects of the exact…
Layers of two-dimensional materials arranged at a twist angle with respect to each other lead to enlarged unit cells with potentially strongly altered band structures, offering a new arena for novel and engineered many-body ground states.…
Finite cellular automata (FCA) are widely used in simulating nonlinear complex systems, and their reversibility is closely related to information loss during the evolution. However, only a relatively small portion of their reversibility…
We define quantum cellular automata as infinite quantum lattice systems with discrete time dynamics, such that the time step commutes with lattice translations and has strictly finite propagation speed. In contrast to earlier definitions…