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:2510.06945 · Machine Learning Science and Technology

Fisher information, training and bias in Fourier regression models

Lorenzo Pastori, Veronika Eyring, Mierk Schwabe

Published Jul 23, 2026• 3 citations
arXivHTMLPDF

Abstract

Abstract Motivated by the growing interest in quantum machine learning, in particular quantum neural networks (QNNs), we study how recently introduced evaluation metrics based on the Fisher information matrix (FIM) are effective for predicting their training and prediction performance. We exploit the equivalence between a broad class of QNNs and Fourier models, and study the interplay between the effective dimension (ED) and the bias of a model towards a given task, investigating how these affect the model’s training and performance. We show that for a model that is completely agnostic, or unbiased, towards the function to be learned, a higher ED likely results in a better trainability and performance. On the other hand, for models that are biased towards the function to be learned a lower ED is likely beneficial during training. To obtain these results, we derive an analytical expression of the FIM for Fourier models and identify the features controlling a model’s ED. This allows us to construct models with tunable ED and bias, and to compare their training. We furthermore introduce a tensor network representation of the considered Fourier models, which could be a tool of independent interest for the analysis of QNN models. Overall, these findings provide an explicit example of the interplay between geometrical properties, model-task alignment and training, which are relevant for the broader machine learning community.

DOI
10.1088/2632-2153/ae8fb7

Related papers

Fourier Analysis Perspective on Quantum Neural Networks

Seungcheol Oh, Emily Jimin Roh, Athanasios V. Vasilakos +2 more

Quantum neural networks (QNNs), typically implemented via parameterized quantum circuits (PQCs), offer a potential route to quantum advantage in learning. We review recent progress through the Fourier structure of PQCs: the encoding Hamiltonian fixes the accessible frequency set, while training estimates the corresponding Fourier coefficients. This perspective explains how QNNs can mitigate the spectral bias that limits classical deep neural networks and motivates task-specialized designs. In particular, quantum ordinary differential equation (QODE) solver, quantum convolutional neural networks (QCNNs) and quantum reinforcement learning (QRL) exploit frequency pinching to better capture high-frequency image features and structured value landscapes. We further discuss trainability on noisy intermediate-scale quantum (NISQ) hardware, emphasizing Lie-algebraic and Fourier views of barren plateaus and practical mitigation strategies. Together, the Fourier and Lie perspectives yield concrete design principles and motivate quantum-native architectures built around spectral bias avoidance rather than classical imitation. Quantum neural networks (QNNs), implemented via parameterized quantum circuits (PQCs), promise a path to quantum advantage in learning by addressing the limitations of classical deep neural networks. Here, the authors explore the Fourier structure of PQCs to mitigate spectral bias, enhancing applications like quantum ODE solvers and quantum reinforcement learning, with implications for designing quantum-native architectures.

Communications Physics•May 18, 2026•3 citations

Neural Fourier Surrogates for Data Reuploading Quantum Neural Networks

Oliver Knitter, Jonathan Mei, Sang Hyub Kim +3 more

For quantum machine learning, the exact boundary between classical and quantum advantage is still poorly understood. Direct comparison between quantum neural networks (QNNs) and existing classical models, which encompass fundamentally different function classes, often fails to provide broader insight into the difference between the two. Inspired by the techniques of Neural Quantum States and Random Fourier Features, this work introduces Neural Fourier Surrogates (NFS), a stochastic classical neural network architecture for efficiently learning coefficients over the same finite Fourier series support as quantum neural networks. Testing on a selection of tabular benchmark datasets, we find that NFS is an effective classifier architecture broadly competitive with established classical baselines, including a comparable Random Fourier Features model, and possessing comparable performance to data-reuploading QNNs; combined with additional analysis comparing the learned Fourier spectra of QNNs and NFS on synthetic data, these results establish NFS as a natural classical baseline for evaluating QNN performance.

quant-pharXiv:2610.00841•Oct 2, 2026•1 citation

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

