相关论文: Damaging 2D Quantum Gravity

In this exploratory paper we introduce the problem of cognitive agents that learn how to modify their environment according to local sensing to reach a global goal. We concentrate on discrete dynamics (cellular automata) on a…

We summarize a recent study of discrete (integer-valued) Hamiltonian cellular automata (CA) showing that their dynamics can only be consistently defined, if it is linear in the same sense as unitary evolution described by the Schr\"odinger…

Starting from the working hypothesis that both physics and the corresponding mathematics have to be described by means of discrete concepts on the Planck scale, one of the many problems one has to face in this enterprise is to find the…

Probabilistic cellular automata describe the dynamics of classical spin models, which, for sufficiently small temperature $T$, can serve as classical memory capable of storing information even in the presence of nonzero external magnetic…

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. This view of optimization is highly suggestive of an action principle of…

In recent years the modelling of traffic flow using methods from statistical physics, especially cellular automata models have allowed simulations of large traffic networks faster than real time. In this paper, we study a probabilistic…

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…

In order to characterize landslide frequency-size distributions and individuate hazard scenarios and their possible precursors, we investigate a cellular automaton where the effects of a finite driving rate and the anisotropy are taken into…

A ``sandpile'' cellular automaton achieves complex temporal correlations, like a $1/f$ spectrum, if the position where it is perturbed diffuses slowly rather than changing completely at random, showing that the spatial correlations of the…

Random graphs are a central element of the study of complex dynamical networks such as the internet, the brain, or socioeconomic phenomena. New methods to generate random graphs can spawn new applications and give insights into more…

We show that a cellular automaton (or shift-endomorphism) on a transitive subshift is either almost equicontinuous or sensitive. On the other hand, we construct a cellular automaton on a full-shift (hence a transitive subshift) that is…

We study the quantum fermions+gravity system, that is, the gravitational counterpart of QED. We start from the standard Einstein-Weyl theory, reformulated in terms of Ashtekar variables; and we construct its non- perturbative quantum theory…

Many computational problems are unchanged under some symmetry operation. In classical machine learning, this can be reflected with the layer structure of the neural network. In quantum machine learning, the ansatz can be tuned to correspond…

We present a stochastic CA modelling approach of corrosion based on spatially separated electrochemical half-reactions, diffusion, acido-basic neutralization in solution and passive properties of the oxide layers. Starting from different…

The spinfoam approach to quantum gravity rests on a "quantization" of BF theory using 2-complexes and group representations. We explain why, in dimension three and higher, this "spinfoam quantization" must be amended to be made consistent…

We discuss the action principle and resulting Hamiltonian equations of motion for a class of integer-valued cellular automata introduced recently [1]. Employing sampling theory, these deterministic finite-difference equations are mapped…

Crowd simulation is used for evacuation and crowd safety inspections, study of performance in crowd systems and animations. Cellular automata has been extensively used in modelling the crowd. In regular cellular automata models, each…

We obtain the exact full counting statistics of a cellular automaton with freely propagating vacancies and charged particles that are stochastically scattered or transmitted upon collision by identifying the problem as a colored stochastic…

Commonly studied cellular automata are memoryless and have fixed topology of connections between cells. However by allowing updates of links and short-term memory in cells we may potentially discover novel complex regimes of spatio-temporal…

The electron and current density distributions in the close proximity of quantum point contacts (QPCs) are investigated. A three dimensional Poisson equation is solved self-consistently to obtain the electron density and potential profile…