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

arXiv:2106.15517 · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences

Quantum fermions from classical bits

CHRISTOF WETTERICH

Published Dec 20, 2021• 7 citations
arXivHTMLPDF

Abstract

A simple probabilistic cellular automaton is shown to be equivalent to a relativistic fermionic quantum field theory with interactions. Occupation numbers for fermions are classical bits or Ising spins. The automaton acts deterministically on bit configurations. The genuinely probabilistic character of quantum physics is realized by probabilistic initial conditions. In turn, the probabilistic automaton is equivalent to the classical statistical system of a generalized Ising model. For a description of the probabilistic information at any given time quantum concepts as wave functions and non-commuting operators for observables emerge naturally. Quantum mechanics can be understood as a particular case of classical statistics. This offers prospects to realize aspects of quantum computing in the form of probabilistic classical computing. This article is part of the theme issue 'Quantum technologies in particle physics'.

DOI
10.1098/rsta.2021.0066

Related papers

Fermionic quantum field theories as probabilistic cellular automata

CHRISTOF WETTERICH

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 a one-dimensional lattice are equivalent to two-dimensional quantum field theories for fermions. They can be viewed as generalized Ising models on a square lattice and therefore as classical statistical systems. As quantum field theories they are quantum systems. Thus quantum mechanics emerges from classical statistics. As an explicit example for an interacting fermionic quantum field theory we describe a type of discretized Thirring model as a cellular automaton. The updating rule of the automaton is encoded in the step evolution operator that can be expressed in terms of fermionic annihilation and creation operators. The complex structure of quantum mechanics is associated to particle-hole transformations. The naive continuum limit exhibits Lorentz symmetry. We exploit the equivalence to quantum field theory in order to show how quantum concepts as wave functions, density matrix, noncommuting operators for observables and similarity transformations are convenient and useful concepts for the description of probabilistic cellular automata.

arXiv:2111.06728•Physical review. D/Physical review. D.•Apr 8, 2022•8 citations

Probabilistic cellular automata for interacting fermionic quantum field theories

CHRISTOF WETTERICH

A classical local cellular automaton can describe an interacting quantum field theory for fermions. We construct a simple classical automaton for a particular version of the Thirring model with imaginary coupling. This interacting fermionic quantum field theory obeys a unitary time evolution and shows all properties of quantum mechanics. Classical cellular automata with probabilistic initial conditions admit a description in the formalism of quantum mechanics. Our model exhibits interesting features as spontaneous symmetry breaking or solitons. The same model can be formulated as a generalized Ising model. This euclidean lattice model can be investigated by standard techniques of statistical physics as Monte Carlo simulations. Our model is an example how quantum mechanics emerges from classical statistics.

arXiv:2007.06366•Nuclear Physics B•Dec 29, 2020•17 citations

Probabilistic cellular automaton for quantum particle in a potential

CHRISTOF WETTERICH

We propose that a quantum particle in a potential in one space dimension can be described by a probabilistic cellular automaton. While the simple updating rule of the automaton is deterministic, the probabilistic description is introduced by a probability distribution over initial conditions. The proposed automaton involves right- and left-movers, jumping from one cell to a neighboring one. They change their direction of motion at each randomly distributed disorder or scattering point. The continuum limit of an infinite number of cells yields a Dirac equation, and in the non-relativistic limit the familiar Schrödinger equation, with potential determined by the spacetime-distribution of scattering points. These equations describe the time evolution of the probabilistic information for the position of the particle. All quantum rules for observables, both for discrete possible measurement values and continuous expectation values, follow from the classical statistical laws.

arXiv:2211.17034•Nov 30, 2022•0 citations

Quantum systems from random probabilistic automata

A. Kreuzkamp, CHRISTOF WETTERICH

Probabilistic cellular automata with deterministic updating are discrete quantum systems. They are characterized by a probability distribution over initial configurations. We employ the quantum formalism for an investigation of random probabilistic cellular automata for which the properties of the deterministic updating are randomly distributed over space and time. We are interested in a possible continuum limit for a very large number of cells or space points. We consider bits with two colors, moving to the left or right on a linear chain. At randomly distributed scattering points they change direction and color. A numerical simulation reveals the typical features of quantum systems. We find particular initial probability distributions which reemerge periodically after a certain number of time steps, as produced by the periodic evolution of energy eigenstates in quantum mechanics. Using a description in terms of wave functions allows us to introduce statistical observables for momentum and energy. They characterize the probabilistic information without taking definite values for a given bit configuration, with a conceptual status similar to temperature in classical statistical thermal equilibrium. Conservation of energy and momentum are essential ingredients for the understanding of the evolution of the stochastic probabilistic automata. This evolution resembles in some aspects a single Dirac fermion in two dimensions with a generalized random potential.

