arrow
Return

Exponential concentration in quantum kernel methods

delete2024-06-18
delete7
delete
OA
AI
S
Supanut Thanasilp *
S
Samson Wang
M
M. Cerezo
Z
Zoë Holmes *
DOI:10.1038/s41467-024-49287-wdelete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Kernel methods in Quantum Machine Learning (QML) have recently gained significant attention as a potential candidate for achieving a quantum advantage in data analysis. Among other attractive properties, when training a kernel-based model one is guaranteed to find the optimal model's parameters due to the convexity of the training landscape. However, this is based on the assumption that the quantum kernel can be efficiently obtained from quantum hardware. In this work we study the performance of quantum kernel models from the perspective of the resources needed to accurately estimate kernel values. We show that, under certain conditions, values of quantum kernels over different input data can be exponentially concentrated (in the number of qubits) towards some fixed value. Thus on training with a polynomial number of measurements, one ends up with a trivial model where the predictions on unseen inputs are independent of the input data. We identify four sources that can lead to concentration including expressivity of data embedding, global measurements, entanglement and noise. For each source, an associated concentration bound of quantum kernels is analytically derived. Lastly, we show that when dealing with classical data, training a parametrized data embedding with a kernel alignment method is also susceptible to exponential concentration. Our results are verified through numerical simulations for several QML tasks. Altogether, we provide guidelines indicating that certain features should be avoided to ensure the efficient evaluation of quantum kernels and so the performance of quantum kernel methods. Quantum kernel methods are usually believed to enjoy better trainability than quantum neural networks which may suffer from a well-studied barren plateau. Here, building over previous evidence, the authors show that practical implications of exponential concentration result in a trivial data-insensitive model after training, and identify commonly used features that induce the concentration.
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Nature Communications cover
Nature Communications
IF:
15.7
Papers:
9.4W
Citations:
91.2W

Organization

C
Chulalongkorn University
Scholars:
1.8W
Papers: 1.4W
Citations: 1.5W
S
swiss federal institutes of technology domain
Scholars:
9.0W
Papers: 8.0W
Citations: 163
I
Imperial College London
Scholars:
8.3W
Papers: 7.3W
Citations: 11.1W
N
National University of Singapore
Scholars:
7.6W
Papers: 6.5W
Citations: 11.4W
researcher View more organizations
Cited Papers

Cited Papers

The Aitape 1998 Tsunami: Reconstructing the Event from Interviews and Field Mapping
err2003-10-01
err0
PREAI
errH. L. Davies; J. M. Davies; R. C. B. Perembo; W. Y. Lus
errShare
errSave
Noise-induced barren plateaus in variational quantum algorithms
err2021-11-29
err201
errOAAI
errWang, Samson; Fontana, Enrico; Cerezo, M.; Sharma, Kunal; Sone, Akira; Cincio, Lukasz; Coles, Patrick J.
errShare
errSave
Barren plateaus in quantum neural network training landscapes
err2018-11-16
err1.1K
errOAAI
errMcClean, Jarrod R.; Boixo, Sergio; Smelyanskiy, Vadim N.; Babbush, Ryan; Neven, Hartmut
errShare
errSave
Pseudo-dimension of quantum circuits
err2020-11-06
err28
errOAAI
errCaro, Matthias C.; Datta, Ishaun
errShare
errSave
Expressibility and trainability of parametrized analog quantum systems for machine learning applications
err2020-12-14
err24
errOAAI
errTangpanitanon, Jirawat; Thanasilp, Supanut; Dangniam, Ninnat; Lemonde, Marc-Antoine; Angelakis, Dimitris G.
errShare
errSave
researcher View more