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

Journal of Physics Communications

Fundamental collapse in cellular automaton process

Yehuda Gavriel Roth

Published Mar 22, 2019• 6 citations
Publisher

Abstract

In this paper, we show that quantum states and operators are well-adapted to describe a cellular automaton (CA) process. Using quantum mechanical terminology, we reveal a fundamental collapse that is naturally embedded in the CA evolution. We further suggest that our formalism can be useful in the field of artificial intelligence.
DOI
10.1088/2399-6528/ab128d

Related papers

Quantum State Collapse as a Cellular Automaton Algorithm

Jincheng Zhang

Quantum state collapse is a fundamental process in quantum mechanics, representing the irreversible loss of information upon measurement. This paper explores the potential of utilizing a cellular automata (CA) framework to model and simulate this collapse, offering a novel approach to understanding and potentially manipulating quantum evolution. We formalize collapse as a dynamic process governed by specific rules and feedback loops, enabling the simulation of complex quantum patterns. We propose a CA-based model that incorporates the probabilistic nature of quantum mechanics, allowing for a more intuitive and potentially controllable simulation of quantum phenomena. The core mechanism focuses on systematically evolving the system's state space, mirroring the collapse process and highlighting the interplay between initial conditions and emergent behavior. This work provides a foundational step in exploring the application of CA algorithms to complex quantum systems, opening avenues for future research in quantum simulation and understanding.

•Sep 6, 2026•0 citations

Concise Description of the CA Interpretation

Gerard ’t Hooft

Even if we still face problems in formulating concise theories that explain the resolution of various apparent paradoxes, one may simply assume such a theory to exist, and that it will one day be found. This leads to the CA (Cellular Automaton) Interpretation. We now formulate the rules. The universe has a wave function, which, in terms of the classical degrees of freedom, collapses continuously, yet fully in agreement with Schrödinger’s equation. We formulate how to look at various notoriously ‘quantum mechanical’ phenomena, such as superposition, exponential decay, and the double slit experiment. What can we say about the ‘quantum computer’? These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Fundamental theories of physics•Jan 1, 2016•0 citations

Quantum State Collapse as a Cellular Automata Algorithm

Jincheng Zhang

This paper explores the concept of quantum state collapse as a cellular automata algorithm, providing a novel framework for understanding and modeling this fundamental phenomenon. We propose a model where the evolution of a quantum state is governed by a set of differential equations, driven by a series of rules and feedback loops, mimicking the collapse of a quantum state. The core claim is that this approach offers a mathematically rigorous and potentially insightful way to simulate and analyze the collapse process, providing a bridge between quantum mechanics and cellular automata. The paper details the mathematical formulation, explores its implications for understanding quantum information processing, and discusses potential applications within the context of quantum simulation and early-stage quantum computing.

•Aug 31, 2026•0 citations

Quantization of Cellular Automata

Pablo J. Arrighi, Vincent Nesme

Take a cellular automaton, consider that each configuration is a basis vector in some vector space, and linearize the global evolution function. If lucky, the r esult could actually make sense physically, as a valid quantum evolution; but do es it make sense as a quantum cellular automaton? That is the main question we a ddress in this paper. In every model with discrete time and space, two things ar e required in order to qualify as a cellular automaton: invariance by translatio n and locality. We prove that this locality condition is so restrictive in the q uantum case that every quantum cellular automaton constructed in this way - i. e., by linearization of a classical one - must be reversible. We also discuss some subtleties about the extent of nonlocality that can be encountered in the o ne-dimensional case; we show that, even when the quantized version is non local, still, under some conditions, we may be unable to use this nonlocality to trans mit information nonlocally.

arXiv:0903.0258•Mar 2, 2009•1 citation

Statistical properties of a quantum cellular automaton

Norio Inui, Shuichi Inokuchi, Yoshihiro Mizoguchi +1 more

