Non-variational supervised quantum kernel methods: a review

• URL: http://arxiv.org/abs/2604.07896v1
• Date: Thu, 09 Apr 2026 07:11:24 GMT
• Title: Non-variational supervised quantum kernel methods: a review
• Abstract summary: Quantum kernel methods (QKMs) have emerged as a prominent framework for supervised quantum machine learning.<n>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.
• Score: 4.483208369550461
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Towards Surrogate Based Dequantization of Quantum Reinforcement Learning [0.1749935196721634]
  We build on recent kernel-based dequantization results for supervised learning to extend this surrogate-based dequantization program to reinforcement learning.<n>We provide finite sample guarantees for classical kernelized Fitted Q-Iteration, with classical kernels designed to match the inductive bias of particular parameterized quantum circuits.
  arXiv  Detail & Related papers  (2026-09-14T19:26:35Z)
• Learnable yet not simulable: a quantum resource theory of learning models [57.695822250391906]
  It remains unclear which quantum resource governs the classical learnability of quantum circuits.<n>We study the expectation-value functions of families of tunable quantum circuits.<n>These results establish a quantitative resource-theoretic framework for delineating the boundary between classical simulation and learning.
  arXiv  Detail & Related papers  (2026-08-03T14:48:03Z)
• Balancing Expressivity and Learnability in Quantum Kernel Bandit Optimization [50.880384999888044]
  We develop misspecified GP bandit algorithms and derive regret bounds that characterize the trade-off between approximation error and information gain.<n>Our methods outperform full quantum kernels in sample efficiency, while substantially reducing computational overhead.
  arXiv  Detail & Related papers  (2026-07-01T15:38:00Z)
• Trainable Quantum Channels as Computational Primitives for Quantum Learning [2.047424180164312]
  Variational quantum learning is traditionally constrained to unitary dynamics.<n>We establish a non-unitary quantum machine learning framework grounded in open-system dynamics.
  arXiv  Detail & Related papers  (2026-06-14T13:19:49Z)
• Quantum Optimization Algorithms for Strongly Correlated Many-Body Systems [0.0]
  This perspective article analyzes the potential and critical challenges of employing quantum optimization algorithms to investigate phase transitions in quantum many-body systems during the Noisy Intermediate-Scale Quantum era.
  arXiv  Detail & Related papers  (2026-06-02T04:42:30Z)
• Methods for non-variational heuristic quantum optimisation [0.5586191108738564]
  We introduce a novel class of quantum optimisations that forgo this variational framework in favour of a hybrid quantum-classical approach.<n>These algorithms are expected to exhibit inherent robustness to noise and support parallel execution across both quantum and classical resources.
  arXiv  Detail & Related papers  (2026-02-01T17:46:57Z)
• TensorHyper-VQC: A Tensor-Train-Guided Hypernetwork for Robust and Scalable Variational Quantum Computing [50.95799256262098]
  We introduceHyper-VQC, a novel tensor-train (TT)-guided hypernetwork framework for quantum machine learning.<n>Our framework delegates the generation of quantum circuit parameters to a classical TT network, effectively decoupling optimization from quantum hardware.<n>These results positionHyper-VQC as a scalable and noise-resilient framework for advancing practical quantum machine learning on near-term devices.
  arXiv  Detail & Related papers  (2025-08-01T23:37:55Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [50.95799256262098]
  Variational quantum circuits (VQCs) hold promise for quantum machine learning but face challenges in expressivity, trainability, and noise resilience.<n>We propose VQC-MLPNet, a hybrid architecture where a VQC generates the first-layer weights of a classical multilayer perceptron during training, while inference is performed entirely classically.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Unsupervised Quantum Anomaly Detection on Noisy Quantum Processors [1.2325897339438878]
  We provide a systematic analysis of the generalization properties of the One-Class Support Vector Machine (OCSVM) algorithm. Results were theoretically simulated and experimentally validated on trapped-ion and superconducting quantum processors.
  arXiv  Detail & Related papers  (2024-11-25T22:42:38Z)
• Variational Quantum Approximated Spectral Clustering [0.6718184400443239]
  We propose Variational Quantum Approximated Spectral Clustering (VQASC), which extends quantum distance-based classifier models to the clustering framework.<n>Our approach uses efficient quantum circuit designs whose depth scales sub-quadratically with dataset size, enabling the computation of weighted sums over various matrix representations of an undirected graph.
  arXiv  Detail & Related papers  (2023-09-08T17:54:42Z)
• The Quantum Path Kernel: a Generalized Quantum Neural Tangent Kernel for Deep Quantum Machine Learning [52.77024349608834]
  Building a quantum analog of classical deep neural networks represents a fundamental challenge in quantum computing. Key issue is how to address the inherent non-linearity of classical deep learning. We introduce the Quantum Path Kernel, a formulation of quantum machine learning capable of replicating those aspects of deep machine learning.
  arXiv  Detail & Related papers  (2022-12-22T16:06:24Z)
• Variational Quantum Kernels with Task-Specific Quantum Metric Learning [0.8722210937404288]
  Kernel methods rely on the notion of similarity between points in a higher (possibly infinite) dimensional feature space. We discuss the use of variational quantum kernels with task-specific quantum metric learning to generate optimal quantum embeddings.
  arXiv  Detail & Related papers  (2022-11-08T18:36:25Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.