A Unified Frequency Principle for Quantum and Classical Machine Learning

Rundi Lu, Ruiqi Zhang, Weikang Li +3 more

Quantum neural networks constitute a key class of near-term quantum learning models, yet their training dynamics remain not fully understood. Here, we present a unified theoretical framework for the frequency principle (F-principle) that characterizes the training dynamics of both classical and quantum neural networks. Within this framework, we prove that quantum neural networks exhibit a spectral bias toward learning low-frequency components of target functions, mirroring the behavior observed in classical deep networks. We further analyze the impact of noise and show that, when single-qubit noise is applied after encoding-layer rotations and modeled as a Pauli channel aligned with the rotation axis, the Fourier component labeled by $\boldsymbolω$ is suppressed by a factor $(1-2γ)^{\|\boldsymbolω\|_1}$. This leads to exponential attenuation of high-frequency terms while preserving the learnability of low-frequency structure. In the same setting, we establish that the resulting noisy circuits admit efficient classical simulation up to average-case error. Numerical experiments corroborate our theoretical predictions: Quantum neural networks primarily learn low-frequency features during early optimization and maintain robustness against dephasing and depolarizing noise acting on the encoding layer. Our results provide a frequency-domain lens that unifies classical and quantum learning dynamics, clarifies the role of noise in shaping trainability, and guides the design of noise-resilient quantum neural networks.

quant-pharXiv:2601.03169•Jan 7, 2026•6 citations

Analyzing the Expressibility and Trainability of Quantum Convolutional Neural Networks

Asif Akhtab Ronggon, Tuhin Hossain, Tahani Jaser Alahmadi +1 more

Abstract Quantum Convolutional Neural Networks(QCNN) are a promising framework in QuantumMachine Learning(QML). The study analyzes QCNNs’ expressibility, trainability, and optimizers theoretically. This approach utilizes statistical learning and quantum information theory to assess QCNNs’ effectiveness in imitating quantum states, optimizing parameters, and executing intricate machine learning(ML) tasks. For this purpose, the Haar measure is used to evaluate the QCNN expressibility, yielding a score of 0.7720, acoverage entropy of 1.4023, and an effective state-space dimension of 166.59/200. This indicates that QCNNs can simulate massive quantum states and achieve a peak expressibility score of 0.8120 at layer 3, before decreasing due to overparameterization. Additionally, we examine gradient variance and find that the barren plateau indicator is 0.0818 and the mean gradient norm is 1.1837, both of which are below the theoretical threshold of 0.1, proving that the QCNN can avoid barren plateaus and train perfectly. Furthermore, the obtained Fisher Information Matrix(FIM) condition number of 2.05 ×10³ indicates a well-conditioned optimization landscape. We also utilized the Hessian matrix for optimization analysis, identifying a saddle point with 56 zero, 11 positive,and 5 negative eigenvalues. Where QCNNs required only 72 parameters, an 11.8-fold reduction from classical CNNs’ 848 parameters, but expressibility stays the same, assuming smooth convergence. Despite a gradient noise factor near 1, QCNNs have only a 43% expressibility decrease at 5% noise levels. Finally, the outcomes prove that QCNNs outperform classical CNNs in ML applications with respect to expressibility, trainability, and optimization.

•May 25, 2026•0 citations

On fundamental aspects of quantum extreme learning machines

Weijie Xiong, Giorgio Facelli, Mehrad Sahebi +4 more

