Hugging Face Trending Papers

Quantum Versus Classical Machine Learning for Neuropsychiatric Disorders: A Feature-Matched Multi-Cohort Evaluation

arXiv AI
Oct 16

Quantum Versus Classical Machine Learning for Neuropsychiatric Disorders: A Feature-Matched Multi-Cohort Evaluation

The study compared six families of quantum machine learning models with classical counterparts using identical correlation-derived features across four large neuroimaging cohorts. Across all cohorts, quantum kernels performed statistically indistinguishable from matched classical kernels, with average accuracy differences within 1.4 percentage points. While a hybrid quantum convolutional network matched classical accuracy and a trainable quantum kernel slightly improved AUC on ABIDE I, overall quantum models did not consistently outperform classical ones, providing a feature‑matched benchmark of 284 comparisons.

By Utsav Poudel, Anuj Nepal, Vyas Viswanath, Subramaniyaswamy Vairavasundaram
arXiv Machine Learning
Jun 15

Hybrid Classical-Quantum (HCQ) Alzheimer's Classification via Supervised $\beta$-VAE and Quantum Kernels

arXiv:2606. 14194v1 Announce Type: cross Abstract: This paper presents a two-stage Hybrid Classical-Quantum (HCQ) pipeline for binary Alzheimer's disease (AD) classification from 3D T1-weighted structural MRI volumes, where the classical and quantum components are designed to complement each other rather than operate independently.

By Tia Tiwari, Vamshi Krishna Kancharla, Neelam Sinha
arXiv Machine Learning
Jul 13

Is data-efficient learning feasible with quantum models?

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.

By Alona Sakhnenko, Christian B. Mendl, Jeanette M. Lorenz
arXiv Machine Learning
Aug 28

Classical and Hybrid Quantum Machine Learning for Trigger-Like Event Selection on CMS Open Data: An Eight-Qubit, PCA-Constrained Benchmark

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.

By Tariq Mahmood, Muhammad Awais Rafique, Talab Hussain, Juan Pablo Perez Aguilar, Alfredo Raya, Muhammad Ahsan
arXiv Machine Learning
Oct 3

Neural Fourier Surrogates for Data Reuploading Quantum Neural Networks

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.

By Oliver Knitter, Jonathan Mei, Sang Hyub Kim, Chi Chen, Masako Yamada, Martin Roetteler
arXiv Machine Learning
Sep 14

Classical and quantum kernel fusion for two-sample testing

The paper introduces MMD-FUSE, a two-sample test that remains effective on small datasets by fusing classical and quantum kernels. By combining the inductive biases of classical kernels with the expressive power of quantum kernels, the hybrid approach achieves higher test power, especially for small, high‑dimensional data. Experiments on synthetic and real clinical datasets confirm that the method consistently outperforms purely classical counterparts and adapts robustly to varied data characteristics.

By Yu Terada, Yugo Ogio, Ken Arai, Hiroyuki Tezuka, Yu Tanaka