Quantum machine learning models are kernel methods
By Maria Schuld. 2021
525 citations recorded by the source corpus.
With near-term quantum devices available and the race for fault-tolerant quantum computers in full swing, researchers became interested in the question of what happens if we replace a machine learning model with a quantum circuit. While such"quantum models"are sometimes called"quantum neural networks", it has been repeatedly noted that their mathematical structure is actually much more closely related to kernel methods: they analyse data in high-dimensional Hilbert spaces to which we only have access through inner products revealed by measurements. This technical manuscript summarises, formalises and extends the link by systematically rephrasing quantum models as a kernel method. It shows that most near-term and fault-tolerant quantum models can be replaced by a general support vector machine whose kernel computes distances between data-encoding quantum states. In particular, kernel-based training is guaranteed to find better or equally good quantum models than variational circuit training. Overall, the kernel perspective of quantum machine learning tells us that the way that data is encoded into quantum states is the main ingredient that can potentially set quantum models apart from classical machine learning models.
Subfields: Artificial Intelligence
View Paper: https://www.semanticscholar.org/paper/cf5dfc4a9f7a82b32640128ca10832eace55880e
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- M. Cerezo
- Patrick J. Coles
- Lukasz Cincio
- Hsin-Yuan Huang
- Guillaume Verdon
- Martín Larocca
- Piotr Czarnik
- Jarrod R. McClean
Citations in the corpus
- Challenges and opportunities in quantum machine learning (2022, methodology): “As an alternative to QNNs, researchers have proposed quantum versions of kernel methods [26, 28].”
- Barren plateaus in variational quantum computing (2024, unknown): “Here, the larger the dimension of the algebra, the more expressive the circuit is, and controllable circuits are defined as those for which g su (2 = .”