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:2609.17991

Fourier Analysis of Parametrized Interactive Quantum Classifiers

Fábio Novaes, Fernando M. de Paula Neto, João V. M. Cardoso

quant-phcs.LGSubmitted Sep 16, 2026• Announced Sep 17, 2026• 0 citations
arXivHTMLPDF

Abstract

Interactive Quantum Classifiers (IQCs) constitute a family of quantum machine learning models inspired by open quantum systems, in which the interaction between a target qubit and an environment is described by a Hamiltonian. Previous works introduced alternative Hamiltonian parameterizations and showed empirically that they can improve classification performance, but the role of these parameters in the resulting classifier remains poorly understood. In this work, we derive a closed-form expression for the reduced quantum channel generated by a parametrized IQC with a single target qubit. The analytical solution explicitly reveals how the Hamiltonian parameters control the constant, sine, and cosine components of the classifier output, establishing a Fourier interpretation of the induced feature map. This analysis motivates a generalized family of Hamiltonian encodings, including matrix-parameterized environmental Hamiltonians whose Fourier components depend on linear combinations of input features, thereby enabling non-separable Fourier structures. Numerical experiments on synthetic and real-world datasets show that the proposed models can improve classification performance on several nonlinear benchmarks. The generalized matrix encoding achieves the strongest aggregate performance in the evaluated benchmark, while a simpler four-parameter extension often attains comparable performance with substantially fewer trainable parameters. We additionally characterize the generated state ensembles using the standard fidelity-based expressibility measure, finding that global expressibility does not directly predict classification performance. Our results provide an analytical characterization of parametrized Hamiltonians in Interactive Quantum Classifiers and establish Fourier analysis as a useful framework for understanding and designing open-system-inspired quantum learning models.

AI Summary

Interactive Quantum Classifiers (IQCs) encode classical inputs through a target–environment interaction and predict from the reduced target state. This paper asks how their Hamiltonian parameters determine the represented function class, focusing on a single target qubit and a diagonal environmental Hamiltonian. For $H_t=\alpha_0 I+\boldsymbol\alpha\cdot\boldsymbol\sigma$ and $H_e=\operatorname{diag}(W\boldsymbol x)$, the reduced dynamics is derived as a random-unitary channel. A Bloch-vector calculation gives the output $f(\boldsymbol x)=C+\sum_l[A_l\cos(\boldsymbol\omega_l\cdot\boldsymbol x)+B_l\sin(\boldsymbol\omega_l\cdot\boldsymbol x)]$, with $\boldsymbol\omega_l=2\kappa\boldsymbol w_l$. The environment dimension $N_e$ bounds the number of indexed frequency components; their coefficients share constraints imposed by the target rotation axis, initialization, measurement, and environment probabilities. This motivates IQC-Multi, which replaces feature-wise encoding with trainable linear combinations and makes $N_e$ independent of input dimension. The amplitude-encoded variant is separately characterized as a diagonal quadratic form in normalized inputs. Classical simulations compare six variants on eleven datasets using ten train/test partitions and Adam or particle-swarm optimization. IQC-Multi with $N_e=8$ obtains aggregate accuracy $0.863$ versus $0.795$ for the original IQC; on XOR, the $N_e=4$ variant reaches $0.996$ while feature-wise variants remain near chance. Rankings depend on the dataset, and many pairwise differences are not statistically significant. Fidelity-distribution analyses find that global Haar-based expressibility does not directly predict classification performance. Stated limitations include shared Fourier coefficients and the mismatch between global-state expressibility and reduced-state predictions. Multiple target qubits, task-relevant expressibility measures, and scalable hardware implementations remain future directions.

Some signs of AI-generated textIncrementalMissing comparison

Error found: The reported aggregate classification table is inconsistent with the arithmetic means of the eleven dataset results in the appendix, although IQCmulti[8] remains the highest-accuracy model on that calculation. The trace-normalized target Hamiltonian's identity term induces an environment-local unitary rather than a global phase, so omitting it preserves classifier predictions but can change the global-state fidelity distributions used to assess expressibility.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
34+9 pages, 8 figures

