English
Related papers

Related papers: Discreteness and Determinism in Superstrings

200 papers

A class of fermionic quantum field theories with interactions is shown to be equivalent to probabilistic cellular automata, namely cellular automata with a probability distribution for the initial states. Probabilistic cellular automata on…

High Energy Physics - Lattice · Physics 2022-04-20 C. Wetterich

When investigating theories at the tiniest conceivable scales in nature, almost all researchers today revert to the quantum language, accepting the verdict from the Copenhagen doctrine that the only way to describe what is going on will…

Quantum Physics · Physics 2015-12-22 Gerard 't Hooft

We build a quantum cellular automaton (QCA) which coincides with 1+1 QED on its known continuum limits. It consists in a circuit of unitary gates driving the evolution of particles on a one dimensional lattice, and having them interact with…

Quantum Physics · Physics 2022-01-21 Kevissen Sellapillay , Pablo Arrighi , Giuseppe Di Molfetta

Cornerstones of the Cellular Automaton Interpretation of Quantum Mechanics are its ontological states that evolve by permutations, in this way never creating would-be quantum mechanical superposition states. We review and illustrate this…

Quantum Physics · Physics 2024-11-06 Hans-Thomas Elze

Using the reduced formulation on large-N Quantum Field Theories we study strings in space-time dimensions higher that one. We present results on possible string susceptibilities, macroscopic loop operators, 1/N -corrections and other…

High Energy Physics - Theory · Physics 2009-10-22 L. Alvarez-Gaume , J. L. F. Barbon , C. Crnkovic

Redefining the vacuum state of a free twofold N=1 covariant supersymmetric string action as the one with all the world sheet fermionic excited states occupied, makes the theory anomaly free in D=4 with Minkowski signature. The theory thus…

High Energy Physics - Theory · Physics 2007-06-21 J. S. Bhattacharyya , Gautam Bhattacharya

A Quantum Cellular Automaton (QCA) is essentially an operator driving the evolution of particles on a lattice, through local unitaries. Because $\Delta_t=\Delta_x = \epsilon$, QCAs constitute a privileged framework to cast the digital…

Quantum Physics · Physics 2026-01-21 Dogukan Bakircioglu , Pablo Arnault , Pablo Arrighi

String theory and supersymmetry are theoretical ideas that go beyond the standard model of particle physics and show promise for unifying all forces. After a brief introduction to supersymmetry, we discuss the prospects for its experimental…

High Energy Physics - Theory · Physics 2008-11-26 John H. Schwarz , Nathan Seiberg

This paper fires the opening salvo in the systematic construction of the lattice-continuum correspondence, a precise dictionary that describes the emergence of continuum quantum theories from finite, nonperturbatively defined models…

High Energy Physics - Theory · Physics 2021-08-31 Djordje Radicevic

Long strings emerge in many Quantum Field Theories, for example as vortices in Abelian Higgs theories, or flux tubes in Yang-Mills theories. The actions of such objects can be expanded in the number of derivatives, around a long straight…

High Energy Physics - Theory · Physics 2019-02-20 Tomer Solberg , Mykhailo Yutushui

We discuss the role of classical control in the context of reversible quantum cellular automata. Employing the structure theorem for quantum cellular automata, we give a general construction scheme to turn an arbitrary cellular automaton…

Quantum Physics · Physics 2009-11-11 D. J. Shepherd , T. Franz , R. F. Werner

Let L:=Z^D be a D-dimensional lattice. Let A^L be the Cantor space of L-indexed configurations in a finite alphabet A, with the natural L-action by shifts. A `cellular automaton' is a continuous, shift-commuting self-map F:A^L-->A^L. An…

Dynamical Systems · Mathematics 2009-09-29 Marcus Pivato

We provide algebraic criteria for the unitarity of linear quantum cellular automata, i.e. one dimensional quantum cellular automata. We derive these both by direct combinatorial arguments, and by adding constraints into the model which do…

Quantum Physics · Physics 2017-08-29 Pablo Arrighi

The combination of a vortex line in a one-dimensional optical lattice with fermions bound to the vortex core makes up an ultracold superstring. We give a detailed derivation of the way to make this supersymmetric string in the laboratory.…

Other Condensed Matter · Physics 2014-11-17 Michiel Snoek , S. Vandoren , H. T. C. Stoof

A natural architecture for nanoscale quantum computation is that of a quantum cellular automaton. Motivated by this observation, in this paper we begin an investigation of exactly unitary cellular automata. After proving that there can be…

Quantum Physics · Physics 2009-10-30 David A. Meyer

We describe the ${\cal{O}}({\alpha'}^0)$ constraints on the target space geometry of the $N=(2,1)$ heterotic superstring due to the left-moving $N=1$ supersymmetry and $U(1)$ currents. In the fermionic description of the internal sector…

High Energy Physics - Theory · Physics 2009-10-30 Albion Lawrence

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…

Cellular Automata and Lattice Gases · Physics 2025-12-10 Martin Schaller , Karl Svozil

Using the reduced formulation of large-N Quantum Field Theories we study strings in space-time dimensions higher than one. Some preliminary results concerning the possible string susceptibilities and general properties of the model are…

High Energy Physics - Theory · Physics 2007-05-23 L. Alvarez-Gaume , J. L. F. Barbon

We study fermionic fields localized on topologically unstable domain walls bounded by strings in a grand unified theory theoretical framework. Particularly, we found that the localized fermionic degrees of freedom, which are up and down…

High Energy Physics - Theory · Physics 2015-06-16 V. K. Oikonomou

Reversibility of a one-dimensional finite cellular automaton (CA) is dependent on lattice size. A finite CA can be reversible for a set of lattice sizes. On the other hand, reversibility of an infinite CA, which is decided by exploring the…

Formal Languages and Automata Theory · Computer Science 2019-03-15 Kamalika Bhattacharjee , Sukanta Das