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:2511.01028 · Journal of Physics A Mathematical and Theoretical

Pseudo quantum advantages in perceptron storage capacity

Fabio Benatti, Masoud Gharahi, Giovanni Gramegna, Stefano Mancini, Vincenzo Parisi

quant-phmath-phmath.STSubmitted Nov 2, 2025• Announced Nov 4, 2025• 0 citations• Revised Apr 8, 2026 (v2)
v1 · Nov 2, 2025v2 · Apr 8, 2026
arXivHTMLPDF

Abstract

We investigate a generalized quantum perceptron architecture characterized by an oscillating activation function with a tunable frequency ranging from zero to infinity. Employing analytical techniques from statistical mechanics, we derive the optimal storage capacity and demonstrate that the classical result is recovered in the limit of vanishing frequency. As the frequency increases, however, the architecture exhibits enhanced quantum storage capabilities. Notably, this improvement stems solely from the specific form of the activation function and, in principle, could be emulated within a classical framework. Accordingly, we refer to this enhancement as a pseudo quantum advantage.

Journal reference
J. Phys. A: Math. Theor. 59 145203 (2026)
DOI
10.1088/1751-8121/ae56a0
Comments
24 pages, 1 figure; minor changes, typos corrected

Related papers

On the capacity of a quantum perceptron for storing biased patterns

Fabio Benatti, Giovanni Gramegna, Stefano Mancini +1 more

Abstract Although different architectures of quantum perceptrons have been recently put forward, the capabilities of such quantum devices versus their classical counterparts remain debated. Here, we consider random patterns and targets independently distributed with biased probabilities and investigate the storage capacity of a continuous quantum perceptron model that admits a classical limit, thus facilitating the comparison of performances. Such a more general context extends a previous study of the quantum storage capacity where using statistical mechanics techniques in the limit of a large number of inputs, it was proved that no quantum advantages are to be expected concerning the storage properties. This outcome is due to the fuzziness inevitably introduced by the intrinsic stochasticity of quantum devices. We strengthen such an indication by showing that the possibility of indefinitely enhancing the storage capacity for highly correlated patterns, as it occurs in a classical setting, is instead prevented at the quantum level.

arXiv:2304.14393•Journal of Physics A Mathematical and Theoretical•Dec 5, 2023•1 citation

Storage properties of a quantum perceptron

Aikaterini Gratsea, Valentin Kasper, Maciej Lewenstein

Driven by growing computational power and algorithmic developments, machine learning methods have become valuable tools for analyzing vast amounts of data. Simultaneously, the fast technological progress of quantum information processing suggests employing quantum hardware for machine learning purposes. Recent works discuss different architectures of quantum perceptrons, but the abilities of such quantum devices remain debated. Here, we investigate the storage capacity of a particular quantum perceptron architecture by using statistical mechanics techniques and connect our analysis to the theory of classical spin glasses. Specifically, we focus on one concrete quantum perceptron model and explore its storage properties in the limit of a large number of inputs.

arXiv:2111.08414•Physical review. E•Aug 20, 2024•13 citations

Storage Capacity Evaluation of Quantum Perceptron by Replica Method

Mitsuru Urushibata, Masayuki Ohzeki

We investigate a quantum perceptron implemented on a quantum circuit using a repeat until method. We evaluate this from the perspective of capacity, one of the performance evaluation measures for perceptions. We assess a Gardner volume, defined as a volume of coefficients of the perceptron that can correctly classify given training examples using the replica method. The model is defined on the quantum circuit. Nevertheless, it is straightforward to assess the capacity using the replica method, which is a standard method in classical statistical mechanics. The reason why we can solve our model by the replica method is the repeat until method, in which we focus on the output of the measurements of the quantum circuit. We find that the capacity of a quantum perceptron is larger than that of a classical perceptron since the quantum one is simple but effectively falls into a highly nonlinear form of the activation function.

arXiv:2404.14785•Journal of the Physical Society of Japan•Apr 10, 2025•4 citations

Pattern capacity of a single quantum perceptron

Fabio Benatti, Giovanni Gramegna, Stefano Mancini

Abstract Recent developments in quantum machine learning have seen the introduction of several models to generalize the classical perceptron to the quantum regime. The capabilities of these quantum models need to be determined precisely in order to establish if a quantum advantage is achievable. Here we use a statistical physics approach to compute the pattern capacity of a particular model of quantum perceptron realized by means of a continuous variable quantum system.

arXiv:2112.10115•Journal of Physics A Mathematical and Theoretical•Feb 25, 2022•7 citations

Quantum-Inspired Neural Network Activation Functions

Jincheng Zhang