Related papers

Analysis and proposal of a quantum classifier based on open quantum systems with amplitude information loading

Eduardo Barreto Brito

Although the studies on quantum algorithms have been progressing, it is still necessary to broaden the investigation of open quantum systems. In this study, we present the use of an open quantum system to implement a quantum classifier algorithm. Zhang et al. propose a one QuBit system interacting with the environment through a unitary operator that comes from the Hamiltonian. In our proposal, the input data is loaded into the amplitude of the environment instead of being in the unitary operator. This change positively impacts the performance of different databases tested and causes a difference in the system entanglement behavior. For evaluation, the Zhang et al. model and the proposed model were tested in four real-world datasets and seven other toy problems. The results are evaluated according to accuracy and F1-Score. A deeper analysis of the Iris dataset is also done, checking the creation of entanglement and an extensive random search for better parameters on the proposed model. The results show that for most real-world dataset configurations, the proposed model, although having a simpler decision area, performed better than the one inspired by the Zhang et al. model, and that there is no pattern for the system entanglement in the Iris Dataset. Due to an underperform for both models in a linearly separable problem, an exponential kernel was introduced. It resulted in an improvement in the accuracy of both models in most of the evaluated situations.

•Mar 26, 2024•0 citations

Scalable parameterized quantum circuits classifier

Xiaodong Ding, Zhihui Song, Jinchen Xu +3 more

As a generalized quantum machine learning model, parameterized quantum circuits (PQC) have been found to perform poorly in terms of classification accuracy and model scalability for multi-category classification tasks. To address this issue, we propose a scalable parameterized quantum circuits classifier (SPQCC), which performs per-channel PQC and combines the measurements as the output of the trainable parameters of the classifier. By minimizing the cross-entropy loss through optimizing the trainable parameters of PQC, SPQCC leads to a fast convergence of the classifier. The parallel execution of identical PQCs on different quantum machines with the same structure and scale reduces the complexity of classifier design. Classification simulations performed on the MNIST Dataset show that the accuracy of our proposed classifier far exceeds that of other quantum classification algorithms, achieving the state-of-the-art simulation result and surpassing/reaching classical classifiers with a considerable number of trainable parameters. Our classifier demonstrates excellent scalability and classification performance.

Scientific Reports•Jul 10, 2024•26 citations

A Matched Spectral Benchmark of Quantum Inspired Feature Maps

Toheeb Ogunade, Taofeek Kassim, Etinosa Osaro

Quantum machine learning is often motivated by the idea that quantum systems can expose useful high-dimensional structure that is difficult to access with classical models. We isolate one central component of this claim: the fixed data-encoding map. Amplitude, angle, and basis encoding are evaluated as deterministic feature maps for classical supervised learning under matched output dimensionality and strong classical controls. The benchmark compares these encodings against raw linear models, random Fourier features, polynomial features, PCA, RBF SVMs, and shallow neural networks across diverse classical datasets. Rather than treating performance as a single endpoint, we analyze the geometry of each representation through effective rank, condition number, centered kernel alignment, predictive performance, and practical overhead. The resulting picture is mechanistic: amplitude encoding can remove magnitude information through unit-sphere normalization, angle encoding can become geometrically redundant with raw linear features, and basis encoding can impose a binary Hamming geometry that is poorly aligned with smooth decision structure. These findings do not argue against quantum computation, however, they show that fixed quantum-inspired encoding geometry alone is not a reliable source of machine-learning advantage on classical data.

quant-pharXiv:2605.24324•May 26, 2026•1 citation

Variational Quantum Machine Learning for Binary Classification on NISQ Hardware: Expressibility, Trainability, and Noise Robustness

Priya S. Mehta, Aleksandr V. Korolev

