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:2304.11209 · New Journal of Physics

Dissipative quantum many-body dynamics in (1+1)D quantum cellular automata and quantum neural networks

Mario Boneberg, Federico Carollo, Igor Lesanovsky

Published Aug 14, 2023• 6 citations
arXivHTMLPDF

Abstract

Abstract Classical artificial neural networks, built from elementary units, possess enormous expressive power. Here we investigate a quantum neural network (QNN) architecture, which follows a similar paradigm. It is structurally equivalent to so-called (1+1)D quantum cellular automata, which are two-dimensional quantum lattice systems on which dynamics takes place in discrete time. Information transfer between consecutive time slices—or adjacent network layers—is governed by local quantum gates, which can be regarded as the quantum counterpart of the classical elementary units. Along the time-direction an effective dissipative evolution emerges on the level of the reduced state, and the nature of this dynamics is dictated by the structure of the elementary gates. We show how to construct the local unitary gates to yield a desired many-body dynamics, which in certain parameter regimes is governed by a Lindblad master equation. We study this for small system sizes through numerical simulations and demonstrate how collective effects within the quantum cellular automaton can be controlled parametrically. Our study constitutes a step towards the utilization of large-scale emergent phenomena in large QNNs for machine learning purposes.

DOI
10.1088/1367-2630/aceff4

Related papers

Using (1+1)D quantum cellular automata for exploring collective effects in large-scale quantum neural networks

Edward Gillman, Federico Carollo, Igor Lesanovsky

Central to the field of quantum machine learning is the design of quantum perceptrons and neural network architectures. A key question in this regard is the impact of quantum effects on the way such models process information. Here, we establish a connection between (1+1)D quantum cellular automata, which implement a discrete nonequilibrium quantum many-body dynamics through successive applications of local quantum gates, and quantum neural networks (QNNs), which process information by feeding it through perceptrons interconnecting adjacent layers. Exploiting this link, we construct a class of QNNs that are highly structured-aiding both interpretability and helping to avoid trainability issues in machine learning tasks-yet can be connected rigorously to continuous-time Lindblad dynamics. We further analyze the universal properties of an example case, identifying a change of critical behavior when quantum effects are varied, showing their potential impact on the collective dynamical behavior underlying information processing in large-scale QNNs.

arXiv:2207.11777•Physical review. E•Feb 22, 2023•12 citations

Numerical simulation of quantum nonequilibrium phase transitions without finite-size effects

Edward Gillman, Federico Carollo, Igor Lesanovsky

Classical $(1+1)$-dimensional (D) cellular automata, as for instance Domany-Kinzel cellular automata, are paradigmatic systems for the study of nonequilibrium phenomena. Such systems evolve in discrete time steps, and are thus free of time-discretization errors. Moreover, they display nonequilibrium phase transitions which can be studied by simulating the evolution of an initial seed. At any finite time, this has support only on a finite light cone. Thus, essentially numerically exact simulations free of finite-size errors or boundary effects are possible, leading to high-accuracy estimates of critical exponents. Here, we show how similar advantages can be gained in the quantum regime: The many-body critical dynamics occurring in $(1+1)\mathrm{D}$ quantum cellular automata with an absorbing state can be studied directly on an infinite lattice when starting from seed initial conditions. This can be achieved efficiently by simulating the dynamics of an associated one-dimensional, nonunitary quantum cellular automaton using tensor networks. We apply our method to a model introduced recently and find accurate values for universal exponents, suggesting that this approach can be a powerful tool for precisely studying nonequilibrium universal physics in quantum systems.

arXiv:2010.10954•Physical Review A•Apr 8, 2021•11 citations

Quantum Cellular Automata Controlled Self-Organizing Networks

László Gyöngyösi, Sándor Imre

