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.
arXiv:2510. 03389v2 Announce Type: replace-cross Abstract: Current quantum computers require algorithms that use limited resources economically.
The paper investigates the role of quantum computing in network‑security classification through two experiments. First, it evaluates near‑term quantum‑kernel support vector machines on datasets such as KDD Cup 1999, CICIDS2017, and BoT‑IoT, finding that quantum kernels can match or sometimes improve classical baselines, though classical RBF kernels often remain stronger. Second, it explores long‑term memory efficiency using quantum oracle sketching (QOS), showing that quantum methods can achieve comparable accuracy with a smaller effective memory footprint than explicit storage, suggesting a potential advantage in memory‑efficient data access for streaming classification tasks.
arXiv:2603. 09789v3 Announce Type: replace-cross Abstract: Accurate financial volatility forecasting is crucial but challenged by the non-linear, highly correlated nature of market data.
arXiv:2308. 11290v2 Announce Type: replace-cross Abstract: Understanding the dynamics of large quantum systems is hindered by the curse of dimensionality.
arXiv:2607. 01197v1 Announce Type: new Abstract: Quantum computing has emerged as a promising computational paradigm for machine learning (ML), with the potential to offer computational advantages over classical approaches.
arXiv:2606. 01291v1 Announce Type: cross Abstract: Training Variational Quantum Circuits (VQCs) under Noisy Intermediate-Scale Quantum (NISQ) constraints introduces severe computational limitations: classical statevector simulation memory scales exponentially ($\mathcal{O}(2^n)$), and global cost functions suffer from barren plateaus where gradient variance decays exponentially ($\mathcal{O}(1/2^n)$).
arXiv:2604. 06135v2 Announce Type: replace-cross Abstract: Efficient data loading remains a bottleneck for near-term quantum machine learning.
arXiv:2609.23476v1 Announce Type: cross Abstract: A potential path forward is Quantum Machine Learning (QML), which aims to leverage quantum computing in conjunction with classical machine learning t...
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.
Circuit cutting lets a large quantum neural network (QNN) run as independent subcircuits on small devices, but rebuilding its outputs by reconstruction carries a classical sampling overhead exponential in the number of cuts - the dominant runtime cost in prior work. We ask whether, for machine-learning tasks, this step is necessary, and replace it with late fusion: each subcircuit is trained and measured independently, and a small classical head combines their outputs - a linear-cost, decision-level combination borrowed from multimodal learning.
arXiv:2602. 06699v2 Announce Type: replace-cross Abstract: We propose a variational quantum implementation of self-attention (QSA)-the core operation in transformers and large language models-which predicts future elements of a sequence by forming overlap-weighted combinations of past data.