arXiv:2503. 17020v2 Announce Type: replace-cross Abstract: Kernel methods compare inputs through feature maps.
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 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.
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.
arXiv:2412. 09557v3 Announce Type: replace-cross Abstract: Quantum kernel learning (QKL) promises efficient machine learning by encoding feature maps onto exponentially large Hilbert spaces inherent in quantum systems.
arXiv:2604. 26675v2 Announce Type: replace-cross Abstract: We investigate variational quantum classifiers (VQCs) for land-cover classification from multispectral satellite imagery, adopting a feature-map perspective in which the quantum circuit defines a nonlinear data embedding while the readout determines how this representation is exploited.
arXiv:2607. 01080v1 Announce Type: new Abstract: We investigate Gaussian process (GP) bandit optimization with quantum kernels, assuming the mean reward function lies in the reproducing kernel Hilbert space (RKHS) induced by the quantum kernel.
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:2608.24631v1 Announce Type: cross Abstract: Similarity in many decision systems is governed not by distance alone but by interactions among variables. In fraud and anomaly detection, small loca...
arXiv:2608. 19306v1 Announce Type: cross Abstract: Given a set of input states, we consider the task of predicting the expectation value of a Pauli observable at the output of an unknown quantum evolution, using only a limited number of measurements.
arXiv:2607. 05000v1 Announce Type: cross Abstract: Canonical quantization provides a systematic procedure for constructing quantum models from classical Hamiltonians.
arXiv:2607. 11701v1 Announce Type: cross Abstract: Quantitative Structure-Activity Relationship ($\mathtt{QSAR}$) modeling is a foundational computational methodology in early-stage drug discovery, heavily relied upon for predicting compound toxicity, bioavailability, and therapeutic potential.