Non-variational supervised quantum kernel methods: a review
John Tanner, Chon-Fai Kam, Jingbo Wang

TL;DR
This review analyzes non-variational supervised quantum kernel methods, highlighting their foundations, practical estimation techniques, potential advantages, and challenges for quantum machine learning.
Contribution
It provides a comprehensive overview of non-variational quantum kernel methods, including theoretical foundations, practical estimation, and analysis of quantum advantage prospects.
Findings
Non-variational QKMs use fixed quantum feature maps with classical model selection.
Frameworks for assessing quantum advantage include generalisation bounds and separation conditions.
Challenges include exponential concentration, dequantisation, and spectral property analysis.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