Abstract Quantum extreme learning machines (QELMs) have emerged as a promising framework for quantum machine learning. Their appeal lies in the rich feature map induced by the dynamics of a quantum substrate—the quantum reservoir—and the efficient post-measurement training via linear regression. Here, we study the expressivity of QELMs by decomposing the prediction of QELMs into a Fourier series. We show that the achievable Fourier frequencies are determined by the data encoding scheme, while Fourier coefficients depend on both the reservoir and the measurement. Notably, the expressivity of QELMs is fundamentally limited by the number of Fourier frequencies and the number of observables, while the complexity of the prediction hinges on the reservoir. As a cautionary note on scalability, we identify four sources that can lead to the exponential concentration of the observables as the system size grows (randomness, hardware noise, entanglement, and global measurements) and show how this can turn QELMs into useless input-agnostic oracles. In particular, our result on the reservoir-induced concentration strongly indicates that quantum reservoirs drawn from a highly random ensemble make QELM models unscalable. Our analysis elucidates the potential and fundamental limitations of QELMs and lays the groundwork for systematically exploring quantum reservoir systems for other machine learning tasks.

arXiv:2312.15124•Quantum Machine Intelligence•Feb 13, 2025•75 citations
Abstract Motivated by the growing interest in quantum machine learning, in particular quantum neural networks (QNNs), we study how recently introduced evaluation metrics based on the Fisher information matrix (FIM) are effective for predicting their training and prediction performance. We exploit the equivalence between a broad class of QNNs and Fourier models, and study the interplay between the effective dimension (ED) and the bias of a model towards a given task, investigating how these affect the model’s training and performance. We show that for a model that is completely agnostic, or unbiased, towards the function to be learned, a higher ED likely results in a better trainability and performance. On the other hand, for models that are biased towards the function to be learned a lower ED is likely beneficial during training. To obtain these results, we derive an analytical expression of the FIM for Fourier models and identify the features controlling a model’s ED. This allows us to construct models with tunable ED and bias, and to compare their training. We furthermore introduce a tensor network representation of the considered Fourier models, which could be a tool of independent interest for the analysis of QNN models. Overall, these findings provide an explicit example of the interplay between geometrical properties, model-task alignment and training, which are relevant for the broader machine learning community.
Quantum neural networks (QNNs), typically implemented via parameterized quantum circuits (PQCs), offer a potential route to quantum advantage in learning. We review recent progress through the Fourier structure of PQCs: the encoding Hamiltonian fixes the accessible frequency set, while training estimates the corresponding Fourier coefficients. This perspective explains how QNNs can mitigate the spectral bias that limits classical deep neural networks and motivates task-specialized designs. In particular, quantum ordinary differential equation (QODE) solver, quantum convolutional neural networks (QCNNs) and quantum reinforcement learning (QRL) exploit frequency pinching to better capture high-frequency image features and structured value landscapes. We further discuss trainability on noisy intermediate-scale quantum (NISQ) hardware, emphasizing Lie-algebraic and Fourier views of barren plateaus and practical mitigation strategies. Together, the Fourier and Lie perspectives yield concrete design principles and motivate quantum-native architectures built around spectral bias avoidance rather than classical imitation. Quantum neural networks (QNNs), implemented via parameterized quantum circuits (PQCs), promise a path to quantum advantage in learning by addressing the limitations of classical deep neural networks. Here, the authors explore the Fourier structure of PQCs to mitigate spectral bias, enhancing applications like quantum ODE solvers and quantum reinforcement learning, with implications for designing quantum-native architectures.
For quantum machine learning, the exact boundary between classical and quantum advantage is still poorly understood. Direct comparison between quantum neural networks (QNNs) and existing classical models, which encompass fundamentally different function classes, often fails to provide broader insight into the difference between the two. Inspired by the techniques of Neural Quantum States and Random Fourier Features, this work introduces Neural Fourier Surrogates (NFS), a stochastic classical neural network architecture for efficiently learning coefficients over the same finite Fourier series support as quantum neural networks. Testing on a selection of tabular benchmark datasets, we find that NFS is an effective classifier architecture broadly competitive with established classical baselines, including a comparable Random Fourier Features model, and possessing comparable performance to data-reuploading QNNs; combined with additional analysis comparing the learned Fourier spectra of QNNs and NFS on synthetic data, these results establish NFS as a natural classical baseline for evaluating QNN performance.
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 constitute a key class of near-term quantum learning models, yet their training dynamics remain not fully understood. Here, we present a unified theoretical framework for the frequency principle (F-principle) that characterizes the training dynamics of both classical and quantum neural networks. Within this framework, we prove that quantum neural networks exhibit a spectral bias toward learning low-frequency components of target functions, mirroring the behavior observed in classical deep networks. We further analyze the impact of noise and show that, when single-qubit noise is applied after encoding-layer rotations and modeled as a Pauli channel aligned with the rotation axis, the Fourier component labeled by ω\boldsymbolωω is suppressed by a factor (1−2γ)∥ω∥1(1-2γ)^{\|\boldsymbolω\|_1}(1−2γ)∥ω∥1​. This leads to exponential attenuation of high-frequency terms while preserving the learnability of low-frequency structure. In the same setting, we establish that the resulting noisy circuits admit efficient classical simulation up to average-case error. Numerical experiments corroborate our theoretical predictions: Quantum neural networks primarily learn low-frequency features during early optimization and maintain robustness against dephasing and depolarizing noise acting on the encoding layer. Our results provide a frequency-domain lens that unifies classical and quantum learning dynamics, clarifies the role of noise in shaping trainability, and guides the design of noise-resilient quantum neural networks.
Abstract Quantum Convolutional Neural Networks(QCNN) are a promising framework in QuantumMachine Learning(QML). The study analyzes QCNNs’ expressibility, trainability, and optimizers theoretically. This approach utilizes statistical learning and quantum information theory to assess QCNNs’ effectiveness in imitating quantum states, optimizing parameters, and executing intricate machine learning(ML) tasks. For this purpose, the Haar measure is used to evaluate the QCNN expressibility, yielding a score of 0.7720, acoverage entropy of 1.4023, and an effective state-space dimension of 166.59/200. This indicates that QCNNs can simulate massive quantum states and achieve a peak expressibility score of 0.8120 at layer 3, before decreasing due to overparameterization. Additionally, we examine gradient variance and find that the barren plateau indicator is 0.0818 and the mean gradient norm is 1.1837, both of which are below the theoretical threshold of 0.1, proving that the QCNN can avoid barren plateaus and train perfectly. Furthermore, the obtained Fisher Information Matrix(FIM) condition number of 2.05 ×10³ indicates a well-conditioned optimization landscape. We also utilized the Hessian matrix for optimization analysis, identifying a saddle point with 56 zero, 11 positive,and 5 negative eigenvalues. Where QCNNs required only 72 parameters, an 11.8-fold reduction from classical CNNs’ 848 parameters, but expressibility stays the same, assuming smooth convergence. Despite a gradient noise factor near 1, QCNNs have only a 43% expressibility decrease at 5% noise levels. Finally, the outcomes prove that QCNNs outperform classical CNNs in ML applications with respect to expressibility, trainability, and optimization.
Abstract Quantum extreme learning machines (QELMs) have emerged as a promising framework for quantum machine learning. Their appeal lies in the rich feature map induced by the dynamics of a quantum substrate—the quantum reservoir—and the efficient post-measurement training via linear regression. Here, we study the expressivity of QELMs by decomposing the prediction of QELMs into a Fourier series. We show that the achievable Fourier frequencies are determined by the data encoding scheme, while Fourier coefficients depend on both the reservoir and the measurement. Notably, the expressivity of QELMs is fundamentally limited by the number of Fourier frequencies and the number of observables, while the complexity of the prediction hinges on the reservoir. As a cautionary note on scalability, we identify four sources that can lead to the exponential concentration of the observables as the system size grows (randomness, hardware noise, entanglement, and global measurements) and show how this can turn QELMs into useless input-agnostic oracles. In particular, our result on the reservoir-induced concentration strongly indicates that quantum reservoirs drawn from a highly random ensemble make QELM models unscalable. Our analysis elucidates the potential and fundamental limitations of QELMs and lays the groundwork for systematically exploring quantum reservoir systems for other machine learning tasks.