Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physica A Statistical Mechanics and its Applications

A cellular automaton for the signed particle formulation of quantum mechanics

Jean Michel Sellier, Kristina G. Kapanova, Ivan Dimov

Published Nov 1, 2016• 1 citation
Publisher
DOI
10.1016/j.physa.2016.10.061

Related papers

A Possible Explanation of Quantum Mechanics Behavior by a Classical Cellular Automaton Construction

Simon Berkovich

Springer eBooks•Jan 1, 1989•2 citations

A Physically Universal Quantum Cellular Automaton

Luke Schaeffer

Lecture notes in computer science•Jan 1, 2015•7 citations

A quantum cellular automaton for one-dimensional QED

Pablo J. Arrighi, Cédric Bény, Terry Farrelly

arXiv:1903.07007•Quantum Information Processing•Jan 21, 2020•58 citations

The Quantum Cellular Automaton as a Markov Process

M. Fitzpatrick, K. Smith, Darrin W.S. Belousek +3 more

Chaos Solitons & Fractals•Aug 1, 1999•4 citations

Quantum cellular automaton in 1-D

Darrin W.S. Belousek, E. Henigin, Douglas A. Hott +1 more

Simple algebraic cellular automata and a diffusion confinement are used to model quantum behavior of a relativistic particle in a 1-D box. Comparisons and contrasts are drawn between such a quantum cellular automaton (QCA) and both orthodox and unorthodox interpretations of quantum mechanics. The persistent tension between deterministic pictures and probabilistic descriptions of quantum reality are clarified for the case of a 1-D quantum particle viewed as a cellular automaton surging for survival in space and time.

Chaos Solitons & Fractals•Mar 1, 1994•10 citations

A Perturbative Approach to the Solution of the Thirring Quantum Cellular Automaton

Alessandro Bisio, Paolo Perinotti, Andrea Pizzamiglio +1 more

The Thirring Quantum Cellular Automaton (QCA) describes the discrete time dynamics of local fermionic modes that evolve according to one step of the Dirac cellular automaton, followed by the most general on-site number-preserving interaction, and serves as the QCA counterpart of the Thirring model in quantum field theory. In this work, we develop perturbative techniques for the QCA path sum approach, expanding both the number of interaction vertices and the mass parameter of the Thirring QCA. By classifying paths within the regimes of very light and very heavy particles, we computed the transition amplitudes in the two- and three-particle sectors to the first few orders. Our investigation into the properties of the Thirring QCA, addressing the combinatorial complexity of the problem, yielded some useful results applicable to the many-particle sector of any on-site number-preserving interactions in one spatial dimension.

arXiv:2406.19917•Entropy•Feb 13, 2025•2 citations
Simple algebraic cellular automata and a diffusion confinement are used to model quantum behavior of a relativistic particle in a 1-D box. Comparisons and contrasts are drawn between such a quantum cellular automaton (QCA) and both orthodox and unorthodox interpretations of quantum mechanics. The persistent tension between deterministic pictures and probabilistic descriptions of quantum reality are clarified for the case of a 1-D quantum particle viewed as a cellular automaton surging for survival in space and time.
The Thirring Quantum Cellular Automaton (QCA) describes the discrete time dynamics of local fermionic modes that evolve according to one step of the Dirac cellular automaton, followed by the most general on-site number-preserving interaction, and serves as the QCA counterpart of the Thirring model in quantum field theory. In this work, we develop perturbative techniques for the QCA path sum approach, expanding both the number of interaction vertices and the mass parameter of the Thirring QCA. By classifying paths within the regimes of very light and very heavy particles, we computed the transition amplitudes in the two- and three-particle sectors to the first few orders. Our investigation into the properties of the Thirring QCA, addressing the combinatorial complexity of the problem, yielded some useful results applicable to the many-particle sector of any on-site number-preserving interactions in one spatial dimension.