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:2011.04287 · Physical Review A

Coarse-grained quantum cellular automata

O. Duranthon, Giuseppe Di Molfetta

Published Mar 29, 2021• 10 citations
arXivHTMLPDF

Abstract

One can think of some physical evolutions as being the emergent-effective result of a microscopic discrete model. Inspired by classical coarse-graining procedures, we provide a simple procedure to coarse-grain color-blind quantum cellular automata that follow the so-called Goldilocks rules. The procedure consists in (i) space-time grouping the quantum cellular automaton (QCA) in cells of size $N$; (ii) projecting the states of a cell onto its borders, connecting them with the fine dynamics; (iii) describing the overall dynamics by the border states, that we call signals; and (iv) constructing the coarse-grained dynamics for different sizes $N$ of the cells. A by-product of this simple toy model is a general discrete analogous of the Stokes law. Moreover we prove that in the space-time limit, the automaton converges to a Dirac free Hamiltonian. The QCA we introduce here can be implemented by present-day quantum platforms, such as Rydberg arrays, trapped ions, and superconducting qubits. We hope our study can pave the way to a richer understanding of those systems with limited resolution.

DOI
10.1103/physreva.103.032224

Related papers

Renormalisation of Quantum Cellular Automata

Lorenzo Siro Trezzini, Alessandro Bisio, Paolo Perinotti

We study a coarse-graining procedure for quantum cellular automata on hypercubic lattices that consists in grouping neighboring cells into tiles and selecting a subspace within each tile. This is done in such a way that multiple evolution steps applied to this subspace can be viewed as a single evolution step of a new quantum cellular automaton, whose cells are the subspaces themselves. We derive a necessary and sufficient condition for renormalizability and use it to investigate the renormalization flow of cellular automata on a line, where the cells are qubits and the tiles are composed of two neighboring cells. The problem is exhaustively solved, and the fixed points of the renormalization flow are highlighted.

arXiv:2407.12652•Quantum•May 28, 2025•4 citations

Dirac Cellular Automaton from Split-step Quantum Walk

Arindam Mallick, C. M. Chandrashekar

Simulations of one quantum system by an other has an implication in realization of quantum machine that can imitate any quantum system and solve problems that are not accessible to classical computers. One of the approach to engineer quantum simulations is to discretize the space-time degree of freedom in quantum dynamics and define the quantum cellular automata (QCA), a local unitary update rule on a lattice. Different models of QCA are constructed using set of conditions which are not unique and are not always in implementable configuration on any other system. Dirac Cellular Automata (DCA) is one such model constructed for Dirac Hamiltonian (DH) in free quantum field theory. Here, starting from a split-step discrete-time quantum walk (QW) which is uniquely defined for experimental implementation, we recover the DCA along with all the fine oscillations in position space and bridge the missing connection between DH-DCA-QW. We will present the contribution of the parameters resulting in the fine oscillations on the Zitterbewegung frequency and entanglement. The tuneability of the evolution parameters demonstrated in experimental implementation of QW will establish it as an efficient tool to design quantum simulator and approach quantum field theory from principles of quantum information theory.

arXiv:1509.08851•Scientific Reports•May 17, 2016•44 citations

Integrability of Goldilocks quantum cellular automata

Logan Edward Hillberry, Lorenzo Piroli, Eric Vernier +3 more

Abstract Goldilocks quantum cellular automata (QCA) have been simulated on quantum hardware and produce emergent small-world correlation networks. In Goldilocks QCA, a single-qubit unitary is applied to each qubit in a one-dimensional chain subject to a balance constraint: a qubit is updated if its neighbors are in different computational-basis states. We prove that a subclass of Goldilocks QCA, including the QCA implemented experimentally, map to free fermions and therefore can be simulated classically. We support this claim with two proofs, one involving a Jordan–Wigner transformation and one mapping the integrable six-vertex model to QCA. We compute local conserved quantities of these QCA and predict experimentally measurable expectation values. These calculations can be applied to test large digital quantum computers. In contrast, typical Goldilocks QCA have equilibration properties and quasienergy-level statistics that suggest nonintegrability. Still, each of the latter QCA conserves one quantity useful for error mitigation. Our work yields a parametric quantum circuit with tunable integrability properties useful for testing quantum hardware.

arXiv:2404.02994•Quantum Science and Technology•Mar 26, 2026•6 citations

Small-world complex network generation on a digital quantum processor

Eric B. Jones, Logan Edward Hillberry, Matthew Timothy Jones +9 more

