arXiv:2608. 19497v1 Announce Type: new Abstract: We characterize the learning dynamics of a compact hybrid quantum forecasting model through comparison with a structurally aligned classical baseline.
arXiv:2508. 19437v2 Announce Type: replace-cross Abstract: The importance of analyzing nontrivial datasets when testing quantum machine learning (QML) models is becoming increasingly prominent in literature, yet a cohesive framework for understanding dataset characteristics remains elusive.
The paper compares classical and hybrid quantum machine learning models for a trigger-like binary classification task using CMS open data. Eight classical models (SVM, ANN, CNN, LSTM) and eight quantum counterparts are evaluated under identical preprocessing, data splits, and decision thresholds, with performance measured by accuracy, ROC‑AUC, F1‑score, precision, and recall. The best classical model is an artificial neural network (93.53 % accuracy, 0.9819 ROC‑AUC), while the best quantum model is a quantum convolutional network (90.89 % accuracy, 0.9731 ROC‑AUC), indicating that within an eight‑qubit budget the quantum models do not surpass the classical ones.
arXiv:2607. 24065v1 Announce Type: cross Abstract: In this study, we developed and evaluated four conditional energy-based forecasting architectures: a classical Gaussian-Bernoulli CRBM, a hybrid quantum-classical QCRBM, a full-register QQRBM, and a lag-feature QFeatureQRBM with complete derivations of their conditional distributions, Contrastive-Divergence gradients, and hybrid training, bridging the energy-based formulation and the implementation-level quantum computation.
arXiv:2607. 16358v1 Announce Type: cross Abstract: This paper presents a unified quantum-classical hybrid framework for multi-horizon time-series forecasting, introducing two model variants Quantum Reservoir Forecaster (QRC-F) and Variational Quantum Forecaster (VQF-F).
The paper evaluates hybrid quantum‑classical machine learning for predicting reduced‑order spatiotemporal brain deformation fields. Using Proper Orthogonal Decomposition to compress high‑dimensional displacement data, the authors compare static temporal‑to‑latent regression and autoregressive latent forecasting models. Classical neural networks outperform all quantum variants, though enhanced quantum circuits improve over minimal ones, indicating that classical architectures still hold a clear advantage in fidelity and stability for this task.
The paper introduces Neural Fourier Surrogates (NFS), a stochastic classical neural network that learns coefficients over a finite Fourier series support similar to quantum neural networks (QNNs). By testing on tabular benchmark datasets, NFS demonstrates competitive classification performance against established classical baselines and data‑reuploading QNNs. The authors also compare the learned Fourier spectra of QNNs and NFS on synthetic data, positioning NFS as a natural classical baseline for evaluating QNN performance.
arXiv:2607. 22516v1 Announce Type: cross Abstract: A central design principle in modern machine learning and artificial intelligence is to align a model's inductive bias with the structure of its input data.
arXiv:2606. 15213v1 Announce Type: cross Abstract: Time series forecasting largely benefits from combining the strengths of different models, especially using a scheme where a model corrects another model by capturing supplementary patterns from forecasting errors.
arXiv:2511.10831v3 Announce Type: replace Abstract: Quantum kernel methods are a promising branch of quantum machine learning, but their per- formance across data types and encoding choices remains i...
arXiv:2504. 05336v4 Announce Type: replace-cross Abstract: A recurring weakness in quantum machine learning (QML) is that reported ``quantum advantages'' are seldom tested against a \emph{capacity-matched} classical control, leaving it unclear whether a gain comes from the quantum substrate or from the architectural change that accompanies it.
arXiv:2606. 27821v1 Announce Type: cross Abstract: Traffic matrices (TMs) capture network-wide origin-destination demand and are central to traffic engineering, yet accurate whole-matrix forecasting remains challenging when prediction must be performed under the memory, update, and training-budget constraints of online network control.
The paper introduces QFWP-ANO, a quantum neural network architecture that uses a classical hypernetwork to program variational quantum circuit parameters and non‑local observables conditioned on each input. Unlike existing adaptive non‑local observable (ANO) methods that learn a single static observable, QFWP-ANO dynamically adapts to each input. Experiments on multivariate time‑series forecasting and reinforcement learning tasks show that QFWP-ANO outperforms traditional ANO‑based VQCs and other strong baselines, achieving the lowest mean‑squared error in most settings.