arXiv subjects

Pablo Arrighi

Publications and source records attributed to Pablo Arrighi.

At least 55 records · Page 3Linked to original sources

arXiv2018

A gauge-invariant reversible cellular automaton

Gauge-invariance is a fundamental concept in physics---known to provide the mathematical justification for all four fundamental forces. In this paper, we provide discrete counterparts to the main gauge theoretical concepts, directly in terms of Cellular Automata. More precisely, we describe a step-by-step gauging procedure to enforce local symmetries upon a given Cellular Automaton. We apply it to a simple Reversible Cellular Automaton for concreteness. From a Computer Science perspective, discretized gauge theories may be applied to numerical analysis, quantum simulation, fault-tolerant (quantum) computation. From a mathematical perspective, discreteness provides a simple yet rigorous route straight to the core concepts.

cs.FL↗

arXiv2017

Reversible Causal Graph Dynamics

Causal Graph Dynamics extend Cellular Automata to arbitrary, bounded-degree, time-varying graphs. The whole graph evolves in discrete time steps, and this global evolution is required to have a number of physics-like symmetries: shift-invariance (it acts everywhere the same) and causality (information has a bounded speed of propagation). We add a further physics-like symmetry, namely reversibility. KEYWORDS: Bijective, invertible, injective, surjective, one-to-one, onto, Cayley graphs, Hedlund, Block representation, Lattice-gas automaton, Reversible Cellular Automata.

cs.DM↗

arXiv2017

Quantum Causal Graph Dynamics

Consider a graph having quantum systems lying at each node. Suppose that the whole thing evolves in discrete time steps, according to a global, unitary causal operator. By causal we mean that information can only propagate at a bounded speed, with respect to the distance given by the graph. Suppose, moreover, that the graph itself is subject to the evolution, and may be driven to be in a quantum superposition of graphs---in accordance to the superposition principle. We show that these unitary causal operators must decompose as a finite-depth circuit of local unitary gates. This unifies a result on Quantum Cellular Automata with another on Reversible Causal Graph Dynamics. Along the way we formalize a notion of causality which is valid in the context of quantum superpositions of time-varying graphs, and has a number of good properties. Keywords: Quantum Lattice Gas Automata, Block-representation, Curtis-Hedlund-Lyndon, No-signalling, Localizability, Quantum Gravity, Quantum Graphity, Causal Dynamical Triangulations, Spin Networks, Dynamical networks, Graph Rewriting.

cs.DM↗

arXiv2017

The Vectorial $λ$-Calculus

We describe a type system for the linear-algebraic $λ$-calculus. The type system accounts for the linear-algebraic aspects of this extension of $λ$-calculus: it is able to statically describe the linear combinations of terms that will be obtained when reducing the programs. This gives rise to an original type theory where types, in the same way as terms, can be superposed into linear combinations. We prove that the resulting typed $λ$-calculus is strongly normalising and features weak subject reduction. Finally, we show how to naturally encode matrices and vectors in this typed calculus.

cs.LO↗

arXiv2017

Lineal: A linear-algebraic Lambda-calculus

We provide a computational definition of the notions of vector space and bilinear functions. We use this result to introduce a minimal language combining higher-order computation and linear algebra. This language extends the Lambda-calculus with the possibility to make arbitrary linear combinations of terms alpha.t + beta.u. We describe how to "execute" this language in terms of a few rewrite rules, and justify them through the two fundamental requirements that the language be a language of linear operators, and that it be higher-order. We mention the perspectives of this work in the field of quantum computation, whose circuits we show can be easily encoded in the calculus. Finally, we prove the confluence of the entire calculus.

quant-ph↗

arXiv2016

Quantum walking in curved spacetime: $(3+1)$ dimensions, and beyond

A discrete-time Quantum Walk (QW) is essentially an operator driving the evolution of a single particle on the lattice, through local unitaries. Some QWs admit a continuum limit, leading to familiar PDEs (e.g. the Dirac equation). Recently it was discovered that prior grouping and encoding allows for more general continuum limit equations (e.g. the Dirac equation in $(1+1)$ curved spacetime). In this paper, we extend these results to arbitrary space dimension and internal degree of freedom. We recover an entire class of PDEs encompassing the massive Dirac equation in $(3+1)$ curved spacetime. This means that the metric field can be represented by a field of local unitaries over a lattice.

