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:2211.07075 · Quantum Science and Technology

Expressive quantum perceptrons for quantum neuromorphic computing

Rodrigo Araiza Bravo, Taylor L. Patti, Khadijeh Najafi, Xun Gao, Susanne F. Yelin

Published Dec 16, 2024• 11 citations
arXivHTMLPDF

Abstract

Abstract Quantum neuromorphic computing (QNC) is a sub-field of quantum machine learning (QML) that capitalizes on inherent system dynamics. As a result, QNC can run on contemporary, noisy quantum hardware and is poised to realize challenging algorithms in the near term. One key issue in QNC is the characterization of the requisite dynamics for ensuring expressive quantum neuromorphic computation. We address this issue by adapting previous proposals of quantum perceptrons (QPs), a quantum version of a simplistic model for neural computation, to the QNC setting. Our QPs compute based on the analog dynamics of interacting qubits with tunable coupling constants. We show that QPs are, with restricted resources, a quantum equivalent to the classical perceptron, a simple mathematical model for a neuron that is the building block of various machine learning architectures. Moreover, we show that QPs are theoretically capable of producing any unitary operation. Thus, QPs are computationally more expressive than their classical counterparts. As a result, QNC architectures built using our QPs are, theoretically, universal. We introduce a technique for mitigating barren plateaus in QPs called entanglement thinning. We demonstrate QPs’ effectiveness by applying them to numerous QML problems, including calculating the inner products between quantum states, energy measurements, and time reversal. Finally, we discuss potential implementations of QPs and how they can be used to build more complex QNC architectures such as quantum reservoir computers.

DOI
10.1088/2058-9565/ad9fa4

Related papers

Machine Learning on Quantum Systems

Schütte, Nils-Erik, Götting, Niclas, Müntinga, Hauke +2 more

Quantum machine learning (QML) has gained significant interest by combining quantum computing and artificial intelligence, two topics that are expected to revolutionize the way of data processing. While gate-based quantum computing uses precisely defined unitary operations on qubits, currently available noisy intermediate-scale quantum (NISQ) devices are not ready for implementations of high-depth circuits. However, machine learning is one of the promising applications to be used on NISQ hardware via parameterized quantum circuits (PQCs). An alternative QML paradigm comes from a different direction: Quantum reservoir computing (QRC) relies on using physical systems as quantum artificial neural networks. Instead of using controlled gate operations, here the system dynamics are controlled by the underlying Hamiltonian, and the machine learning layer is performed at the output weights. Despite their distinct origin, both ML approaches are connected and can formally be mapped onto each other. We discuss this analogy by realizing a transverse-field Ising model on a gate-based quantum computing architecture establishing a fundamental connection on an abstract level between these two very different QML paradigms. This enables us to connect the known expressivity measure of PQC-QML with the quantification of expressiveness of physical dynamical systems.

•Sep 3, 2024•0 citations

Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance

Ishita Agarwal, Taylor L. Patti, Rodrigo Araiza Bravo +2 more

Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML). At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation. Canonically, a QP features $N$ input qubits and one output qubit, and is used to determine whether an input state belongs to a specific class. Rydberg atoms, with their extended coherence times and scalable spatial configurations, provide an ideal platform for implementing QPs. In this work, we explore the implementation of QPs on Rydberg atom arrays, assessing their performance in tasks such as phase classification between Z2, Z3, Z4 and disordered phases, achieving high accuracy, including in the presence of noise. We also perform multi-class entanglement classification by extending the QP model to include multiple output qubits, achieving 95\% accuracy in distinguishing noisy, high-fidelity states based on separability. Additionally, we discuss the experimental realization of QPs on Rydberg platforms using both single-species and dual-species arrays, and examine the error bounds associated with approximating continuous functions.

arXiv:2411.09093•Nov 13, 2024•3 citations

Quantum Entanglement-Based Information Encoding in Neuromorphic Computing

Jincheng Zhang

This paper explores a novel approach to neuromorphic computing by leveraging the unique properties of quantum entanglement. The core idea is to utilize multi-particle quantum entanglement states as the physical connections between artificial neurons, enabling efficient parallel information processing and mimicking biological neural networks. We propose a quantum neuromorphic chip architecture employing multiple superconducting quantum bits (Qubits) engineered to exhibit entanglement. The design focuses on manipulating the coherence time, topological structure, and combined operation of quantum gates to emulate synaptic transmission and learning within biological neural networks. Specifically, we investigate encoding information through entanglement and explore parallel computation facilitated by this quantum phenomenon. Furthermore, we address the challenges of quantum computation by integrating quantum decoherence and quantum error correction techniques. The potential for achieving high-performance, energy-efficient, and biologically inspired computing is discussed, representing a significant departure from traditional approaches and classical neural networks. The proposed framework offers a pathway towards scalable quantum neuromorphic systems with potential applications in areas such as pattern recognition, machine learning, and complex system modeling.

