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

Fourier analysis of quantum neural network with non-linear data embedding

Haiyue Kang, Martin Sevior, Muhammad Usman

quant-phSubmitted Jun 12, 2026• Announced Jun 15, 2026• 1 citation
arXivHTMLPDF

Abstract

Fourier analysis has become a crucial tool for understanding the expressivity of Variational Quantum Circuit (VQC) models, as well as an important indicator of barren plateaus (BP). While existing literature has only studied angle-embedded VQCs in a noiseless environment, here we develop the Fourier analysis of VQCs with non-linear data embedding, with particular focus on amplitude embedding, which provides a naturally compact encoding scheme. We first investigate a subtle difference in the domain of input features within amplitude embedding that leads to a distinct expressivity of the zero-frequency Fourier coefficient. By assuming that the ensemble of unitaries generated from the parameter space forms at least a 2-design with respect to the unitary group, we derive, via Weingarten calculus, that the mean of the Fourier coefficients is concentrated at zero, and the variance scales at an exponentially decaying order with respect to the multi-dimensional frequency magnitude. When a noise channel with unitary Kraus operators and probabilities $\{p_k\}$ is taken into account, the variance is further suppressed by a factor $\left(\sum_k p_k^2\right)^{Q}<1$, where $Q$ is the number of channel instances applied. Furthermore, we demonstrate and validate the analytical results through simulations, both noiseless and noisy, including a case where target functions are decomposed into non-integer frequencies, highlighting the practical utility of the approach. Our results establish a rigorous Fourier framework for amplitude-encoded VQCs, offering both theoretical guarantees on expressivity, hence trainability scaling in the frequency domain, as well as practical simulations for deployment on noisy quantum devices.

Comments
26 pages, 12 figures

Related papers