Quantum cellular automata (QCA) evolve qubits in a quantum circuit depending only on the states of their neighborhoods and model how rich physical complexity can emerge from a simple set of underlying dynamical rules. The inability of classical computers to simulate large quantum systems hinders the elucidation of quantum cellular automata, but quantum computers offer an ideal simulation platform. Here, we experimentally realize QCA on a digital quantum processor, simulating a one-dimensional Goldilocks rule on chains of up to 23 superconducting qubits. We calculate calibrated and error-mitigated population dynamics and complex network measures, which indicate the formation of small-world mutual information networks. These networks decohere at fixed circuit depth independent of system size, the largest of which corresponding to 1,056 two-qubit gates. Such computations may enable the employment of QCA in applications like the simulation of strongly-correlated matter or beyond-classical computational demonstrations.

arXiv:2111.00167•Nature Communications•Aug 2, 2022•22 citations

Quantum Cellular Automata: Theory and Applications

Pérez Delgado, Carlos Alberto Conceição António

This thesis presents a model of Quantum Cellular Automata (QCA). The presented formalism is a natural quantization of the classical Cellular Automata (CA). It is based on a lattice of qudits, and an update rule consisting of local unitary operators that commute with their own lattice translations. One purpose of this model is to act as a theoretical model of quantum computation, similar to the quantum circuit model. The main advantage that QCA have over quantum circuits is that QCA make considerably fewer demands on the underlying hardware. In particular, as opposed to direct implementations of quantum circuits, the global evolution of the lattice in the QCA model does not assume independent control over individual \emph{qudits}. Rather, all qudits are to be addressed collectively in parallel. The QCA model is also shown to be an appropriate abstraction for space-homogeneous quantum phenomena, such as quantum lattice gases, spin chains and others. Some results that show the benefits of basing the model on local unitary operators are shown: computational universality, strong connections to the circuit model, simple implementation on quantum hardware, and a series of applications. A detailed discussion will be given on one particular application of QCA that lies outside either computation or simulation: single-spin measurement. This algorithm uses the techniques developed in this thesis to achieve a result normally considered hard in physics. It serves well as an example of why QCA are interesting in their own right.

•Sep 26, 2007•4 citations

The classical limit of quantum mechanics through coarse-grained measurements

Fatemeh Bibak, Carlo Cepollaro, Nicolás Medina Sánchez +2 more

Understanding how classical physics emerges from quantum mechanics remains a central problem in the foundations of physics. Here we derive a classical limit from finite-resolution measurements, modeled by continuous coarse-grained POVMs. When the resolved phase-space area is large compared with Planck's constant, the accessible statistics of any quantum state admit an effective classical description: coarse-grained observables become approximately jointly measurable and the induced probability density is positive. We derive the exact evolution equation for this density and show that, in the strong coarse-graining regime, its non-Liouville corrections are suppressed up to an Ehrenfest time, resulting in classical Hamiltonian flow generated by a Hamiltonian smoothed over the measurement cell. When the Hamiltonian varies negligibly across such a cell, the smoothed Hamiltonian reduces to the classical Hamiltonian whose quantization produced the quantum dynamics, thereby closing the quantization--classical-limit loop. Repeated finite-resolution measurements then generate stochastic records confined, with high probability, to tubes around classical trajectories. Our results provide a unified operational framework for the quantum-to-classical transition in microscopic and macroscopic systems, and establish the consistency of the quantization--classical-limit cycle.