arXiv:2405.09829•Physical Review A•Apr 18, 2025•2 citations

Quantum computing with classical bits

CHRISTOF WETTERICH

A bit-quantum map relates probabilistic information for Ising spins or classical bits to quantum spins or qubits. Quantum systems are subsystems of classical statistical systems. The Ising spins can represent macroscopic two-level observables, and the quantum subsystem employs suitable expectation values and correlations. We discuss static memory materials based on Ising spins for which boundary information can be transported through the bulk in a generalized equilibrium state. They can realize quantum operations as the Hadamard or CNOT-gate for the quantum subsystem. Classical probabilistic systems can account for the entanglement of quantum spins. An arbitrary unitary evolution for an arbitrary number of quantum spins can be described by static memory materials for an infinite number of Ising spins which may, in turn, correspond to continuous variables or fields. We discuss discrete subsets of unitary operations realized by a finite number of Ising spins. They may be useful for new computational structures. We suggest that features of quantum computation or more general probabilistic computation may be realized by neural networks, neuromorphic computing or perhaps even the brain. This does neither require small isolated entities nor very low temperature. In these systems the processing of probabilistic information can be more general than for static memory materials. We propose a general formalism for probabilistic computing for which deterministic computing and quantum computing are special limiting cases.

arXiv:1806.05960•Nuclear Physics B•Sep 26, 2019•14 citations

Complex wave functions, CPT and quantum field theory for classical generalized Ising models

CHRISTOF WETTERICH

The quantum or quantum field theory concept of a complex wave function is useful for understanding the information transport in classical statistical generalized Ising models. We relate complex conjugation to the discrete transformations charge conjugation ( C ), parity ( P ) and time reversal ( T ). A subclass of generalized Ising models are probabilistic cellular automata (PCA) with deterministic updating and probabilistic initial conditions. Simple two-dimensional PCA correspond to discretized quantum field theories for Majorana–Weyl, Weyl or Dirac fermions. Momentum and energy are conserved statistical observables. For PCA describing free massless fermions we investigate the vacuum and field operators for particle excitations. For the correlation function one finds the Lorentz-invariant Feynman propagator of quantum field theory. Furthermore, these automata admit probabilistic boundary conditions that correspond to thermal equilibrium with the quantum Fermi–Dirac distribution. PCA with updating sequences of propagation and interaction steps can realize a rich variety of discrete quantum field theories for fermions with interactions. For information theory the quantum formalism for PCA sheds new light on deterministic computing or signal processing with probabilistic input.

