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

On the capacity of a quantum perceptron for storing biased patterns

Fabio Benatti, Giovanni Gramegna, Stefano Mancini, Gibbs Nwemadji

Published Dec 5, 2023• 1 citation
arXivHTMLPDF

Abstract

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.

DOI
10.1088/1751-8121/ad125b

Related papers

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

Pseudo quantum advantages in perceptron storage capacity

Fabio Benatti, Masoud Gharahi, Giovanni Gramegna +2 more

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.

quant-pharXiv:2511.01028•Journal of Physics A Mathematical and Theoretical•Nov 4, 2025•0 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

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

Storage capacity and learning capability of quantum neural networks

Maciej Lewenstein, Aikaterini Gratsea, Andreu Riera-Campeny +3 more

Abstract We study the storage capacity of quantum neural networks (QNNs), described by completely positive trace preserving (CPTP) maps acting on an N-dimensional Hilbert space. We demonstrate that attractor QNNs can store in a non-trivial manner up to N linearly independent pure states. For n qubits, QNNs can reach an exponential storage capacity, O ( 2 n ) , clearly outperforming standard classical neural networks whose storage capacity scales linearly with the number of neurons n. We estimate, employing the Gardner program, the relative volume of CPTP maps with M ⩽ N stationary states and show that this volume decreases exponentially with M and shrinks to zero for M ⩾ N + 1. We generalize our results to QNNs storing mixed states as well as input–output relations for feed-forward QNNs. Our approach opens the path to relate storage properties of QNNs to the quantum features of the input–output states. This paper is dedicated to the memory of Peter Wittek.

arXiv:2011.06113•Quantum Science and Technology•Jun 1, 2021•30 citations

Quantum Perceptron Revisited: Computational-Statistical Tradeoffs

Mathieu Roget, Giuseppe Di Molfetta, Hachem Kadri

Quantum machine learning algorithms could provide significant speed-ups over their classical counterparts; however, whether they could also achieve good generalization remains unclear. Recently, two quantum perceptron models which give a quadratic improvement over the classical perceptron algorithm using Grover's search have been proposed by Wiebe et al. arXiv:1602.04799 . While the first model reduces the complexity with respect to the size of the training set, the second one improves the bound on the number of mistakes made by the perceptron. In this paper, we introduce a hybrid quantum-classical perceptron algorithm with lower complexity and better generalization ability than the classical perceptron. We show a quadratic improvement over the classical perceptron in both the number of samples and the margin of the data. We derive a bound on the expected error of the hypothesis returned by our algorithm, which compares favorably to the one obtained with the classical online perceptron. We use numerical experiments to illustrate the trade-off between computational complexity and statistical accuracy in quantum perceptron learning and discuss some of the key practical issues surrounding the implementation of quantum perceptron models into near-term quantum devices, whose practical implementation represents a serious challenge due to inherent noise. However, the potential benefits make correcting this worthwhile.

•Jan 1, 2022•0 citations
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 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.
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.
Abstract We study the storage capacity of quantum neural networks (QNNs), described by completely positive trace preserving (CPTP) maps acting on an N-dimensional Hilbert space. We demonstrate that attractor QNNs can store in a non-trivial manner up to N linearly independent pure states. For n qubits, QNNs can reach an exponential storage capacity, O ( 2 n ) , clearly outperforming standard classical neural networks whose storage capacity scales linearly with the number of neurons n. We estimate, employing the Gardner program, the relative volume of CPTP maps with M ⩽ N stationary states and show that this volume decreases exponentially with M and shrinks to zero for M ⩾ N + 1. We generalize our results to QNNs storing mixed states as well as input–output relations for feed-forward QNNs. Our approach opens the path to relate storage properties of QNNs to the quantum features of the input–output states. This paper is dedicated to the memory of Peter Wittek.
Quantum machine learning algorithms could provide significant speed-ups over their classical counterparts; however, whether they could also achieve good generalization remains unclear. Recently, two quantum perceptron models which give a quadratic improvement over the classical perceptron algorithm using Grover's search have been proposed by Wiebe et al. arXiv:1602.04799 . While the first model reduces the complexity with respect to the size of the training set, the second one improves the bound on the number of mistakes made by the perceptron. In this paper, we introduce a hybrid quantum-classical perceptron algorithm with lower complexity and better generalization ability than the classical perceptron. We show a quadratic improvement over the classical perceptron in both the number of samples and the margin of the data. We derive a bound on the expected error of the hypothesis returned by our algorithm, which compares favorably to the one obtained with the classical online perceptron. We use numerical experiments to illustrate the trade-off between computational complexity and statistical accuracy in quantum perceptron learning and discuss some of the key practical issues surrounding the implementation of quantum perceptron models into near-term quantum devices, whose practical implementation represents a serious challenge due to inherent noise. However, the potential benefits make correcting this worthwhile.