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

Duality between a deterministic cellular automaton and a bosonic quantum field theory in 1+1 dimensions

Gerard ’t Hooft, Theoretical Physics, Faculteit Betawetenschappen, Sub String Theory Cosmology and ElemPart

Published May 1, 2013• 15 citations
OpenAlex

Abstract

Methods developed in a previous paper are employed to define an exact correspondence between the states of a deterministic cellular automaton in 1+1 dimensions and those of a bosonic quantum field theory. The result may be used to argue that quantum field theories may be much closer related to deterministic automata than what is usually thought possible. Version 2 had a minor typo corrected and notation was made more consistent.

Related papers

Duality Between a Deterministic Cellular Automaton and a Bosonic Quantum Field Theory in 1+1 Dimensions

Gerard ’t Hooft

arXiv:1205.4107•Foundations of Physics•Feb 4, 2013•6 citations

Fermionic and bosonic quantum field theories from quantum cellular automata in three spatial dimensions

Leonard D. Mlodinow, Todd A. Brun

The authors present the construction of cellular automaton models corresponding to free quantum field theories for both fermions and bosons, and demonstrate that for wavelengths long compared to the lattice spacing one recovers standard Dirac and Maxwell field theories. Correspondences such as this offer a new way of thinking about quantum field theories, and potentially a new way of simulating them on quantum computers.

arXiv:2011.05597•Physical Review A•May 7, 2021•12 citations

From Quantum Cellular Automata To Quantum Lattice Gases

DAVID A. MEYER, From Qca, Qlga David +1 more

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 no nontrivial, homogeneous, local, unitary, scalar cellular automaton in one dimension, we weaken the homogeneity condition and show that there are nontrivial, exactly unitary, partitioning cellular automata. We find a one parameter family of evolution rules which are best interpreted as those for a one particle quantum automaton. This model is naturally reformulated as a two component cellular automaton which we demonstrate to limit to the Dirac equation. We describe two generalizations of this automaton, the second of which, to multiple interacting particles, is the correct definition of a quantum lattice gas. KEY WORDS: quantum cellular automaton; quantum lattice gas; quantum computation. to appear in J. Stat. Phys.

•Jan 1, 1996•458 citations

Quantum cellular automata and quantum field theory in two spatial dimensions

Todd A. Brun, Leonard D. Mlodinow

Quantum walks on lattices can give rise to one-particle relativistic wave equations in the long-wavelength limit. In going to multiple particles, quantum cellular automata (QCA) are natural generalizations of quantum walks. In one spatial dimension, the quantum walk can be ``promoted'' to a QCA that, in the long-wavelength limit, gives rise to the Dirac quantum field theory (QFT) for noninteracting fermions. This QCA/QFT correspondence has both theoretical and practical applications, but there are obstacles to similar constructions in two or more spatial dimensions. Here we show that a method of construction employing distinguishable particles confined to the completely antisymmetric subspace yields a QCA in two spatial dimensions that gives rise to the two-dimensional (2D) Dirac QFT. Generalizing to 3D will entail some additional complications, but no conceptual barriers. We examine how this construction evades the ``no-go'' results in earlier work.

arXiv:2010.09104•Physical Review A•Dec 30, 2020•19 citations

Physics as Quantum Information Processing: Quantum Fields as Quantum Automata

Giacomo Mauro D’Ariano

Can we reduce Quantum Field Theory (QFT) to a quantum computation? Can physics be simulated by a quantum computer? Do we believe that a quantum field is ultimately made of a numerable set of quantum systems that are unitarily interacting? A positive answer to these questions corresponds to substituting QFT with a theory of quantum cellular automata (QCA), and the present work is examining this hypothesis. These investigations are part of a large research program on a "quantum-digitalization" of physics, with Quantum Theory as a special theory of information, and Physics as emergent from the same quantum-information processing. A QCA-based QFT has tremendous potential advantages compared to QFT, being quantum "ab-initio" and free from the problems plaguing QFT due to the continuum hypothesis. Here I will show how dynamics emerges from the quantum processing, how the QCA can reproduce the Dirac-field phenomenology at large scales, and the kind of departures from QFT that that should be expected at a Planck-scale discreteness. I will introduce the notions of linear field quantum automaton and local-matrix quantum automaton, in terms of which I will provide the solution to the Feynman's problem about the possibility of simulating a Fermi field with a quantum computer.

arXiv:1110.6725•Oct 31, 2011•4 citations

Physics as quantum information processing: Quantum fields as quantum automata

Giacomo Mauro D’Ariano