quant-ph↗

arXiv2016

Quantum walking in curved spacetime

A discrete-time Quantum Walk (QW) is essentially a unitary operator driving the evolution of a single particle on the lattice. Some QWs admit a continuum limit, leading to familiar PDEs (e.g. the Dirac equation). In this paper, we study the continuum limit of a wide class of QWs, and show that it leads to an entire class of PDEs, encompassing the Hamiltonian form of the massive Dirac equation in $(1+1)$ curved spacetime. Therefore a certain QW, which we make explicit, provides us with a unitary discrete toy model of a test particle in curved spacetime, in spite of the fixed background lattice. Mathematically we have introduced two novel ingredients for taking the continuum limit of a QW, but which apply to any quantum cellular automata: encoding and grouping.

quant-ph↗

arXiv2016

Free fall and cellular automata

Three reasonable hypotheses lead to the thesis that physical phenomena can be described and simulated with cellular automata. In this work, we attempt to describe the motion of a particle upon which a constant force is applied, with a cellular automaton, in Newtonian physics, in Special Relativity, and in General Relativity. The results are very different for these three theories.

nlin.CG↗

arXiv2016

Bounds on the Speedup in Quantum signalling

Given a discrete reversible dynamics, we can define a quantum dynamics, which acts on basis states like the classical one, but also allows for superpositions of them. It is a curious fact that in the quantum version, local changes in the initial state, after a single dynamical step, can sometimes can be detected much farther away than classically. Here we show that this effect is no use for generating faster signals. In a run of many steps the quantum propagation neighborhood can only increase by a constant fringe, so there is no asymptotic increase in speed.

quant-ph↗

arXiv2015

Discrete geodesics and cellular automata

This paper proposes a dynamical notion of discrete geodesics, understood as straightest trajectories in discretized curved spacetime. The notion is generic, as it is formulated in terms of a general deviation function, but readily specializes to metric spaces such as discretized pseudo-riemannian manifolds. It is effective: an algorithm for computing these geodesics naturally follows, which allows numerical validation---as shown by computing the perihelion shift of a Mercury-like planet. It is consistent, in the continuum limit, with the standard notion of timelike geodesics in a pseudo-riemannian manifold. Whether the algorithm fits within the framework of cellular automata is discussed at length. KEYWORDS: Discrete connection, parallel transport, general relativity, Regge calculus.

cs.DM↗

arXiv2014

Generalized Cayley Graphs and Cellular Automata over them

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 translation. We propose a notion of graph associated to a language, which conserves or generalizes these features. Whereas Cayley graphs are very regular; associated graphs are arbitrary, although of a bounded degree. Moreover, it is well-known that cellular automata can be characterized as the set of translation-invariant continuous functions for a distance on the set of configurations that makes it a compact metric space; this point of view makes it easy to extend their definition from grids to Cayley graphs. Similarly, we extend their definition to these arbitrary, bounded degree, time-varying graphs. The obtained notion of Cellular Automata over generalized Cayley graphs is stable under composition and under inversion. KEYWORDS: Causal Graph Dynamics, Curtis-Hedlund-Lyndon, Dynamical networks, Boolean networks, Generative networks automata, Graph Automata, Graph rewriting automata, L-systems, parallel graph transformations, Amalgamated graph transformations, Time-varying graphs, Regge calculus, Local, No-signalling, Reversibility.

cs.DM↗

arXiv2014

Discrete Lorentz covariance for Quantum Walks and Quantum Cellular Automata

We formalize a notion of discrete Lorentz transforms for Quantum Walks (QW) and Quantum Cellular Automata (QCA), in (1 + 1)-dimensional discrete spacetime. The theory admits a diagrammatic representation in terms of a few local, circuit equivalence rules. Within this framework, we show the first-order-only covariance of the Dirac QW. We then introduce the Clock QW and the Clock QCA, and prove that they are exactly discrete Lorentz covariant. The theory also allows for non-homogeneous Lorentz transforms, between non-inertial frames.

quant-ph↗

arXiv2014

Causal Dynamics of Discrete Surfaces

We formalize the intuitive idea of a labelled discrete surface which evolves in time, subject to two natural constraints: the evolution does not propagate information too fast; and it acts everywhere the same.