•Sep 6, 2026•0 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

Evaluating the performance of sigmoid quantum perceptrons in quantum neural networks

Samuel A. Wilkinson, Michael J. Hartmann

Quantum neural networks (QNN) have been proposed as a promising architecture for quantum machine learning. There exist a number of different quantum circuit designs being branded as QNNs, however no clear candidate has presented itself as more suitable than the others. Rather, the search for a ``quantum perceptron" -- the fundamental building block of a QNN -- is still underway. One candidate is quantum perceptrons designed to emulate the nonlinear activation functions of classical perceptrons. Such sigmoid quantum perceptrons (SQPs) inherit the universal approximation property that guarantees that classical neural networks can approximate any function. However, this does not guarantee that QNNs built from SQPs will have any quantum advantage over their classical counterparts. Here we critically investigate both the capabilities and performance of SQP networks by computing their effective dimension and effective capacity, as well as examining their performance on real learning problems. The results are compared to those obtained for other candidate networks which lack activation functions. It is found that simpler, and apparently easier-to-implement parametric quantum circuits actually perform better than SQPs. This indicates that the universal approximation theorem, which a cornerstone of the theory of classical neural networks, is not a relevant criterion for QNNs.

arXiv:2208.06198•Aug 12, 2022•13 citations

Quantum Neural Network in Architectures, Learning Mechanisms, and Emerging Applications Across Domains: A Review

Muhamad Akrom

Quantum Neural Networks (QNNs) represent a novel computational paradigm that merges the principles of quantum computing with the architecture of artificial neural networks. Through the quantum phenomena of superposition, entanglement, and interference, QNNs enable parallel computation in high-dimensional Hilbert spaces, offering the potential to surpass the representational limits of classical models. This review provides a comprehensive overview of the theoretical foundations and architectures of QNNs, including Quantum Perceptrons, Variational Quantum Circuits (VQCs), Quantum Convolutional Neural Networks (QCNNs), and Quantum Recurrent Neural Networks (QRNNs). Furthermore, it discusses hybrid quantum–classical training mechanisms and key challenges such as barren plateaus, decoherence, and sampling complexity. The review also highlights recent applications of QNNs in medical diagnostics, materials science, and financial forecasting, demonstrating their potential to accelerate computation and improve predictive accuracy. Finally, future research directions are discussed in relation to computational efficiency, model interpretability, and integration with next-generation quantum hardware.

