arXiv Machine Learning

Enhancing Quantum Machine Learning with Anyons

arXiv:2606. 16090v1 Announce Type: cross Abstract: The power of quantum computing and quantum machine learning relies on harnessing uniquely quantum phenomena as computational resources.

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
Jul 14

Learning Topological Quantum Phases from Limited Subsystems

arXiv:2607. 10656v1 Announce Type: cross Abstract: Characterizing quantum topological phases requires measuring non-local string order parameters, demanding access to the full system, which is often experimentally unfeasible.

By Mehran Khosrojerdi, Sougato Bose, Alessandro Cuccoli, Paola Verrucchi, Abolfazl Bayat, Leonardo Banchi
arXiv Machine Learning
Jul 23

A Multiclass Quantum Aligned Centroid Kernel

arXiv:2607. 19782v1 Announce Type: cross Abstract: Kernel methods are powerful tools in machine learning but commonly used full-Gram kernels face three key limitations: (1) quadratic scaling with training set size; (2) the use of fixed, non-trainable kernels; and (3) the absence of an intrinsic formulation for multiclass classification.

By Kilian Tscharke, Pascal Debus
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