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:2207.11777 · Physical review. E

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

Edward Gillman, Federico Carollo, Igor Lesanovsky

Published Feb 22, 2023• 13 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreve.107.l022102

Related papers

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

Mario Boneberg, Federico Carollo, Igor Lesanovsky

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.

arXiv:2304.11209•New Journal of Physics•Aug 14, 2023•7 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•2 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

Exploiting the equivalence between quantum neural networks and perceptrons

Chris Mingard, Jessica Pointing, London, Charles +2 more

Quantum machine learning models based on parametrized quantum circuits, also called quantum neural networks (QNNs), are considered to be among the most promising candidates for applications on near-term quantum devices. Here we explore the expressivity and inductive bias of QNNs by exploiting an exact mapping from QNNs with inputs $x$ to classical perceptrons acting on $x \otimes x$ (generalised to complex inputs). The simplicity of the perceptron architecture allows us to provide clear examples of the shortcomings of current QNN models, and the many barriers they face to becoming useful general-purpose learning algorithms. For example, a QNN with amplitude encoding cannot express the Boolean parity function for $n\geq 3$, which is but one of an exponential number of data structures that such a QNN is unable to express. Mapping a QNN to a classical perceptron simplifies training, allowing us to systematically study the inductive biases of other, more expressive embeddings on Boolean data. Several popular embeddings primarily produce an inductive bias towards functions with low class balance, reducing their generalisation performance compared to deep neural network architectures which exhibit much richer inductive biases. We explore two alternate strategies that move beyond standard QNNs. In the first, we use a QNN to help generate a classical DNN-inspired kernel. In the second we draw an analogy to the hierarchical structure of deep neural networks and construct a layered non-linear QNN that is provably fully expressive on Boolean data, while also exhibiting a richer inductive bias than simple QNNs. Finally, we discuss characteristics of the QNN literature that may obscure how hard it is to achieve quantum advantage over deep learning algorithms on classical data.

arXiv:2407.04371•Jul 5, 2024•8 citations

Quantum Neural Networks

Priyanga Subbiah, M. Kandan, N. Krishnaraj +1 more

Quantum neural networks (QNNs) represent a cutting-edge approach to machine learning and artificial intelligence, harnessing the principles of quantum mechanics to process and analyze data in fundamentally new ways. Unlike classical neural networks, which operate on classical bits and are limited by the laws of classical physics, QNNs use quantum bits (qubits) and exploit quantum phenomena such as superposition and entanglement to achieve unprecedented computational power and efficiency. This chapter explores the principles and applications of QNNs, including their potential for solving complex optimisation problems, pattern recognition tasks, and quantum simulation tasks. We discuss various QNN architectures, training algorithms, and applications, highlighting their advantages and challenges compared to classical neural networks. Additionally, we explore the potential impact of QNNs on fields such as quantum computing, quantum communication, and quantum sensing, as well as their implications for society and the economy. Overall, this chapter provides insights into the emerging field of quantum neural networks and sets the stage for further research and innovation in this exciting area.

Auerbach Publications eBooks•Mar 3, 2025•1 citation

Nonlinear classification capability of quantum neural networks due to emergent quantum metastability

Mario Boneberg, Federico Carollo, Igor Lesanovsky

The power and expressivity of deep classical neural networks can be attributed to nonlinear input-output relations. Such nonlinearities are at the heart of many computational tasks, such as data classification and pattern recognition. Quantum neural networks, on the other hand, are necessarily linear as they process information via unitary operations. Here we show that effective nonlinearities can be implemented in these platforms by exploiting the relationship between information processing and many-body quantum dynamics. The crucial point is that quantum many-body systems can show emergent collective behavior in the vicinity of phase transitions, which leads to an effectively nonlinear dynamics in the thermodynamic limit. In the context of quantum neural networks, which are necessarily finite, this translates into metastability with transient nonergodic behavior. By using a quantum neural network the architecture of which is inspired by dissipative many-body quantum spin models, we show that this mechanism indeed allows one to realize nonlinear data classification, despite the underlying dynamics being local and linear. Our proof-of-principle study may pave the way for the systematic construction of quantum neural networks with emergent nonlinear properties.

arXiv:2408.10765•Physical Review A•Jun 4, 2025•5 citations
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.
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.
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.
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.
Quantum machine learning models based on parametrized quantum circuits, also called quantum neural networks (QNNs), are considered to be among the most promising candidates for applications on near-term quantum devices. Here we explore the expressivity and inductive bias of QNNs by exploiting an exact mapping from QNNs with inputs xxx to classical perceptrons acting on x⊗xx \otimes xx⊗x (generalised to complex inputs). The simplicity of the perceptron architecture allows us to provide clear examples of the shortcomings of current QNN models, and the many barriers they face to becoming useful general-purpose learning algorithms. For example, a QNN with amplitude encoding cannot express the Boolean parity function for n≥3n\geq 3n≥3, which is but one of an exponential number of data structures that such a QNN is unable to express. Mapping a QNN to a classical perceptron simplifies training, allowing us to systematically study the inductive biases of other, more expressive embeddings on Boolean data. Several popular embeddings primarily produce an inductive bias towards functions with low class balance, reducing their generalisation performance compared to deep neural network architectures which exhibit much richer inductive biases. We explore two alternate strategies that move beyond standard QNNs. In the first, we use a QNN to help generate a classical DNN-inspired kernel. In the second we draw an analogy to the hierarchical structure of deep neural networks and construct a layered non-linear QNN that is provably fully expressive on Boolean data, while also exhibiting a richer inductive bias than simple QNNs. Finally, we discuss characteristics of the QNN literature that may obscure how hard it is to achieve quantum advantage over deep learning algorithms on classical data.
Quantum neural networks (QNNs) represent a cutting-edge approach to machine learning and artificial intelligence, harnessing the principles of quantum mechanics to process and analyze data in fundamentally new ways. Unlike classical neural networks, which operate on classical bits and are limited by the laws of classical physics, QNNs use quantum bits (qubits) and exploit quantum phenomena such as superposition and entanglement to achieve unprecedented computational power and efficiency. This chapter explores the principles and applications of QNNs, including their potential for solving complex optimisation problems, pattern recognition tasks, and quantum simulation tasks. We discuss various QNN architectures, training algorithms, and applications, highlighting their advantages and challenges compared to classical neural networks. Additionally, we explore the potential impact of QNNs on fields such as quantum computing, quantum communication, and quantum sensing, as well as their implications for society and the economy. Overall, this chapter provides insights into the emerging field of quantum neural networks and sets the stage for further research and innovation in this exciting area.
The power and expressivity of deep classical neural networks can be attributed to nonlinear input-output relations. Such nonlinearities are at the heart of many computational tasks, such as data classification and pattern recognition. Quantum neural networks, on the other hand, are necessarily linear as they process information via unitary operations. Here we show that effective nonlinearities can be implemented in these platforms by exploiting the relationship between information processing and many-body quantum dynamics. The crucial point is that quantum many-body systems can show emergent collective behavior in the vicinity of phase transitions, which leads to an effectively nonlinear dynamics in the thermodynamic limit. In the context of quantum neural networks, which are necessarily finite, this translates into metastability with transient nonergodic behavior. By using a quantum neural network the architecture of which is inspired by dissipative many-body quantum spin models, we show that this mechanism indeed allows one to realize nonlinear data classification, despite the underlying dynamics being local and linear. Our proof-of-principle study may pave the way for the systematic construction of quantum neural networks with emergent nonlinear properties.