arXiv:2503.15642•Mar 19, 2025•9 citations
One can think of some physical evolutions as being the emergent-effective result of a microscopic discrete model. Inspired by classical coarse-graining procedures, we provide a simple procedure to coarse-grain color-blind quantum cellular automata that follow the so-called Goldilocks rules. The procedure consists in (i) space-time grouping the quantum cellular automaton (QCA) in cells of size NNN; (ii) projecting the states of a cell onto its borders, connecting them with the fine dynamics; (iii) describing the overall dynamics by the border states, that we call signals; and (iv) constructing the coarse-grained dynamics for different sizes NNN of the cells. A by-product of this simple toy model is a general discrete analogous of the Stokes law. Moreover we prove that in the space-time limit, the automaton converges to a Dirac free Hamiltonian. The QCA we introduce here can be implemented by present-day quantum platforms, such as Rydberg arrays, trapped ions, and superconducting qubits. We hope our study can pave the way to a richer understanding of those systems with limited resolution.
We study a coarse-graining procedure for quantum cellular automata on hypercubic lattices that consists in grouping neighboring cells into tiles and selecting a subspace within each tile. This is done in such a way that multiple evolution steps applied to this subspace can be viewed as a single evolution step of a new quantum cellular automaton, whose cells are the subspaces themselves. We derive a necessary and sufficient condition for renormalizability and use it to investigate the renormalization flow of cellular automata on a line, where the cells are qubits and the tiles are composed of two neighboring cells. The problem is exhaustively solved, and the fixed points of the renormalization flow are highlighted.
Simulations of one quantum system by an other has an implication in realization of quantum machine that can imitate any quantum system and solve problems that are not accessible to classical computers. One of the approach to engineer quantum simulations is to discretize the space-time degree of freedom in quantum dynamics and define the quantum cellular automata (QCA), a local unitary update rule on a lattice. Different models of QCA are constructed using set of conditions which are not unique and are not always in implementable configuration on any other system. Dirac Cellular Automata (DCA) is one such model constructed for Dirac Hamiltonian (DH) in free quantum field theory. Here, starting from a split-step discrete-time quantum walk (QW) which is uniquely defined for experimental implementation, we recover the DCA along with all the fine oscillations in position space and bridge the missing connection between DH-DCA-QW. We will present the contribution of the parameters resulting in the fine oscillations on the Zitterbewegung frequency and entanglement. The tuneability of the evolution parameters demonstrated in experimental implementation of QW will establish it as an efficient tool to design quantum simulator and approach quantum field theory from principles of quantum information theory.
Abstract Goldilocks quantum cellular automata (QCA) have been simulated on quantum hardware and produce emergent small-world correlation networks. In Goldilocks QCA, a single-qubit unitary is applied to each qubit in a one-dimensional chain subject to a balance constraint: a qubit is updated if its neighbors are in different computational-basis states. We prove that a subclass of Goldilocks QCA, including the QCA implemented experimentally, map to free fermions and therefore can be simulated classically. We support this claim with two proofs, one involving a Jordan–Wigner transformation and one mapping the integrable six-vertex model to QCA. We compute local conserved quantities of these QCA and predict experimentally measurable expectation values. These calculations can be applied to test large digital quantum computers. In contrast, typical Goldilocks QCA have equilibration properties and quasienergy-level statistics that suggest nonintegrability. Still, each of the latter QCA conserves one quantity useful for error mitigation. Our work yields a parametric quantum circuit with tunable integrability properties useful for testing quantum hardware.
Quantum cellular automata (QCA) evolve qubits in a quantum circuit depending only on the states of their neighborhoods and model how rich physical complexity can emerge from a simple set of underlying dynamical rules. The inability of classical computers to simulate large quantum systems hinders the elucidation of quantum cellular automata, but quantum computers offer an ideal simulation platform. Here, we experimentally realize QCA on a digital quantum processor, simulating a one-dimensional Goldilocks rule on chains of up to 23 superconducting qubits. We calculate calibrated and error-mitigated population dynamics and complex network measures, which indicate the formation of small-world mutual information networks. These networks decohere at fixed circuit depth independent of system size, the largest of which corresponding to 1,056 two-qubit gates. Such computations may enable the employment of QCA in applications like the simulation of strongly-correlated matter or beyond-classical computational demonstrations.
This thesis presents a model of Quantum Cellular Automata (QCA). The presented formalism is a natural quantization of the classical Cellular Automata (CA). It is based on a lattice of qudits, and an update rule consisting of local unitary operators that commute with their own lattice translations. One purpose of this model is to act as a theoretical model of quantum computation, similar to the quantum circuit model. The main advantage that QCA have over quantum circuits is that QCA make considerably fewer demands on the underlying hardware. In particular, as opposed to direct implementations of quantum circuits, the global evolution of the lattice in the QCA model does not assume independent control over individual \emph{qudits}. Rather, all qudits are to be addressed collectively in parallel. The QCA model is also shown to be an appropriate abstraction for space-homogeneous quantum phenomena, such as quantum lattice gases, spin chains and others. Some results that show the benefits of basing the model on local unitary operators are shown: computational universality, strong connections to the circuit model, simple implementation on quantum hardware, and a series of applications. A detailed discussion will be given on one particular application of QCA that lies outside either computation or simulation: single-spin measurement. This algorithm uses the techniques developed in this thesis to achieve a result normally considered hard in physics. It serves well as an example of why QCA are interesting in their own right.
Understanding how classical physics emerges from quantum mechanics remains a central problem in the foundations of physics. Here we derive a classical limit from finite-resolution measurements, modeled by continuous coarse-grained POVMs. When the resolved phase-space area is large compared with Planck's constant, the accessible statistics of any quantum state admit an effective classical description: coarse-grained observables become approximately jointly measurable and the induced probability density is positive. We derive the exact evolution equation for this density and show that, in the strong coarse-graining regime, its non-Liouville corrections are suppressed up to an Ehrenfest time, resulting in classical Hamiltonian flow generated by a Hamiltonian smoothed over the measurement cell. When the Hamiltonian varies negligibly across such a cell, the smoothed Hamiltonian reduces to the classical Hamiltonian whose quantization produced the quantum dynamics, thereby closing the quantization--classical-limit loop. Repeated finite-resolution measurements then generate stochastic records confined, with high probability, to tubes around classical trajectories. Our results provide a unified operational framework for the quantum-to-classical transition in microscopic and macroscopic systems, and establish the consistency of the quantization--classical-limit cycle.