Phase-space negativity as a computational resource for quantum kernel methods

Quantum kernel methods are a proposal for achieving quantum computational advantage in machine learning. They are based on a hybrid classical-quantum computation where a function called the quantum kernel is estimated by a quantum device while the rest of computation is performed classically. Quantum advantages may be achieved through this method only if the quantum kernel function cannot be estimated efficiently on a classical computer. In this paper, we provide sufficient conditions for the efficient classical estimation of quantum kernel functions for bosonic systems. These conditions are based on phase-space properties of data-encoding quantum states associated with the quantum kernels: negative volume, non-classical depth, and excess range, which are shown to be three signatures of phase-space negativity. We consider quantum optical examples involving linear-optical networks with and without adaptive non-Gaussian measurements, and investigate the effects of loss on the efficiency of the classical simulation. Our results underpin the role of the negativity in phase-space quasi-probability distributions as an essential resource in quantum machine learning based on kernel methods.

Authors

Institutions

Publication Details

Journal
Quantum
Published
2024-11-07
DOI
https://doi.org/10.22331/q-2024-11-07-1519
Citations
6
Primary Topic
Quantum Information and Cryptography
Type
article
Field-Weighted Citation Impact
2.08

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Phase-space negativity as a computational resource for quantum kernel methods

Salman Beigi, Roohollah Ghobadi, Ulysse Chabaud, Saleh Rahimi-Keshari
6 citations
Quantum
Quantum Information and Cryptography
2.08
article

Phase-space negativity as a computational resource for quantum kernel methods

Salman Beigi, Roohollah Ghobadi, Ulysse Chabaud, Saleh Rahimi-Keshari
article en
6 citations

Abstract

Quantum kernel methods are a proposal for achieving quantum computational advantage in machine learning. They are based on a hybrid classical-quantum computation where a function called the quantum kernel is estimated by a quantum device while the rest of computation is performed classically. Quantum advantages may be achieved through this method only if the quantum kernel function cannot be estimated efficiently on a classical computer. In this paper, we provide sufficient conditions for the efficient classical estimation of quantum kernel functions for bosonic systems. These conditions are based on phase-space properties of data-encoding quantum states associated with the quantum kernels: negative volume, non-classical depth, and excess range, which are shown to be three signatures of phase-space negativity. We consider quantum optical examples involving linear-optical networks with and without adaptive non-Gaussian measurements, and investigate the effects of loss on the efficiency of the classical simulation. Our results underpin the role of the negativity in phase-space quasi-probability distributions as an essential resource in quantum machine learning based on kernel methods.

QuantumVol. 8
Centre National de la Recherche Scientifique (FR), Institut national de recherche en sciences et technologies du numérique (FR), University of Calgary (CA), Université Paris Sciences et Lettres (FR), École Normale Supérieure - PSL (FR), Institute for Research in Fundamental Sciences (IR)
European Commission, HORIZON EUROPE Framework Programme, HORIZON EUROPE European Innovation Council
Openalex Percentile: Top 11%
Quantum Information and Cryptography
2.08
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.