This paper explores a novel approach to neural network activation functions by drawing inspiration from quantum mechanical principles. Traditional activation functions, such as sigmoid and ReLU, often exhibit limitations in terms of learning efficiency and representational capacity. We hypothesize that classical activation functions can be effectively approximated by functions derived from quantum mechanics, specifically utilizing concepts like the quantum harmonic oscillator. The proposed activation functions aim to leverage the unique properties of quantum systems—superposition, entanglement, and tunneling—to potentially enhance neural network performance. We introduce a set of new activation functions and provide a theoretical framework for their design. The core claim of this work is that classical activation functions can be accurately approximated by quantum mechanical functions. The primary mechanism involves translating quantum mechanical models into differentiable functions suitable for use within a neural network architecture. We discuss the mathematical foundations, potential benefits, and challenges associated with this approach, focusing on the approximation of the quantum harmonic oscillator and its application to neural network activation. The research contributes to a fundamental shift in activation function design, moving beyond purely classical models towards a quantum-inspired paradigm.

•Sep 3, 2026•0 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
We investigate a generalized quantum perceptron architecture characterized by an oscillating activation function with a tunable frequency ranging from zero to infinity. Employing analytical techniques from statistical mechanics, we derive the optimal storage capacity and demonstrate that the classical result is recovered in the limit of vanishing frequency. As the frequency increases, however, the architecture exhibits enhanced quantum storage capabilities. Notably, this improvement stems solely from the specific form of the activation function and, in principle, could be emulated within a classical framework. Accordingly, we refer to this enhancement as a pseudo quantum advantage.
Abstract Although different architectures of quantum perceptrons have been recently put forward, the capabilities of such quantum devices versus their classical counterparts remain debated. Here, we consider random patterns and targets independently distributed with biased probabilities and investigate the storage capacity of a continuous quantum perceptron model that admits a classical limit, thus facilitating the comparison of performances. Such a more general context extends a previous study of the quantum storage capacity where using statistical mechanics techniques in the limit of a large number of inputs, it was proved that no quantum advantages are to be expected concerning the storage properties. This outcome is due to the fuzziness inevitably introduced by the intrinsic stochasticity of quantum devices. We strengthen such an indication by showing that the possibility of indefinitely enhancing the storage capacity for highly correlated patterns, as it occurs in a classical setting, is instead prevented at the quantum level.
Driven by growing computational power and algorithmic developments, machine learning methods have become valuable tools for analyzing vast amounts of data. Simultaneously, the fast technological progress of quantum information processing suggests employing quantum hardware for machine learning purposes. Recent works discuss different architectures of quantum perceptrons, but the abilities of such quantum devices remain debated. Here, we investigate the storage capacity of a particular quantum perceptron architecture by using statistical mechanics techniques and connect our analysis to the theory of classical spin glasses. Specifically, we focus on one concrete quantum perceptron model and explore its storage properties in the limit of a large number of inputs.
We investigate a quantum perceptron implemented on a quantum circuit using a repeat until method. We evaluate this from the perspective of capacity, one of the performance evaluation measures for perceptions. We assess a Gardner volume, defined as a volume of coefficients of the perceptron that can correctly classify given training examples using the replica method. The model is defined on the quantum circuit. Nevertheless, it is straightforward to assess the capacity using the replica method, which is a standard method in classical statistical mechanics. The reason why we can solve our model by the replica method is the repeat until method, in which we focus on the output of the measurements of the quantum circuit. We find that the capacity of a quantum perceptron is larger than that of a classical perceptron since the quantum one is simple but effectively falls into a highly nonlinear form of the activation function.
This paper explores a novel approach to neural network activation functions by drawing inspiration from quantum mechanical principles. Traditional activation functions, such as sigmoid and ReLU, often exhibit limitations in terms of learning efficiency and representational capacity. We hypothesize that classical activation functions can be effectively approximated by functions derived from quantum mechanics, specifically utilizing concepts like the quantum harmonic oscillator. The proposed activation functions aim to leverage the unique properties of quantum systems—superposition, entanglement, and tunneling—to potentially enhance neural network performance. We introduce a set of new activation functions and provide a theoretical framework for their design. The core claim of this work is that classical activation functions can be accurately approximated by quantum mechanical functions. The primary mechanism involves translating quantum mechanical models into differentiable functions suitable for use within a neural network architecture. We discuss the mathematical foundations, potential benefits, and challenges associated with this approach, focusing on the approximation of the quantum harmonic oscillator and its application to neural network activation. The research contributes to a fundamental shift in activation function design, moving beyond purely classical models towards a quantum-inspired paradigm.
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.