cs.DM↗

arXiv2013

Decoupled Quantum Walks, models of the Klein-Gordon and wave equations

Decoupling a vectorial PDE consists in solving the system for each component, thereby obtaining scalar PDEs that prescribe the evolution of each component independently. We present a general approach to decoupling of Quantum Walks, again defined as a procedure to obtain an evolution law for each scalar component of the QW, in such a way that it does not depend on the other components. In particular, the method is applied to show the relation between the Dirac (or Weyl) Quantum Walk in three space dimensions with (or without) mass term, and the Klein-Gordon (or wave) equation.

quant-ph↗

arXiv2013

The Dirac equation as a quantum walk: higher dimensions, observational convergence

The Dirac equation can be modelled as a quantum walk, with the quantum walk being: discrete in time and space (i.e. a unitary evolution of the wave-function of a particle on a lattice); homogeneous (i.e. translation-invariant and time-independent), and causal (i.e. information propagates at a bounded speed, in a strict sense). This quantum walk model was proposed independently by Succi and Benzi, Bialynicki-Birula and Meyer: we rederive it in a simple way in all dimensions and for hyperbolic symmetric systems in general. We then prove that for any time t, the model converges to the continuous solution of the Dirac equation at time t, i.e. the probability of observing a discrepancy between the model and the solution is an O(ε^2), with ε the discretization step. At the practical level, this result is of interest for the quantum simulation of relativistic particles. At the theoretical level, it reinforces the status of this quantum walk model as a simple, discrete toy model of relativistic particles. Keywords: Friedrichs symmetric hyperbolic systems, Quantum Walk, Quantum Lattice Gas Automata, Quantum Computation, Trotter-Kato, Baker-Campbell-Thomson, Operator splitting, Lax theorem

quant-ph↗

arXiv2013

Stochastic Cellular Automata: Correlations, Decidability and Simulations

This paper introduces a simple formalism for dealing with deterministic, non- deterministic and stochastic cellular automata in an unified and composable manner. This formalism allows for local probabilistic correlations, a feature which is not present in usual definitions. We show that this feature allows for strictly more behaviors (for instance, number conserving stochastic cellular automata require these local probabilistic correlations). We also show that several problems which are deceptively simple in the usual definitions, become undecidable when we allow for local probabilistic correlations, even in dimension one. Armed with this formalism, we extend the notion of intrinsic simulation between deterministic cellular automata, to the non-deterministic and stochas- tic settings. Although the intrinsic simulation relation is shown to become undecidable in dimension two and higher, we provide explicit tools to prove or disprove the existence of such a simulation between any two given stochastic cellular automata. Those tools rely upon a characterization of equality of stochastic global maps, shown to be equivalent to the existence of a stochastic coupling between the random sources. We apply them to prove that there is no universal stochastic cellular automaton. Yet we provide stochastic cellular automata achieving optimal partial universality, as well as a universal non-deterministic cellular automaton.

cs.DM↗

arXiv2012

Intrinsic Simulations between Stochastic Cellular Automata

The paper proposes a simple formalism for dealing with deterministic, non-deterministic and stochastic cellular automata in a unifying and composable manner. Armed with this formalism, we extend the notion of intrinsic simulation between deterministic cellular automata, to the non-deterministic and stochastic settings. We then provide explicit tools to prove or disprove the existence of such a simulation between two stochastic cellular automata, even though the intrinsic simulation relation is shown to be undecidable in dimension two and higher. The key result behind this is the caracterization of equality of stochastic global maps by the existence of a coupling between the random sources. We then prove that there is a universal non-deterministic cellular automaton, but no universal stochastic cellular automaton. Yet we provide stochastic cellular automata achieving optimal partial universality.

cs.FL↗

arXiv2012

A Type System for the Vectorial Aspect of the Linear-Algebraic Lambda-Calculus

We describe a type system for the linear-algebraic lambda-calculus. The type system accounts for the part of the language emulating linear operators and vectors, i.e. it is able to statically describe the linear combinations of terms resulting from the reduction of programs. This gives rise to an original type theory where types, in the same way as terms, can be superposed into linear combinations. We show that the resulting typed lambda-calculus is strongly normalizing and features a weak subject-reduction.

cs.LO↗