arXiv:2505.24392•Nuclear Physics B•Nov 20, 2025•0 citations
A simple probabilistic cellular automaton is shown to be equivalent to a relativistic fermionic quantum field theory with interactions. Occupation numbers for fermions are classical bits or Ising spins. The automaton acts deterministically on bit configurations. The genuinely probabilistic character of quantum physics is realized by probabilistic initial conditions. In turn, the probabilistic automaton is equivalent to the classical statistical system of a generalized Ising model. For a description of the probabilistic information at any given time quantum concepts as wave functions and non-commuting operators for observables emerge naturally. Quantum mechanics can be understood as a particular case of classical statistics. This offers prospects to realize aspects of quantum computing in the form of probabilistic classical computing. This article is part of the theme issue 'Quantum technologies in particle physics'.
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 a one-dimensional lattice are equivalent to two-dimensional quantum field theories for fermions. They can be viewed as generalized Ising models on a square lattice and therefore as classical statistical systems. As quantum field theories they are quantum systems. Thus quantum mechanics emerges from classical statistics. As an explicit example for an interacting fermionic quantum field theory we describe a type of discretized Thirring model as a cellular automaton. The updating rule of the automaton is encoded in the step evolution operator that can be expressed in terms of fermionic annihilation and creation operators. The complex structure of quantum mechanics is associated to particle-hole transformations. The naive continuum limit exhibits Lorentz symmetry. We exploit the equivalence to quantum field theory in order to show how quantum concepts as wave functions, density matrix, noncommuting operators for observables and similarity transformations are convenient and useful concepts for the description of probabilistic cellular automata.
A classical local cellular automaton can describe an interacting quantum field theory for fermions. We construct a simple classical automaton for a particular version of the Thirring model with imaginary coupling. This interacting fermionic quantum field theory obeys a unitary time evolution and shows all properties of quantum mechanics. Classical cellular automata with probabilistic initial conditions admit a description in the formalism of quantum mechanics. Our model exhibits interesting features as spontaneous symmetry breaking or solitons. The same model can be formulated as a generalized Ising model. This euclidean lattice model can be investigated by standard techniques of statistical physics as Monte Carlo simulations. Our model is an example how quantum mechanics emerges from classical statistics.
We propose that a quantum particle in a potential in one space dimension can be described by a probabilistic cellular automaton. While the simple updating rule of the automaton is deterministic, the probabilistic description is introduced by a probability distribution over initial conditions. The proposed automaton involves right- and left-movers, jumping from one cell to a neighboring one. They change their direction of motion at each randomly distributed disorder or scattering point. The continuum limit of an infinite number of cells yields a Dirac equation, and in the non-relativistic limit the familiar Schrödinger equation, with potential determined by the spacetime-distribution of scattering points. These equations describe the time evolution of the probabilistic information for the position of the particle. All quantum rules for observables, both for discrete possible measurement values and continuous expectation values, follow from the classical statistical laws.
Probabilistic cellular automata with deterministic updating are discrete quantum systems. They are characterized by a probability distribution over initial configurations. We employ the quantum formalism for an investigation of random probabilistic cellular automata for which the properties of the deterministic updating are randomly distributed over space and time. We are interested in a possible continuum limit for a very large number of cells or space points. We consider bits with two colors, moving to the left or right on a linear chain. At randomly distributed scattering points they change direction and color. A numerical simulation reveals the typical features of quantum systems. We find particular initial probability distributions which reemerge periodically after a certain number of time steps, as produced by the periodic evolution of energy eigenstates in quantum mechanics. Using a description in terms of wave functions allows us to introduce statistical observables for momentum and energy. They characterize the probabilistic information without taking definite values for a given bit configuration, with a conceptual status similar to temperature in classical statistical thermal equilibrium. Conservation of energy and momentum are essential ingredients for the understanding of the evolution of the stochastic probabilistic automata. This evolution resembles in some aspects a single Dirac fermion in two dimensions with a generalized random potential.
A bit-quantum map relates probabilistic information for Ising spins or classical bits to quantum spins or qubits. Quantum systems are subsystems of classical statistical systems. The Ising spins can represent macroscopic two-level observables, and the quantum subsystem employs suitable expectation values and correlations. We discuss static memory materials based on Ising spins for which boundary information can be transported through the bulk in a generalized equilibrium state. They can realize quantum operations as the Hadamard or CNOT-gate for the quantum subsystem. Classical probabilistic systems can account for the entanglement of quantum spins. An arbitrary unitary evolution for an arbitrary number of quantum spins can be described by static memory materials for an infinite number of Ising spins which may, in turn, correspond to continuous variables or fields. We discuss discrete subsets of unitary operations realized by a finite number of Ising spins. They may be useful for new computational structures. We suggest that features of quantum computation or more general probabilistic computation may be realized by neural networks, neuromorphic computing or perhaps even the brain. This does neither require small isolated entities nor very low temperature. In these systems the processing of probabilistic information can be more general than for static memory materials. We propose a general formalism for probabilistic computing for which deterministic computing and quantum computing are special limiting cases.
The quantum or quantum field theory concept of a complex wave function is useful for understanding the information transport in classical statistical generalized Ising models. We relate complex conjugation to the discrete transformations charge conjugation ( C ), parity ( P ) and time reversal ( T ). A subclass of generalized Ising models are probabilistic cellular automata (PCA) with deterministic updating and probabilistic initial conditions. Simple two-dimensional PCA correspond to discretized quantum field theories for Majorana–Weyl, Weyl or Dirac fermions. Momentum and energy are conserved statistical observables. For PCA describing free massless fermions we investigate the vacuum and field operators for particle excitations. For the correlation function one finds the Lorentz-invariant Feynman propagator of quantum field theory. Furthermore, these automata admit probabilistic boundary conditions that correspond to thermal equilibrium with the quantum Fermi–Dirac distribution. PCA with updating sequences of propagation and interaction steps can realize a rich variety of discrete quantum field theories for fermions with interactions. For information theory the quantum formalism for PCA sheds new light on deterministic computing or signal processing with probabilistic input.