Fourier Series Guided Design of Quantum Convolutional Neural Networks for Enhanced Time Series Forecasting]{Fourier Series Guided Design of Quantum Convolutional Neural Networks for Enhanced Time Series Forecasting

Sandra Leticia Juárez-Osorio, Mayra Alejandra Rivera-Ruiz, Andres Méndez-Vázquez +2 more

Abstract In this work, we apply 1D quantum convolution in the task of time series forecasting. By encoding multiple points into the quantum circuit to predict subsequent data, each point becomes a feature and the problem becomes a multidimensional one. Taking as basis previous theoretical works which demonstrated that Variational Quantum Circuits (VQCs) can be expressed as multidimensional Fourier series, the capabilities of different architectures and ansatz are explored. This analysis considers the concepts of circuit expressivity and the presence of barren plateaus. Analyzing the problem within the framework of the Fourier series enabled the incorporation of data reuploading in the architecture, resulting in enhanced performance. Rather than a strict requirement for the number of free parameters to exceed the degrees of freedom of the Fourier series, our findings suggest that even a limited number of parameters can produce Fourier functions of higher degrees. This highlights the remarkable expressive power of quantum circuits. This observation is also significant in reducing training times. The ansatz with greater expressivity and number of non-zero Fourier coefficients consistently delivers favorable results across different scenarios, with performance metrics improving as the number of qubits increases.

•Sep 9, 2024•0 citations

Fourier Series Guided Design of Quantum Convolutional Neural Networks for Enhanced Time Series Forecasting

Sandra Leticia Juárez-Osorio, Mayra Alejandra Rivera-Ruiz, Andres Méndez-Vázquez +1 more

In this study, we apply 1D quantum convolution to address the task of time series forecasting. By encoding multiple points into the quantum circuit to predict subsequent data, each point becomes a feature, transforming the problem into a multidimensional one. Building on theoretical foundations from prior research, which demonstrated that Variational Quantum Circuits (VQCs) can be expressed as multidimensional Fourier series, we explore the capabilities of different architectures and ansatz. This analysis considers the concepts of circuit expressibility and the presence of barren plateaus. Analyzing the problem within the framework of the Fourier series enabled the design of an architecture that incorporates data reuploading, resulting in enhanced performance. Rather than a strict requirement for the number of free parameters to exceed the degrees of freedom of the Fourier series, our findings suggest that even a limited number of parameters can produce Fourier functions of higher degrees. This highlights the remarkable expressive power of quantum circuits. This observation is also significant in reducing training times. The ansatz with greater expressibility and number of non-zero Fourier coefficients consistently delivers favorable results across different scenarios, with performance metrics improving as the number of qubits increases.

arXiv:2404.15377•Apr 23, 2024•4 citations

Fourier series guided design of quantum convolutional neural networks for enhanced time series forecasting

Sandra Leticia Juárez-Osorio, Mayra Alejandra Rivera-Ruiz, Andres Méndez-Vázquez +2 more

Abstract In this work, we explore the application of 1D quantum convolutional layers for time series forecasting, framing the problem within the context of machine learning and quantum circuit expressivity. By encoding multiple time steps as features into a quantum circuit, the forecasting task becomes intrinsically multidimensional. We leverage the recent theoretical results that describe Variational Quantum Circuits (VQCs) as multidimensional Fourier series, to design a more expressive 1D quantum convolutional neural network in which an enhanced performance is obtained by reuploading the data. We aim to relate the number of accessible coefficients in each architecture design with the obtained metrics. Our analysis incorporates key machine learning concepts such as expressivity and the presence of barren plateaus, evaluating their impact on generalization and training efficiency. Notably, we show that even with a limited number of trainable parameters, quantum circuits can approximate high-degree Fourier functions, underscoring their expressive capacity and computational efficiency. Our results demonstrate that more expressive ansatz, characterized by richer Fourier spectra, consistently yield improved predictive performance as the number of qubits increases. This study bridges theoretical insights from quantum physics with practical advances in machine learning model design for time series forecasting.

Physica Scripta•Oct 1, 2025•2 citations

An exponentially-growing family of universal quantum circuits

Mohammad Kordzanganeh, Pavel Sekatski, Leonid Evgenevich Fedichkin +1 more

Abstract Quantum machine learning has become an area of growing interest but has certain theoretical and hardware-specific limitations. Notably, the problem of vanishing gradients, or barren plateaus, renders the training impossible for circuits with high qubit counts, imposing a limit on the number of qubits that data scientists can use for solving problems. Independently, angle-embedded supervised quantum neural networks were shown to produce truncated Fourier series with a degree directly dependent on two factors: the depth of the encoding and the number of parallel qubits the encoding applied to. The degree of the Fourier series limits the model expressivity. This work introduces two new architectures whose Fourier degrees grow exponentially: the sequential and parallel exponential quantum machine learning architectures. This is done by efficiently using the available Hilbert space when encoding, increasing the expressivity of the quantum encoding. Therefore, the exponential growth allows staying at the low-qubit limit to create highly expressive circuits avoiding barren plateaus. Practically, parallel exponential architecture was shown to outperform the existing linear architectures by reducing their final mean square error value by up to 44.7% in a one-dimensional test problem. Furthermore, the feasibility of this technique was also shown on a trapped ion quantum processing unit.

arXiv:2212.00736•Machine Learning Science and Technology•Jul 13, 2023•27 citations

On Embedding Design in Quantum Physics-Informed Neural Networks

Ban Q. Tran, Nahid Binandeh Dehaghani, Susan Mengel +2 more

Quantum physics-informed neural networks (QPINNs) solve partial differential equations (PDEs) by training parameterized quantum circuits against physics-based residuals, yet the role of the embedding that maps coordinates into quantum states remains insufficiently understood. In this research, we introduce a unified embedding framework that formulates embedding as a functional transformation shaping the feature representation available to the variational circuit, and we propose two embeddings within it. The Linear Quantum Neural Network Trainable Embedding QPINN (LQNN-TE-QPINN) generates data-dependent features with an auxiliary quantum circuit and adds them to the input coordinates, instead of multiplying them as in our previous formulation. The adaptive-frequency QPINN (AdaFreq-QPINN) promotes the frequency-scaling factors of an arccos-Chebyshev encoding to trainable parameters. We evaluate both against direct and fixed analytical frequency encodings and alternative hybrid architectures on one- and two-dimensional Burgers equations. In one dimension, LQNN-TE-QPINN achieves a relative $L_2$ error of 0.0916 with 720 trainable parameters, compared with 0.4501 for direct-encoding QPINN and 0.1233 for a locally adaptive classical physics-informed neural network with approximately eleven times more parameters, while AdaFreq-QPINN attains the lowest error among the analytical embeddings with only four additional parameters. In two dimensions, LQNN-TE-QPINN attains the lowest training objective, although its solution error is not clearly separated from that of a data re-uploading QPINN. Under simulated hardware noise, LQNN-TE-QPINN retains the lowest absolute derivative error while degrading most relative to its noiseless baseline. These results demonstrate that embedding design substantially influences the approximation and optimization behavior of QPINNs.

quant-pharXiv:2609.33700•Sep 29, 2026•0 citations

Feature Encoding in Quantum Machine Learning: A Survey and Practical Guidelines

Vincenzo Sammartino

The encoding of classical data into quantum states constitutes the primary performance bottleneck in Quantum Machine Learning (qml) on Noisy Intermediate-Scale Quantum (nisq) devices. No existing framework jointly characterises resource cost, expressivity, and noise robustness, nor provides actionable selection guidelines for practitioners. This survey addresses that gap through a systematic review of 66 primary works (2017-2026) assembled via a PRISMA-adapted protocol across five academic databases. Four principal contributions are made. First, a three-axis cost-expressivity-robustness taxonomy classifies all major encoding families - basis, angle, dense-angle, amplitude, data re-uploading, and IQP - along independently measurable axes. Second, closed-form depth-fidelity bounds under nisq decoherence channels identify the critical gate-error rate p* ~ 10^-3 below which amplitude encoding is viable. Third, a unified treatment of Fourier expressivity, barren-plateau onset, and quantum kernel concentration as functions of the encoding circuit provides the first joint trainability analysis. Fourth, a five-regime decision framework maps (D, n, p, tau) - feature dimension, qubit budget, error rate, and task type - to a hardware-grounded encoding recommendation. The central finding is that for p >= 10^-3, shallow angle-based encodings consistently outperform amplitude encoding in practice, despite the latter's exponential qubit advantage.

quant-pharXiv:2606.05387•Jun 5, 2026•3 citations
Fourier analysis has become a crucial tool for understanding the expressivity of Variational Quantum Circuit (VQC) models, as well as an important indicator of barren plateaus (BP). While existing literature has only studied angle-embedded VQCs in a noiseless environment, here we develop the Fourier analysis of VQCs with non-linear data embedding, with particular focus on amplitude embedding, which provides a naturally compact encoding scheme. We first investigate a subtle difference in the domain of input features within amplitude embedding that leads to a distinct expressivity of the zero-frequency Fourier coefficient. By assuming that the ensemble of unitaries generated from the parameter space forms at least a 2-design with respect to the unitary group, we derive, via Weingarten calculus, that the mean of the Fourier coefficients is concentrated at zero, and the variance scales at an exponentially decaying order with respect to the multi-dimensional frequency magnitude. When a noise channel with unitary Kraus operators and probabilities {pk}\{p_k\}{pk​} is taken into account, the variance is further suppressed by a factor (∑kpk2)Q<1\left(\sum_k p_k^2\right)^{Q}<1(∑k​pk2​)Q<1, where QQQ is the number of channel instances applied. Furthermore, we demonstrate and validate the analytical results through simulations, both noiseless and noisy, including a case where target functions are decomposed into non-integer frequencies, highlighting the practical utility of the approach. Our results establish a rigorous Fourier framework for amplitude-encoded VQCs, offering both theoretical guarantees on expressivity, hence trainability scaling in the frequency domain, as well as practical simulations for deployment on noisy quantum devices.
Abstract In this work, we apply 1D quantum convolution in the task of time series forecasting. By encoding multiple points into the quantum circuit to predict subsequent data, each point becomes a feature and the problem becomes a multidimensional one. Taking as basis previous theoretical works which demonstrated that Variational Quantum Circuits (VQCs) can be expressed as multidimensional Fourier series, the capabilities of different architectures and ansatz are explored. This analysis considers the concepts of circuit expressivity and the presence of barren plateaus. Analyzing the problem within the framework of the Fourier series enabled the incorporation of data reuploading in the architecture, resulting in enhanced performance. Rather than a strict requirement for the number of free parameters to exceed the degrees of freedom of the Fourier series, our findings suggest that even a limited number of parameters can produce Fourier functions of higher degrees. This highlights the remarkable expressive power of quantum circuits. This observation is also significant in reducing training times. The ansatz with greater expressivity and number of non-zero Fourier coefficients consistently delivers favorable results across different scenarios, with performance metrics improving as the number of qubits increases.
In this study, we apply 1D quantum convolution to address the task of time series forecasting. By encoding multiple points into the quantum circuit to predict subsequent data, each point becomes a feature, transforming the problem into a multidimensional one. Building on theoretical foundations from prior research, which demonstrated that Variational Quantum Circuits (VQCs) can be expressed as multidimensional Fourier series, we explore the capabilities of different architectures and ansatz. This analysis considers the concepts of circuit expressibility and the presence of barren plateaus. Analyzing the problem within the framework of the Fourier series enabled the design of an architecture that incorporates data reuploading, resulting in enhanced performance. Rather than a strict requirement for the number of free parameters to exceed the degrees of freedom of the Fourier series, our findings suggest that even a limited number of parameters can produce Fourier functions of higher degrees. This highlights the remarkable expressive power of quantum circuits. This observation is also significant in reducing training times. The ansatz with greater expressibility and number of non-zero Fourier coefficients consistently delivers favorable results across different scenarios, with performance metrics improving as the number of qubits increases.
Abstract In this work, we explore the application of 1D quantum convolutional layers for time series forecasting, framing the problem within the context of machine learning and quantum circuit expressivity. By encoding multiple time steps as features into a quantum circuit, the forecasting task becomes intrinsically multidimensional. We leverage the recent theoretical results that describe Variational Quantum Circuits (VQCs) as multidimensional Fourier series, to design a more expressive 1D quantum convolutional neural network in which an enhanced performance is obtained by reuploading the data. We aim to relate the number of accessible coefficients in each architecture design with the obtained metrics. Our analysis incorporates key machine learning concepts such as expressivity and the presence of barren plateaus, evaluating their impact on generalization and training efficiency. Notably, we show that even with a limited number of trainable parameters, quantum circuits can approximate high-degree Fourier functions, underscoring their expressive capacity and computational efficiency. Our results demonstrate that more expressive ansatz, characterized by richer Fourier spectra, consistently yield improved predictive performance as the number of qubits increases. This study bridges theoretical insights from quantum physics with practical advances in machine learning model design for time series forecasting.
Abstract Quantum machine learning has become an area of growing interest but has certain theoretical and hardware-specific limitations. Notably, the problem of vanishing gradients, or barren plateaus, renders the training impossible for circuits with high qubit counts, imposing a limit on the number of qubits that data scientists can use for solving problems. Independently, angle-embedded supervised quantum neural networks were shown to produce truncated Fourier series with a degree directly dependent on two factors: the depth of the encoding and the number of parallel qubits the encoding applied to. The degree of the Fourier series limits the model expressivity. This work introduces two new architectures whose Fourier degrees grow exponentially: the sequential and parallel exponential quantum machine learning architectures. This is done by efficiently using the available Hilbert space when encoding, increasing the expressivity of the quantum encoding. Therefore, the exponential growth allows staying at the low-qubit limit to create highly expressive circuits avoiding barren plateaus. Practically, parallel exponential architecture was shown to outperform the existing linear architectures by reducing their final mean square error value by up to 44.7% in a one-dimensional test problem. Furthermore, the feasibility of this technique was also shown on a trapped ion quantum processing unit.
Quantum physics-informed neural networks (QPINNs) solve partial differential equations (PDEs) by training parameterized quantum circuits against physics-based residuals, yet the role of the embedding that maps coordinates into quantum states remains insufficiently understood. In this research, we introduce a unified embedding framework that formulates embedding as a functional transformation shaping the feature representation available to the variational circuit, and we propose two embeddings within it. The Linear Quantum Neural Network Trainable Embedding QPINN (LQNN-TE-QPINN) generates data-dependent features with an auxiliary quantum circuit and adds them to the input coordinates, instead of multiplying them as in our previous formulation. The adaptive-frequency QPINN (AdaFreq-QPINN) promotes the frequency-scaling factors of an arccos-Chebyshev encoding to trainable parameters. We evaluate both against direct and fixed analytical frequency encodings and alternative hybrid architectures on one- and two-dimensional Burgers equations. In one dimension, LQNN-TE-QPINN achieves a relative L2L_2L2​ error of 0.0916 with 720 trainable parameters, compared with 0.4501 for direct-encoding QPINN and 0.1233 for a locally adaptive classical physics-informed neural network with approximately eleven times more parameters, while AdaFreq-QPINN attains the lowest error among the analytical embeddings with only four additional parameters. In two dimensions, LQNN-TE-QPINN attains the lowest training objective, although its solution error is not clearly separated from that of a data re-uploading QPINN. Under simulated hardware noise, LQNN-TE-QPINN retains the lowest absolute derivative error while degrading most relative to its noiseless baseline. These results demonstrate that embedding design substantially influences the approximation and optimization behavior of QPINNs.
The encoding of classical data into quantum states constitutes the primary performance bottleneck in Quantum Machine Learning (qml) on Noisy Intermediate-Scale Quantum (nisq) devices. No existing framework jointly characterises resource cost, expressivity, and noise robustness, nor provides actionable selection guidelines for practitioners. This survey addresses that gap through a systematic review of 66 primary works (2017-2026) assembled via a PRISMA-adapted protocol across five academic databases. Four principal contributions are made. First, a three-axis cost-expressivity-robustness taxonomy classifies all major encoding families - basis, angle, dense-angle, amplitude, data re-uploading, and IQP - along independently measurable axes. Second, closed-form depth-fidelity bounds under nisq decoherence channels identify the critical gate-error rate p* ~ 10^-3 below which amplitude encoding is viable. Third, a unified treatment of Fourier expressivity, barren-plateau onset, and quantum kernel concentration as functions of the encoding circuit provides the first joint trainability analysis. Fourth, a five-regime decision framework maps (D, n, p, tau) - feature dimension, qubit budget, error rate, and task type - to a hardware-grounded encoding recommendation. The central finding is that for p >= 10^-3, shallow angle-based encodings consistently outperform amplitude encoding in practice, despite the latter's exponential qubit advantage.