Related papers: Damaging 2D Quantum Gravity
We study discrete dynamical systems through the topological concepts of limit set, which consists of all points that can be reached arbitrarily late, and asymptotic set, which consists of all adhering values of orbits. In particular, we…
We introduce a quantum cellular automaton that achieves approximate phase-covariant cloning of qubits. The automaton is optimized for 1-to-2N economical cloning. The use of the automaton for cloning allows us to exploit different foliations…
We describe the idea of studying quantum gravity by means of dynamical triangulations and give examples of its implementation in 2, 3 and 4 space time dimensions. For $d=2$ we consider the generic hermitian 1-matrix model. We introduce the…
Very much as its classical counterpart, quantum cellular automata are expected to be a great tool for simulating complex quantum systems. Here we introduce a partitioned model of quantum cellular automata and show how it can simulate, with…
We present an intuitive formalism for implementing cellular automata on arbitrary topologies. By that means, we identify a symmetry operation in the class of elementary cellular automata. Moreover, we determine the subset of topologically…
Recent advances on quantum foundations achieved the derivation of free quantum field theory from general principles, without referring to mechanical notions and relativistic invariance. From the aforementioned principles a quantum cellular…
Gauge-invariance is a fundamental concept in Physics -- known to provide mathematical justification for the fundamental forces. In this paper, we provide discrete counterparts to the main gauge theoretical concepts directly in terms of…
We introduce a class of noisy quantum cellular automata on a qubit lattice that includes all classical Markov chains, as well as maps where quantum coherence between sites is allowed to build up over time. We apply such a construction to…
We construct a time-optimal quasi-solution of the firing mob synchronisation problem over finite, connected, and undirected multigraphs whose maximum degrees are uniformly bounded by a constant. It is only a quasi-solution because its…
Any algorithm (in the sense of Gurevich's abstract-state-machine axiomatization of classical algorithms) operating over any arbitrary unordered domain can be simulated by a dynamic cellular automaton, that is, by a pattern-directed cellular…
A proposal is presented for simulating an improvement on quenched QCD with dynamical fermions which interact with the gluon configuration only via the topological index of the latter. Strengths and shortcomings of the method are discussed…
We study the gauge dependence of the fermion propagator in quenched QED3 with and without dynamical symmetry breaking in the light of its Landau-Khalatnikov-Fradkin Transformation (LKFT). In the former case, starting with the massive bare…
This letter examines diagrammatic cancellations for Quantum Electrodynamics (QED) in the general linear gauge. These cancellations combine Feynman graphs of various topologies and provide a method to reconstruct the gauge dependence of the…
We use the recently introduced U(N) framework for loop quantum gravity to study the dynamics of spin network states on the simplest class of graphs: two vertices linked with an arbitrary number N of edges. Such graphs represent two regions,…
This article reports an automated approach to the evaluation of higher-order terms of QED perturbation to anomalous magnetic moments of charged leptons by numerical means. We apply this approach to tenth-order correction due to a particular…
Cellular automata can show well known features of quantum mechanics, such as a linear rule according to which they evolve and which resembles a discretized version of the Schroedinger equation. This includes corresponding conservation laws.…
We study the effect of mixing two rules on the dynamics of one-dimensional cellular automata by large scale numerical simulations. We calculate the decay of the magnetization for the Domany-Kinzel automaton (XOR/AND mixing) to its…
Cayley graphs have a number of useful features: the ability to graphically represent finitely generated group elements and their relations; to name all vertices relative to a point; and the fact that they have a well-defined notion of…
We propose an iterative algorithm to investigate the cooperative evolution dominated by information encoded within state spaces in a random quantum cellular automaton. Inspired by the 2-gram model in statistical linguistics, the updates of…
We study the role of dissipation and structural defects on the time evolution of quantum dot arrays with mobile charges under external driving fields. These structures, proposed as quantum dot cellular automata, exhibit interesting quantum…