Every process of our universe is based on the fundamental elements of nature: information and computation.The basic motivation behind the study of quantum cellular automata (QCA) is the wish to analyze the processes of nature.QCA provide a natural framework within which to describe many classically undescribable and uncomputable physical phenomena, such as the properties of quantum physical systems and the complex background of quantum dynamics.Quantum cellular automata models are based on the working mechanism of classical cellular automata models and use the power of reversible quantum computation.Cellular automata can be used in many fields of science, such as parallel computation, artificial intelligence, image processing, biological systems, simulation of physics systems, hardware design, algorithm theory, and many more.In the first part of this chapter, we give a brief overview of the basic properties of quantum information processing and analyze the quantum versions of classical cellular automata models.We present all materials in a clear, perspicuous, and comprehensible manner, without using a complex mathematical background.After reviewing physical QCA implementations, we sketch future directions, and then conclude the first part.In the second part of the chapter, we examine one possible application of QCA, which uses quantum computing to realize real-life based, truly random network organization.This abstract machine is called a Quantum Cellular Machine (QCM), and we design it for controlling a truly random biologically-inspired network, and to integrate quantum learning algorithms and quantum searching into a controlled, self-organizing system.The selforganizing processes in classical systems cannot be truly random.Using our quantum probabilistic QCM unit, we can add truly random behavior to the self-organizing processes of biological networks.A quantum mechanical-based quantum cellular machine (QCM) controls the self-organizing processes of the network and uses a closed, non-classical quantum mechanical-based language inside the QCM.The proposed QCM solution has deep relevance in the evolution of truly random quantum probabilistic self-organizing network structures.The QCM controls the evolution of the system, changes its environment and creates plans without any human interaction, using truly random quantum probabilistic decisions.In a classical system, the classical circuits can only exhibit deterministic behavior.In a quantum probabilistic control system, the quantum circuits can follow both deterministic and quantum probabilistic quantum cellular machine control behaviors.The QCM has classical and quantum communication layers, it uses the classical layer to detect www.intechopen.comCellular Automata -Innovative Modelling for Science and Engineering 114 the network environment.The lower layer of the quantum cellular machine contains the non-deterministic quantum probabilistic decisions and interacts with the classical level.The quantum cellular machine model with the power of quantum computing can be used for the development of a real-life based network organism.We show, that a real, biologically inspired, non-deterministic, truly random network model can be achieved by the discussed QCM model.In the third part of this chapter, we show that a very efficient quantum searching algorithm can be integrated into the QCM, to find the best solution to a given network input command.We present a quantum searching based method specially designed for quantum probabilistic self-organizing networks, to reduce the complexity of the classical traditional search in the network.The proposed QCM can process both quantum and classical information, and accomplish both deterministic and quantum probabilistic tasks.The information unit is a quantum bit, which can lie in a coherent superposition state of logical states zero and one, and can thus simultaneously store zero and one.Using quantum bits, we can speed up the solutions of classical problems, and even solve some hard problems that classical computers can't solve.The key aspect behind the optimal decisions of a QCM is to design a high-efficiency searching algorithm.A QCM updates the probability amplitudes of its quantum register, according to a given reward value, derived from the network environment.The QCM repeatedly applies a unitary transformation to the quantum states, thus it can enhance, for example, the probability amplitude of the optimal path in the self-organizing network environment, while suppressing the amplitude of all other solutions.The QCM's quantum searching algorithm can help resolve many hard tasks, for example it could be applied to find an optimal logical path, using the effects of quantum mechanics.In the numerical analysis we will show that the quantum communication layer could improve the performance of classical systems.

InTech eBooks•Apr 11, 2011•5 citations

Nonequilibrium Phase Transitions in ( 1+1 )-Dimensional Quantum Cellular Automata with Controllable Quantum Correlations

Edward Gillman, Federico Carollo, Igor Lesanovsky

Motivated by recent progress in the experimental development of quantum simulators based on Rydberg atoms, we introduce and investigate the dynamics of a class of (1+1)-dimensional quantum cellular automata. These nonequilibrium many-body models, which are quantum generalizations of the Domany-Kinzel cellular automaton, possess two key features: they display stationary behavior and nonequilibrium phase transitions despite being isolated systems. Moreover, they permit the controlled introduction of local quantum correlations, which allows for the impact of quantumness on the dynamics and phase transition to be assessed. We show that projected entangled pair state tensor networks permit a natural and efficient representation of the cellular automaton. Here, the degree of quantumness and complexity of the dynamics is reflected in the difficulty of contracting the tensor network.

arXiv:2002.09238•Physical Review Letters•Sep 3, 2020•31 citations

Nonequilibrium phases and quantum correlations in synthetic transport models

Uddhav Sen, Federico Carollo, Sascha Wald

Quantum devices featuring mid-circuit measurement and reset capabilities, such as quantum computers and dual-species Rydberg quantum simulators, enable the realization of quantum cellular automata. These systems evolve in discrete time following local updates implemented by unitary gates, and allow for the realization of both closed and synthetic dissipative dynamics. Here, we focus on quantum cellular automata that implement minimal models of classical and quantum transport. To illustrate our ideas, we focus on a discrete-time totally asymmetric simple exclusion process and investigate how coherent dynamical contributions allow for the emergence of quantum effects and correlations. We find that bipartite entanglement dominates the transient evolution, while stationary states can retain quantum correlations beyond entanglement. Our results suggest viable routes for realizing transport models on quantum devices and characterizing collective quantum correlations in strongly driven systems.

quant-pharXiv:2603.24478•Physical Review Letters•Mar 26, 2026•0 citations

Training the classification capability of large-scale quantum cellular automata