Can we reduce Quantum Field Theory (QFT) to a quantum computation? Can physics be simulated by a quantum computer? Do we believe that a quantum field is ultimately made of a numerable set of quantum systems that are unitarily interacting? A positive answer to these questions corresponds to substituting QFT with a theory of quantum cellular automata (QCA), and the present work is examining this hypothesis. These investigations are part of a large research program on a quantum-digitalization of physics, with Quantum Theory as a special theory of information, and Physics as emergent from the same quantum-information processing. A QCA-based QFT has tremendous potential advantages compared to QFT, being quantum ab-initio and free from the problems plaguing QFT due to the continuum hypothesis. Here I will show how dynamics emerges from the quantum processing, how the QCA can reproduce the Dirac-field phenomenology at large scales, and the kind of departures from QFT that that should be expected at a Planckscale discreteness. I will introduce the notions of linear field quantum automaton and local-matrix quantum automaton, in terms of which I will provide the solution to the Feynman's problem about the possibility of simulating a Fermi field with a quantum computer.

AIP conference proceedings•Jan 1, 2012•10 citations
Methods developed in a previous paper are employed to define an exact correspondence between the states of a deterministic cellular automaton in 1+1 dimensions and those of a bosonic quantum field theory. The result may be used to argue that quantum field theories may be much closer related to deterministic automata than what is usually thought possible. Version 2 had a minor typo corrected and notation was made more consistent.
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 no nontrivial, homogeneous, local, unitary, scalar cellular automaton in one dimension, we weaken the homogeneity condition and show that there are nontrivial, exactly unitary, partitioning cellular automata. We find a one parameter family of evolution rules which are best interpreted as those for a one particle quantum automaton. This model is naturally reformulated as a two component cellular automaton which we demonstrate to limit to the Dirac equation. We describe two generalizations of this automaton, the second of which, to multiple interacting particles, is the correct definition of a quantum lattice gas. KEY WORDS: quantum cellular automaton; quantum lattice gas; quantum computation. to appear in J. Stat. Phys.
Quantum walks on lattices can give rise to one-particle relativistic wave equations in the long-wavelength limit. In going to multiple particles, quantum cellular automata (QCA) are natural generalizations of quantum walks. In one spatial dimension, the quantum walk can be ``promoted'' to a QCA that, in the long-wavelength limit, gives rise to the Dirac quantum field theory (QFT) for noninteracting fermions. This QCA/QFT correspondence has both theoretical and practical applications, but there are obstacles to similar constructions in two or more spatial dimensions. Here we show that a method of construction employing distinguishable particles confined to the completely antisymmetric subspace yields a QCA in two spatial dimensions that gives rise to the two-dimensional (2D) Dirac QFT. Generalizing to 3D will entail some additional complications, but no conceptual barriers. We examine how this construction evades the ``no-go'' results in earlier work.
Can we reduce Quantum Field Theory (QFT) to a quantum computation? Can physics be simulated by a quantum computer? Do we believe that a quantum field is ultimately made of a numerable set of quantum systems that are unitarily interacting? A positive answer to these questions corresponds to substituting QFT with a theory of quantum cellular automata (QCA), and the present work is examining this hypothesis. These investigations are part of a large research program on a "quantum-digitalization" of physics, with Quantum Theory as a special theory of information, and Physics as emergent from the same quantum-information processing. A QCA-based QFT has tremendous potential advantages compared to QFT, being quantum "ab-initio" and free from the problems plaguing QFT due to the continuum hypothesis. Here I will show how dynamics emerges from the quantum processing, how the QCA can reproduce the Dirac-field phenomenology at large scales, and the kind of departures from QFT that that should be expected at a Planck-scale discreteness. I will introduce the notions of linear field quantum automaton and local-matrix quantum automaton, in terms of which I will provide the solution to the Feynman's problem about the possibility of simulating a Fermi field with a quantum computer.
Can we reduce Quantum Field Theory (QFT) to a quantum computation? Can physics be simulated by a quantum computer? Do we believe that a quantum field is ultimately made of a numerable set of quantum systems that are unitarily interacting? A positive answer to these questions corresponds to substituting QFT with a theory of quantum cellular automata (QCA), and the present work is examining this hypothesis. These investigations are part of a large research program on a quantum-digitalization of physics, with Quantum Theory as a special theory of information, and Physics as emergent from the same quantum-information processing. A QCA-based QFT has tremendous potential advantages compared to QFT, being quantum ab-initio and free from the problems plaguing QFT due to the continuum hypothesis. Here I will show how dynamics emerges from the quantum processing, how the QCA can reproduce the Dirac-field phenomenology at large scales, and the kind of departures from QFT that that should be expected at a Planckscale discreteness. I will introduce the notions of linear field quantum automaton and local-matrix quantum automaton, in terms of which I will provide the solution to the Feynman's problem about the possibility of simulating a Fermi field with a quantum computer.