A Multiclass Quantum Aligned Centroid Kernel
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. We present McQuack, a trainable quantum kernel method for multiclass problems that achieves linear scaling in the number of training samples. This is accomplished by replacing the full training-set Gram matrix with a trainable sample-to-(class-centroid) fidelity matrix. We evaluate the model in simulation and on 124 qubits of two IBM devices, across more than 150 datasets. In simulation, McQuack outperforms existing "pure" quantum baselines, while results from hardware inference -- obtained without training -- achieve performance similar to an RBF kernel. Finally, we study the trainability of the model and observe no evidence of barren plateaus in our experiments with up to 13 qubits, and highlight the importance of parameter initialization for successful optimization.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
QUACK: Quantum Aligned Centroid Kernel
Quantum computing (QC) seems to show potential for application in machine learning (ML). In particular quantum kernel methods (QKM) exhibit promising properties for use in supervised ML tasks. However, a major disadvanta…
Dimensionality ReductionApplication of quantum machine learning using quantum kernel algorithms on multiclass neuron M type classification
The functional characterization of different neuronal types has been a longstanding and crucial challenge. With the advent of physical quantum computers, it has become possible to apply quantum machine learning algorithm…
Binary ClassificationFeature EngineeringQuantum Machine LearningHAQJSK: Hierarchical-Aligned Quantum Jensen-Shannon Kernels for Graph Classification
In this work, we propose a family of novel quantum kernels, namely the Hierarchical Aligned Quantum Jensen-Shannon Kernels (HAQJSK), for un-attributed graphs. Different from most existing classical graph kernels, the pro…
Graph ClassificationAERK: Aligned Entropic Reproducing Kernels through Continuous-time Quantum Walks
In this work, we develop an Aligned Entropic Reproducing Kernel (AERK) for graph classification. We commence by performing the Continuous-time Quantum Walk (CTQW) on each graph structure, and computing the Averaged Mixin…
Graph ClassificationNumerical evidence against advantage with quantum fidelity kernels on classical data
Quantum machine learning techniques are commonly considered one of the most promising candidates for demonstrating practical quantum advantage. In particular, quantum kernel methods have been demonstrated to be able to l…
Inductive BiasQuantum Machine Learning