Benign Overfitting with Quantum Kernels
Not on the map. Why?
Abstract (arXiv)
Kernel methods compare inputs through feature maps. Quantum kernels follow the same principle: input data are encoded into quantum states, which define quantum feature representations in Hilbert spaces. Kernel values are then obtained by estimating inner products between these states using suitable quantum circuit measurements. As a result, quantum kernels may be intractable to compute classically while remaining efficiently computable on quantum hardware, potentially leading to a quantum advantage. However, designing effective quantum kernels remains a major challenge. Many quantum kernels, such as the fidelity kernel, suffer from exponential concentration. This results in near-identity kernel matrices that fail to capture meaningful data correlations and lead to overfitting and poor generalization. In this paper, we propose a novel strategy for constructing quantum kernels that achieve good generalization performance, drawing inspiration from benign overfitting in classical machine learning. We introduce the concept of Local-Global quantum kernels, which combine two components: a local quantum kernel based on measurements of small subsystems, and a global quantum kernel derived from full-system measurements. To support the effectiveness of the proposed construction, we show theoretically and empirically that Local-Global quantum kernels exhibit benign overfitting.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 31 of its 50 references that are in the map. First posted on arXiv 21 Mar 2025.
Builds on
31 of 50 references.
References · 31
- 2018Supervised learning with quantum enhanced feature spacescited by 665
- 2019Benign Overfitting in Linear Regressioncited by 549
- 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 513
- 2020Power of data in quantum machine learningcited by 338
- 2019Parameterized quantum circuits as machine learning modelscited by 332
- 2020A rigorous and robust quantum speed-up in supervised machine learningcited by 271
- 2021Deep learning: a statistical viewpointcited by 240
- 2023Challenges and Opportunities in Quantum Machine Learningcited by 203
- 2021Supervised quantum machine learning models are kernel methodscited by 200
- 2018Just Interpolate: Kernel "Ridgeless" Regression Can Generalizecited by 190
- 2020Benign overfitting in ridge regressioncited by 153
- 2019Harmless interpolation of noisy data in regressioncited by 121
19 more
- 2021Theory of overparametrization in quantum neural networkscited by 100
- 2017Quantum machine learning: a classical perspectivecited by 95
- 2018Does data interpolation contradict statistical optimality?cited by 95
- 2021Quantum machine learning beyond kernel methodscited by 92
- 2021The Inductive Bias of Quantum Kernelscited by 91
- 2022Exponential concentration in quantum kernel methodscited by 90
- 2021Training Quantum Embedding Kernels on Near-Term Quantum Computerscited by 69
- 2023Understanding quantum machine learning also requires rethinking generalizationcited by 49
- 2022Bandwidth Enables Generalization in Quantum Kernel Modelscited by 32
- 2021Importance of Kernel Bandwidth in Quantum Machine Learningcited by 31
- 2023Generalization in Kernel Regression Under Realistic Assumptionscited by 27
- 2023Mind the spikes: Benign overfitting of kernels and neural networks in fixed dimensioncited by 26
- 2020Benign Overfitting and Noisy Featurescited by 18
- 2023On the expressivity of embedding quantum kernelscited by 17
- 2022On the Inconsistency of Kernel Ridgeless Regression in Fixed Dimensionscited by 13
- 2024Characterizing Overfitting in Kernel Ridgeless Regression Through the Eigenspectrumcited by 13
- 2024The phase diagram of kernel interpolation in large dimensionscited by 9
- 2025Double descent in quantum kernel methodscited by 9
- 2024Overfitting Behaviour of Gaussian Kernel Ridgeless Regression: Varying Bandwidth or Dimensionalitycited by 7
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.