arXiv Machine Learning By Valeria Repetto, Stefano Melchionna, Romina D'Aurizio

Expressivity of IQP Feature-Map Quantum Kernels via Reproducing Kernel Hilbert Spaces

Read the original on arXiv Machine Learning →

The paper studies the expressivity of Instantaneous Quantum Polynomial (IQP) feature‑map quantum kernels by deriving a Fourier representation of their associated Reproducing Kernel Hilbert Space (RKHS). It identifies three bandwidth regimes—localized, multimodal, and periodic—each with distinct expressive properties, and demonstrates these regimes on synthetic datasets for classification and anomaly detection, comparing against a classical Gaussian kernel. The work provides a clear link between the kernel’s accessible frequencies, its bandwidth hyperparameter, and the structure of the data, offering guidance for bandwidth selection when data exhibit known periodic or multimodal patterns.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

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