McQuack is presented, a trainable quantum kernel method for multiclass problems that achieves linear scaling in the number of training samples and study the trainability of the model and observe no evidence of barren plateaus in experiments with up to 13 qubits.
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. 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.
These results demonstrate a scalable, reproducible workflow for quantum kernel experimentation at HEP-relevant scale, quantifying the practical cost of realistic hardware noise on quantum-enhanced classification.
The results show that the factorization underlying a quantum block encoding can itself provide sufficient classical structure even when sampling-and-query access to the composite matrix is unavailable, suggesting a classical sampler with prescribed accuracy and polynomially related runtime.
Natsuto Isogai, M. Murao, Hayata Yamasaki· 0 citations
This work develops a hardware-compatible QCNN with mid-circuit measurement and classical feed-forward, and shows on a binary handwritten-digit task that strong test performance is achievable from as few as 10 training samples, with the generalization error decreasing as the training set grows.
Leena Anthony, Artemiy Burov, N. Piro et al.· 0 citations
Reliable attribution of artificial intelligence (AI)-generated text to a specific large language model (LLM) matters increasingly as LLMs proliferate, yet where quantum machine learning actually stands on this task has, to our knowledge, never been measured systematically. We benchmark the quantum support vector machin...
Kalin Kopanov, Tatiana V. Atanasova· Information· 0 citations
The results indicate the viability of direct multi-class classification using sequential nonlinear feature encoding and parameterized quantum processing in the studied statevector setting, without asserting the existence of any general quantum computational advantage.
Prabha Bhumika Avasarala S. V. S. S, Krishna Mohan A.· International Journal of Inn...· 0 citations
We introduce Quantum-KIP, a method that compresses a training set into a small set of kernel inducing points with soft labels. It uses a quantum feature map to compute state-fidelity overlaps and relies only on forward evaluations, avoiding backpropagation through quantum circuits. We provide a compression-induced stab...
Baobao Song, Shiva Raj Pokhrel, Athanasios V. Vasilakos et al.· IEEE Transactions on Informa...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.