This study investigates classification performance and trainability of variational quantum classifiers on near-term noisy quantum hardware across circuit depth and qubit count regimes within the context of quantum computing and machine learning, an area of growing scientific importance given its implications for hybrid quantum-classical algorithm design and practical NISQ hardware benchmarking for near-term quantum advantage assessment. Using gradient-based parameter optimization of parameterized quantum circuits with hardware noise modeling via density matrix simulation and physical execution on IBM Eagle processors, we examine expressibility of parameterized circuits enabling nonlinear decision boundaries in feature Hilbert space, with trainability constrained by barren plateau gradients at large qubit counts in 96 circuit architectures (4 qubit counts x 4 depths x 6 ansatz families) evaluated across 5 classification datasets with 20 random initialization seeds each drawn from IBM Quantum Eagle (127-qubit) and Falcon (27-qubit) processors with noise mitigation via zero-noise extrapolation. Results indicate that 10-qubit, 4-layer VQC achieves 84.2% classification accuracy on the best benchmark, within 3.8 percentage points of classical SVM, but gradient variance decays exponentially with qubit count (variance halving per 2 added qubits), confirming barren plateau scaling (p < 0.001), with 84.2% accuracy, 3.8 pp gap to classical SVM baseline as the primary quantitative benchmark. Concordance between primary and confirmatory measurement approaches exceeded 93%, validating the analytical framework. These findings contribute empirically to quantum computing and machine learning and carry actionable implications for the design of programs and policies targeting hybrid quantum-classical algorithm design and practical NISQ hardware benchmarking for near-term quantum advantage assessment.

Princeton Journal of Pre-Collegiate Research•Jan 1, 2021•0 citations

Quantum classifier based on open quantum systems with amplitude information loading

Eduardo Barreto Brito, Fernando M. de Paula Neto, Nadja K. Bernardes

Abstract Although the studies on quantum algorithms have been progressing, it is still necessary to broaden the investigation of open quantum systems. In this study, we present the use of an open quantum system to implement a quantum classifier algorithm. Zhang et al. propose a one QuBit system interacting with the environment through a unitary operator that comes from the Hamiltonian. In our proposal, the input data is loaded into the amplitude of the environment instead of being in the unitary operator. This change positively impacts the performance of different databases tested and causes a difference in the system entanglement behavior. For evaluation, both the Zhang et. al model and the proposed model were tested in four real-world datasets and seven other toy problems. The results are evaluated according to accuracy and F1-Score. A deeper analysis of the Iris dataset is also done, checking the creation of entanglement and an extensive random search for better parameters on the proposed model. The results show that for most real-world datasets configurations, the proposed model, although having a simpler decision area, performed better than the one inspired by the Zhang et. al model, and that there is no pattern for the system entanglement in the Iris Dataset.

