Non-variational supervised quantum kernel methods: a review

2026-04-09Machine Learning

Machine Learning
AI summary

The authors review quantum kernel methods (QKMs), a way to do supervised learning using quantum computers without adjusting the quantum circuits during training. Unlike some other quantum algorithms that need tricky optimization, QKMs use fixed quantum feature maps and classical optimization techniques, making the learning process more stable. They discuss how QKMs relate to classical kernel methods, how the quantum kernels are built and estimated, and what challenges must be tackled to potentially outperform classical models. The authors also explore conditions for quantum advantage and practical issues like noise and computational limits. Overall, they provide a clear overview of when and how QKMs might be useful for machine learning tasks.

quantum kernel methodssupervised learningquantum feature mapsclassical kernel theoryconvex optimisationquantum advantageHilbert spacegeneralisation boundsdequantisationtensor-network methods
Authors
John Tanner, Chon-Fai Kam, Jingbo Wang
Abstract
Quantum kernel methods (QKMs) have emerged as a prominent framework for supervised quantum machine learning. Unlike variational quantum algorithms, which rely on gradient-based optimisation and may suffer from issues such as barren plateaus, non-variational QKMs employ fixed quantum feature maps, with model selection performed classically via convex optimisation and cross-validation. This separation of quantum feature embedding from classical training ensures stable optimisation while leveraging quantum circuits to encode data in high-dimensional Hilbert spaces. In this review, we provide a thorough analysis of non-variational supervised QKMs, covering their foundations in classical kernel theory, constructions of fidelity and projected quantum kernels, and methods for their estimation in practice. We examine frameworks for assessing quantum advantage, including generalisation bounds and necessary conditions for separation from classical models, and analyse key challenges such as exponential concentration, dequantisation via tensor-network methods, and the spectral properties of kernel integral operators. We further discuss structured problem classes that may enable advantage, and synthesise insights from comparative and hardware studies. Overall, this review aims to clarify the regimes in which QKMs may offer genuine advantages, and to delineate the conceptual, methodological, and technical obstacles that must be overcome for practical quantum-enhanced learning.