Mario Boneberg, Simon Kochsiek, Gabriele Perfetto +1 more

In the vicinity of a phase transition ergodicity can be broken. Here, different initial many-body configurations evolve towards one of several fixed points, which are macroscopically distinguishable through an order parameter. This mechanism enables state classification in quantum cellular automata and feed-forward quantum neural networks. We demonstrate that this capability can be efficiently learned from training data even in extremely high-dimensional state spaces. We illustrate this using a quantum cellular automaton that allows binary classification, which is closely connected to the dynamics of a $\mathbb{Z}_2$-symmetric Ising model with local interactions and dissipation. This approach can be generalized beyond binary classification and offers a natural framework for exploring the link between emergent many-body phenomena and the interpretation of data processing capabilities in the context of quantum machine learning.

arXiv:2509.18262•Physical Review A•Jun 1, 2026•0 citations
Abstract Classical artificial neural networks, built from elementary units, possess enormous expressive power. Here we investigate a quantum neural network (QNN) architecture, which follows a similar paradigm. It is structurally equivalent to so-called (1+1)D quantum cellular automata, which are two-dimensional quantum lattice systems on which dynamics takes place in discrete time. Information transfer between consecutive time slices—or adjacent network layers—is governed by local quantum gates, which can be regarded as the quantum counterpart of the classical elementary units. Along the time-direction an effective dissipative evolution emerges on the level of the reduced state, and the nature of this dynamics is dictated by the structure of the elementary gates. We show how to construct the local unitary gates to yield a desired many-body dynamics, which in certain parameter regimes is governed by a Lindblad master equation. We study this for small system sizes through numerical simulations and demonstrate how collective effects within the quantum cellular automaton can be controlled parametrically. Our study constitutes a step towards the utilization of large-scale emergent phenomena in large QNNs for machine learning purposes.
Central to the field of quantum machine learning is the design of quantum perceptrons and neural network architectures. A key question in this regard is the impact of quantum effects on the way such models process information. Here, we establish a connection between (1+1)D quantum cellular automata, which implement a discrete nonequilibrium quantum many-body dynamics through successive applications of local quantum gates, and quantum neural networks (QNNs), which process information by feeding it through perceptrons interconnecting adjacent layers. Exploiting this link, we construct a class of QNNs that are highly structured-aiding both interpretability and helping to avoid trainability issues in machine learning tasks-yet can be connected rigorously to continuous-time Lindblad dynamics. We further analyze the universal properties of an example case, identifying a change of critical behavior when quantum effects are varied, showing their potential impact on the collective dynamical behavior underlying information processing in large-scale QNNs.
Classical (1+1)(1+1)(1+1)-dimensional (D) cellular automata, as for instance Domany-Kinzel cellular automata, are paradigmatic systems for the study of nonequilibrium phenomena. Such systems evolve in discrete time steps, and are thus free of time-discretization errors. Moreover, they display nonequilibrium phase transitions which can be studied by simulating the evolution of an initial seed. At any finite time, this has support only on a finite light cone. Thus, essentially numerically exact simulations free of finite-size errors or boundary effects are possible, leading to high-accuracy estimates of critical exponents. Here, we show how similar advantages can be gained in the quantum regime: The many-body critical dynamics occurring in (1+1)D(1+1)\mathrm{D}(1+1)D quantum cellular automata with an absorbing state can be studied directly on an infinite lattice when starting from seed initial conditions. This can be achieved efficiently by simulating the dynamics of an associated one-dimensional, nonunitary quantum cellular automaton using tensor networks. We apply our method to a model introduced recently and find accurate values for universal exponents, suggesting that this approach can be a powerful tool for precisely studying nonequilibrium universal physics in quantum systems.
Every process of our universe is based on the fundamental elements of nature: information and computation.The basic motivation behind the study of quantum cellular automata (QCA) is the wish to analyze the processes of nature.QCA provide a natural framework within which to describe many classically undescribable and uncomputable physical phenomena, such as the properties of quantum physical systems and the complex background of quantum dynamics.Quantum cellular automata models are based on the working mechanism of classical cellular automata models and use the power of reversible quantum computation.Cellular automata can be used in many fields of science, such as parallel computation, artificial intelligence, image processing, biological systems, simulation of physics systems, hardware design, algorithm theory, and many more.In the first part of this chapter, we give a brief overview of the basic properties of quantum information processing and analyze the quantum versions of classical cellular automata models.We present all materials in a clear, perspicuous, and comprehensible manner, without using a complex mathematical background.After reviewing physical QCA implementations, we sketch future directions, and then conclude the first part.In the second part of the chapter, we examine one possible application of QCA, which uses quantum computing to realize real-life based, truly random network organization.This abstract machine is called a Quantum Cellular Machine (QCM), and we design it for controlling a truly random biologically-inspired network, and to integrate quantum learning algorithms and quantum searching into a controlled, self-organizing system.The selforganizing processes in classical systems cannot be truly random.Using our quantum probabilistic QCM unit, we can add truly random behavior to the self-organizing processes of biological networks.A quantum mechanical-based quantum cellular machine (QCM) controls the self-organizing processes of the network and uses a closed, non-classical quantum mechanical-based language inside the QCM.The proposed QCM solution has deep relevance in the evolution of truly random quantum probabilistic self-organizing network structures.The QCM controls the evolution of the system, changes its environment and creates plans without any human interaction, using truly random quantum probabilistic decisions.In a classical system, the classical circuits can only exhibit deterministic behavior.In a quantum probabilistic control system, the quantum circuits can follow both deterministic and quantum probabilistic quantum cellular machine control behaviors.The QCM has classical and quantum communication layers, it uses the classical layer to detect www.intechopen.comCellular Automata -Innovative Modelling for Science and Engineering 114 the network environment.The lower layer of the quantum cellular machine contains the non-deterministic quantum probabilistic decisions and interacts with the classical level.The quantum cellular machine model with the power of quantum computing can be used for the development of a real-life based network organism.We show, that a real, biologically inspired, non-deterministic, truly random network model can be achieved by the discussed QCM model.In the third part of this chapter, we show that a very efficient quantum searching algorithm can be integrated into the QCM, to find the best solution to a given network input command.We present a quantum searching based method specially designed for quantum probabilistic self-organizing networks, to reduce the complexity of the classical traditional search in the network.The proposed QCM can process both quantum and classical information, and accomplish both deterministic and quantum probabilistic tasks.The information unit is a quantum bit, which can lie in a coherent superposition state of logical states zero and one, and can thus simultaneously store zero and one.Using quantum bits, we can speed up the solutions of classical problems, and even solve some hard problems that classical computers can't solve.The key aspect behind the optimal decisions of a QCM is to design a high-efficiency searching algorithm.A QCM updates the probability amplitudes of its quantum register, according to a given reward value, derived from the network environment.The QCM repeatedly applies a unitary transformation to the quantum states, thus it can enhance, for example, the probability amplitude of the optimal path in the self-organizing network environment, while suppressing the amplitude of all other solutions.The QCM's quantum searching algorithm can help resolve many hard tasks, for example it could be applied to find an optimal logical path, using the effects of quantum mechanics.In the numerical analysis we will show that the quantum communication layer could improve the performance of classical systems.
Motivated by recent progress in the experimental development of quantum simulators based on Rydberg atoms, we introduce and investigate the dynamics of a class of (1+1)-dimensional quantum cellular automata. These nonequilibrium many-body models, which are quantum generalizations of the Domany-Kinzel cellular automaton, possess two key features: they display stationary behavior and nonequilibrium phase transitions despite being isolated systems. Moreover, they permit the controlled introduction of local quantum correlations, which allows for the impact of quantumness on the dynamics and phase transition to be assessed. We show that projected entangled pair state tensor networks permit a natural and efficient representation of the cellular automaton. Here, the degree of quantumness and complexity of the dynamics is reflected in the difficulty of contracting the tensor network.
Quantum devices featuring mid-circuit measurement and reset capabilities, such as quantum computers and dual-species Rydberg quantum simulators, enable the realization of quantum cellular automata. These systems evolve in discrete time following local updates implemented by unitary gates, and allow for the realization of both closed and synthetic dissipative dynamics. Here, we focus on quantum cellular automata that implement minimal models of classical and quantum transport. To illustrate our ideas, we focus on a discrete-time totally asymmetric simple exclusion process and investigate how coherent dynamical contributions allow for the emergence of quantum effects and correlations. We find that bipartite entanglement dominates the transient evolution, while stationary states can retain quantum correlations beyond entanglement. Our results suggest viable routes for realizing transport models on quantum devices and characterizing collective quantum correlations in strongly driven systems.
In the vicinity of a phase transition ergodicity can be broken. Here, different initial many-body configurations evolve towards one of several fixed points, which are macroscopically distinguishable through an order parameter. This mechanism enables state classification in quantum cellular automata and feed-forward quantum neural networks. We demonstrate that this capability can be efficiently learned from training data even in extremely high-dimensional state spaces. We illustrate this using a quantum cellular automaton that allows binary classification, which is closely connected to the dynamics of a Z2\mathbb{Z}_2Z2​-symmetric Ising model with local interactions and dissipation. This approach can be generalized beyond binary classification and offers a natural framework for exploring the link between emergent many-body phenomena and the interpretation of data processing capabilities in the context of quantum machine learning.