Quantum Information Processing•Oct 8, 2024•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
Interactive Quantum Classifiers (IQCs) constitute a family of quantum machine learning models inspired by open quantum systems, in which the interaction between a target qubit and an environment is described by a Hamiltonian. Previous works introduced alternative Hamiltonian parameterizations and showed empirically that they can improve classification performance, but the role of these parameters in the resulting classifier remains poorly understood. In this work, we derive a closed-form expression for the reduced quantum channel generated by a parametrized IQC with a single target qubit. The analytical solution explicitly reveals how the Hamiltonian parameters control the constant, sine, and cosine components of the classifier output, establishing a Fourier interpretation of the induced feature map. This analysis motivates a generalized family of Hamiltonian encodings, including matrix-parameterized environmental Hamiltonians whose Fourier components depend on linear combinations of input features, thereby enabling non-separable Fourier structures. Numerical experiments on synthetic and real-world datasets show that the proposed models can improve classification performance on several nonlinear benchmarks. The generalized matrix encoding achieves the strongest aggregate performance in the evaluated benchmark, while a simpler four-parameter extension often attains comparable performance with substantially fewer trainable parameters. We additionally characterize the generated state ensembles using the standard fidelity-based expressibility measure, finding that global expressibility does not directly predict classification performance. Our results provide an analytical characterization of parametrized Hamiltonians in Interactive Quantum Classifiers and establish Fourier analysis as a useful framework for understanding and designing open-system-inspired quantum learning models.
Interactive Quantum Classifiers (IQCs) encode classical inputs through a target–environment interaction and predict from the reduced target state. This paper asks how their Hamiltonian parameters determine the represented function class, focusing on a single target qubit and a diagonal environmental Hamiltonian.
For Ht=α0I+α⋅σH_t=\alpha_0 I+\boldsymbol\alpha\cdot\boldsymbol\sigmaHt​=α0​I+α⋅σ and He=diag⁡(Wx)H_e=\operatorname{diag}(W\boldsymbol x)He​=diag(Wx), the reduced dynamics is derived as a random-unitary channel. A Bloch-vector calculation gives the output f(x)=C+∑l[Alcos⁡(ωl⋅x)+Blsin⁡(ωl⋅x)]f(\boldsymbol x)=C+\sum_l[A_l\cos(\boldsymbol\omega_l\cdot\boldsymbol x)+B_l\sin(\boldsymbol\omega_l\cdot\boldsymbol x)]f(x)=C+∑l​[Al​cos(ωl​⋅x)+Bl​sin(ωl​⋅x)], with ωl=2κwl\boldsymbol\omega_l=2\kappa\boldsymbol w_lωl​=2κwl​. The environment dimension NeN_eNe​ bounds the number of indexed frequency components; their coefficients share constraints imposed by the target rotation axis, initialization, measurement, and environment probabilities. This motivates IQC-Multi, which replaces feature-wise encoding with trainable linear combinations and makes NeN_eNe​ independent of input dimension. The amplitude-encoded variant is separately characterized as a diagonal quadratic form in normalized inputs.
Classical simulations compare six variants on eleven datasets using ten train/test partitions and Adam or particle-swarm optimization. IQC-Multi with Ne=8N_e=8Ne​=8 obtains aggregate accuracy 0.8630.8630.863 versus 0.7950.7950.795 for the original IQC; on XOR, the Ne=4N_e=4Ne​=4 variant reaches 0.9960.9960.996 while feature-wise variants remain near chance. Rankings depend on the dataset, and many pairwise differences are not statistically significant.
Fidelity-distribution analyses find that global Haar-based expressibility does not directly predict classification performance. Stated limitations include shared Fourier coefficients and the mismatch between global-state expressibility and reduced-state predictions. Multiple target qubits, task-relevant expressibility measures, and scalable hardware implementations remain future directions.
Although the studies on quantum algorithms have been progressing, it is still necessary to broaden the investigation of open quantum systems. In this study, we present the use of an open quantum system to implement a quantum classifier algorithm. Zhang et al. propose a one QuBit system interacting with the environment through a unitary operator that comes from the Hamiltonian. In our proposal, the input data is loaded into the amplitude of the environment instead of being in the unitary operator. This change positively impacts the performance of different databases tested and causes a difference in the system entanglement behavior. For evaluation, the Zhang et al. model and the proposed model were tested in four real-world datasets and seven other toy problems. The results are evaluated according to accuracy and F1-Score. A deeper analysis of the Iris dataset is also done, checking the creation of entanglement and an extensive random search for better parameters on the proposed model. The results show that for most real-world dataset configurations, the proposed model, although having a simpler decision area, performed better than the one inspired by the Zhang et al. model, and that there is no pattern for the system entanglement in the Iris Dataset. Due to an underperform for both models in a linearly separable problem, an exponential kernel was introduced. It resulted in an improvement in the accuracy of both models in most of the evaluated situations.
As a generalized quantum machine learning model, parameterized quantum circuits (PQC) have been found to perform poorly in terms of classification accuracy and model scalability for multi-category classification tasks. To address this issue, we propose a scalable parameterized quantum circuits classifier (SPQCC), which performs per-channel PQC and combines the measurements as the output of the trainable parameters of the classifier. By minimizing the cross-entropy loss through optimizing the trainable parameters of PQC, SPQCC leads to a fast convergence of the classifier. The parallel execution of identical PQCs on different quantum machines with the same structure and scale reduces the complexity of classifier design. Classification simulations performed on the MNIST Dataset show that the accuracy of our proposed classifier far exceeds that of other quantum classification algorithms, achieving the state-of-the-art simulation result and surpassing/reaching classical classifiers with a considerable number of trainable parameters. Our classifier demonstrates excellent scalability and classification performance.
Quantum machine learning is often motivated by the idea that quantum systems can expose useful high-dimensional structure that is difficult to access with classical models. We isolate one central component of this claim: the fixed data-encoding map. Amplitude, angle, and basis encoding are evaluated as deterministic feature maps for classical supervised learning under matched output dimensionality and strong classical controls. The benchmark compares these encodings against raw linear models, random Fourier features, polynomial features, PCA, RBF SVMs, and shallow neural networks across diverse classical datasets. Rather than treating performance as a single endpoint, we analyze the geometry of each representation through effective rank, condition number, centered kernel alignment, predictive performance, and practical overhead. The resulting picture is mechanistic: amplitude encoding can remove magnitude information through unit-sphere normalization, angle encoding can become geometrically redundant with raw linear features, and basis encoding can impose a binary Hamming geometry that is poorly aligned with smooth decision structure. These findings do not argue against quantum computation, however, they show that fixed quantum-inspired encoding geometry alone is not a reliable source of machine-learning advantage on classical data.
This study investigates classification performance and trainability of variational quantum classifiers on near-term noisy quantum hardware across circuit depth and qubit count regimes within the context of quantum computing and machine learning, an area of growing scientific importance given its implications for hybrid quantum-classical algorithm design and practical NISQ hardware benchmarking for near-term quantum advantage assessment. Using gradient-based parameter optimization of parameterized quantum circuits with hardware noise modeling via density matrix simulation and physical execution on IBM Eagle processors, we examine expressibility of parameterized circuits enabling nonlinear decision boundaries in feature Hilbert space, with trainability constrained by barren plateau gradients at large qubit counts in 96 circuit architectures (4 qubit counts x 4 depths x 6 ansatz families) evaluated across 5 classification datasets with 20 random initialization seeds each drawn from IBM Quantum Eagle (127-qubit) and Falcon (27-qubit) processors with noise mitigation via zero-noise extrapolation. Results indicate that 10-qubit, 4-layer VQC achieves 84.2% classification accuracy on the best benchmark, within 3.8 percentage points of classical SVM, but gradient variance decays exponentially with qubit count (variance halving per 2 added qubits), confirming barren plateau scaling (p < 0.001), with 84.2% accuracy, 3.8 pp gap to classical SVM baseline as the primary quantitative benchmark. Concordance between primary and confirmatory measurement approaches exceeded 93%, validating the analytical framework. These findings contribute empirically to quantum computing and machine learning and carry actionable implications for the design of programs and policies targeting hybrid quantum-classical algorithm design and practical NISQ hardware benchmarking for near-term quantum advantage assessment.
Abstract Although the studies on quantum algorithms have been progressing, it is still necessary to broaden the investigation of open quantum systems. In this study, we present the use of an open quantum system to implement a quantum classifier algorithm. Zhang et al. propose a one QuBit system interacting with the environment through a unitary operator that comes from the Hamiltonian. In our proposal, the input data is loaded into the amplitude of the environment instead of being in the unitary operator. This change positively impacts the performance of different databases tested and causes a difference in the system entanglement behavior. For evaluation, both the Zhang et. al model and the proposed model were tested in four real-world datasets and seven other toy problems. The results are evaluated according to accuracy and F1-Score. A deeper analysis of the Iris dataset is also done, checking the creation of entanglement and an extensive random search for better parameters on the proposed model. The results show that for most real-world datasets configurations, the proposed model, although having a simpler decision area, performed better than the one inspired by the Zhang et. al model, and that there is no pattern for the system entanglement in the Iris Dataset.
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.