We study a quantum cellular automaton (QCA) whose time evolution is defined using the global transition function of a classical cellular automaton (CA). In order to investigate natural transformations from CAs to QCAs, the present QCA includes the CA with Wolfram's rules 150 and 105 as special cases. We first compute the time evolution of the QCA and examine its statistical properties. As a basic statistical value, the probability of finding an active cell averaged over spatial-temporal space is introduced, and the difference between the CA and QCA is considered. In addition, it is shown that statistical properties in QCAs are related to the classical trajectory in configuration space.

arXiv:quant-ph/0504104•Physical Review A•Sep 16, 2005•8 citations

The emergence of quantum mechanics

Gerard ’t Hooft

It is pointed out that a mathematical relation exists between cellular automata and quantum field theories. Although the proofs are far from perfect, they do suggest a new look at the origin of quantum mechanics: quantum mechanics may be nothing but a natural way to handle the statistical correlations of a cellular automaton. An essential role for the gravitational force in these considerations is suspected.

AIP conference proceedings•Jan 1, 2012•8 citations
Quantum state collapse is a fundamental process in quantum mechanics, representing the irreversible loss of information upon measurement. This paper explores the potential of utilizing a cellular automata (CA) framework to model and simulate this collapse, offering a novel approach to understanding and potentially manipulating quantum evolution. We formalize collapse as a dynamic process governed by specific rules and feedback loops, enabling the simulation of complex quantum patterns. We propose a CA-based model that incorporates the probabilistic nature of quantum mechanics, allowing for a more intuitive and potentially controllable simulation of quantum phenomena. The core mechanism focuses on systematically evolving the system's state space, mirroring the collapse process and highlighting the interplay between initial conditions and emergent behavior. This work provides a foundational step in exploring the application of CA algorithms to complex quantum systems, opening avenues for future research in quantum simulation and understanding.
Even if we still face problems in formulating concise theories that explain the resolution of various apparent paradoxes, one may simply assume such a theory to exist, and that it will one day be found. This leads to the CA (Cellular Automaton) Interpretation. We now formulate the rules. The universe has a wave function, which, in terms of the classical degrees of freedom, collapses continuously, yet fully in agreement with Schrödinger’s equation. We formulate how to look at various notoriously ‘quantum mechanical’ phenomena, such as superposition, exponential decay, and the double slit experiment. What can we say about the ‘quantum computer’? These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This paper explores the concept of quantum state collapse as a cellular automata algorithm, providing a novel framework for understanding and modeling this fundamental phenomenon. We propose a model where the evolution of a quantum state is governed by a set of differential equations, driven by a series of rules and feedback loops, mimicking the collapse of a quantum state. The core claim is that this approach offers a mathematically rigorous and potentially insightful way to simulate and analyze the collapse process, providing a bridge between quantum mechanics and cellular automata. The paper details the mathematical formulation, explores its implications for understanding quantum information processing, and discusses potential applications within the context of quantum simulation and early-stage quantum computing.
Take a cellular automaton, consider that each configuration is a basis vector in some vector space, and linearize the global evolution function. If lucky, the r esult could actually make sense physically, as a valid quantum evolution; but do es it make sense as a quantum cellular automaton? That is the main question we a ddress in this paper. In every model with discrete time and space, two things ar e required in order to qualify as a cellular automaton: invariance by translatio n and locality. We prove that this locality condition is so restrictive in the q uantum case that every quantum cellular automaton constructed in this way - i. e., by linearization of a classical one - must be reversible. We also discuss some subtleties about the extent of nonlocality that can be encountered in the o ne-dimensional case; we show that, even when the quantized version is non local, still, under some conditions, we may be unable to use this nonlocality to trans mit information nonlocally.
We study a quantum cellular automaton (QCA) whose time evolution is defined using the global transition function of a classical cellular automaton (CA). In order to investigate natural transformations from CAs to QCAs, the present QCA includes the CA with Wolfram's rules 150 and 105 as special cases. We first compute the time evolution of the QCA and examine its statistical properties. As a basic statistical value, the probability of finding an active cell averaged over spatial-temporal space is introduced, and the difference between the CA and QCA is considered. In addition, it is shown that statistical properties in QCAs are related to the classical trajectory in configuration space.