Journal of Multiscale Materials Informatics•Nov 21, 2025•4 citations
Abstract Quantum neuromorphic computing (QNC) is a sub-field of quantum machine learning (QML) that capitalizes on inherent system dynamics. As a result, QNC can run on contemporary, noisy quantum hardware and is poised to realize challenging algorithms in the near term. One key issue in QNC is the characterization of the requisite dynamics for ensuring expressive quantum neuromorphic computation. We address this issue by adapting previous proposals of quantum perceptrons (QPs), a quantum version of a simplistic model for neural computation, to the QNC setting. Our QPs compute based on the analog dynamics of interacting qubits with tunable coupling constants. We show that QPs are, with restricted resources, a quantum equivalent to the classical perceptron, a simple mathematical model for a neuron that is the building block of various machine learning architectures. Moreover, we show that QPs are theoretically capable of producing any unitary operation. Thus, QPs are computationally more expressive than their classical counterparts. As a result, QNC architectures built using our QPs are, theoretically, universal. We introduce a technique for mitigating barren plateaus in QPs called entanglement thinning. We demonstrate QPs’ effectiveness by applying them to numerous QML problems, including calculating the inner products between quantum states, energy measurements, and time reversal. Finally, we discuss potential implementations of QPs and how they can be used to build more complex QNC architectures such as quantum reservoir computers.
Quantum machine learning (QML) has gained significant interest by combining quantum computing and artificial intelligence, two topics that are expected to revolutionize the way of data processing. While gate-based quantum computing uses precisely defined unitary operations on qubits, currently available noisy intermediate-scale quantum (NISQ) devices are not ready for implementations of high-depth circuits. However, machine learning is one of the promising applications to be used on NISQ hardware via parameterized quantum circuits (PQCs). An alternative QML paradigm comes from a different direction: Quantum reservoir computing (QRC) relies on using physical systems as quantum artificial neural networks. Instead of using controlled gate operations, here the system dynamics are controlled by the underlying Hamiltonian, and the machine learning layer is performed at the output weights. Despite their distinct origin, both ML approaches are connected and can formally be mapped onto each other. We discuss this analogy by realizing a transverse-field Ising model on a gate-based quantum computing architecture establishing a fundamental connection on an abstract level between these two very different QML paradigms. This enables us to connect the known expressivity measure of PQC-QML with the quantification of expressiveness of physical dynamical systems.
Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML). At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation. Canonically, a QP features NNN input qubits and one output qubit, and is used to determine whether an input state belongs to a specific class. Rydberg atoms, with their extended coherence times and scalable spatial configurations, provide an ideal platform for implementing QPs. In this work, we explore the implementation of QPs on Rydberg atom arrays, assessing their performance in tasks such as phase classification between Z2, Z3, Z4 and disordered phases, achieving high accuracy, including in the presence of noise. We also perform multi-class entanglement classification by extending the QP model to include multiple output qubits, achieving 95\% accuracy in distinguishing noisy, high-fidelity states based on separability. Additionally, we discuss the experimental realization of QPs on Rydberg platforms using both single-species and dual-species arrays, and examine the error bounds associated with approximating continuous functions.
This paper explores a novel approach to neuromorphic computing by leveraging the unique properties of quantum entanglement. The core idea is to utilize multi-particle quantum entanglement states as the physical connections between artificial neurons, enabling efficient parallel information processing and mimicking biological neural networks. We propose a quantum neuromorphic chip architecture employing multiple superconducting quantum bits (Qubits) engineered to exhibit entanglement. The design focuses on manipulating the coherence time, topological structure, and combined operation of quantum gates to emulate synaptic transmission and learning within biological neural networks. Specifically, we investigate encoding information through entanglement and explore parallel computation facilitated by this quantum phenomenon. Furthermore, we address the challenges of quantum computation by integrating quantum decoherence and quantum error correction techniques. The potential for achieving high-performance, energy-efficient, and biologically inspired computing is discussed, representing a significant departure from traditional approaches and classical neural networks. The proposed framework offers a pathway towards scalable quantum neuromorphic systems with potential applications in areas such as pattern recognition, machine learning, and complex system modeling.
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 (QNN) have been proposed as a promising architecture for quantum machine learning. There exist a number of different quantum circuit designs being branded as QNNs, however no clear candidate has presented itself as more suitable than the others. Rather, the search for a ``quantum perceptron" -- the fundamental building block of a QNN -- is still underway. One candidate is quantum perceptrons designed to emulate the nonlinear activation functions of classical perceptrons. Such sigmoid quantum perceptrons (SQPs) inherit the universal approximation property that guarantees that classical neural networks can approximate any function. However, this does not guarantee that QNNs built from SQPs will have any quantum advantage over their classical counterparts. Here we critically investigate both the capabilities and performance of SQP networks by computing their effective dimension and effective capacity, as well as examining their performance on real learning problems. The results are compared to those obtained for other candidate networks which lack activation functions. It is found that simpler, and apparently easier-to-implement parametric quantum circuits actually perform better than SQPs. This indicates that the universal approximation theorem, which a cornerstone of the theory of classical neural networks, is not a relevant criterion for QNNs.
Quantum Neural Networks (QNNs) represent a novel computational paradigm that merges the principles of quantum computing with the architecture of artificial neural networks. Through the quantum phenomena of superposition, entanglement, and interference, QNNs enable parallel computation in high-dimensional Hilbert spaces, offering the potential to surpass the representational limits of classical models. This review provides a comprehensive overview of the theoretical foundations and architectures of QNNs, including Quantum Perceptrons, Variational Quantum Circuits (VQCs), Quantum Convolutional Neural Networks (QCNNs), and Quantum Recurrent Neural Networks (QRNNs). Furthermore, it discusses hybrid quantum–classical training mechanisms and key challenges such as barren plateaus, decoherence, and sampling complexity. The review also highlights recent applications of QNNs in medical diagnostics, materials science, and financial forecasting, demonstrating their potential to accelerate computation and improve predictive accuracy. Finally, future research directions are discussed in relation to computational efficiency, model interpretability, and integration with next-generation quantum hardware.