For N > 4r, every 1D quantum cellular automaton of causality radius r is exactly a routed unitary circuit of nearest-neighbour interactions, and translation-invariant automata get translation-invariant circuits.
Weyl, Dirac and Maxwell Quantum Cellular Automata: analitical solutions and phenomenological predictions of the Quantum Cellular Automata Theory of Free Fields
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
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 automata (QCA) theory follows, whose relativistic limit of small wave-vector provides the free dynamics of quantum field theory. The QCA theory can be regarded as an extended quantum field theory that describes in a unified way all scales ranging from an hypothetical discrete Planck scale up to the usual Fermi scale. The present paper reviews the elementary automaton theory for the Weyl field, and the composite automata for Dirac and Maxwell fields. We then give a simple analysis of the dynamics in the momentum space in terms of a dispersive differential equation for narrowband wave-packets, and some account on the position space description in terms of a discrete path-integral approach. We then review the phenomenology of the free-field automaton and consider possible visible effects arising from the discreteness of the framework. We conclude introducing the consequences of the automaton distorted dispersion relation, leading to a deformed Lorentz covariance and to possible effects on the thermodynamics of ideal gases.
citation-role summary
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Causal Decompositions of 1D Quantum Cellular Automata
For N > 4r, every 1D quantum cellular automaton of causality radius r is exactly a routed unitary circuit of nearest-neighbour interactions, and translation-invariant automata get translation-invariant circuits.