Concentration-Free Quantum Kernel Learning in the Rydberg Blockade

Quantum kernel methods (QKMs) offer an appealing framework for machine learning on near-term quantum computers. However, QKMs generically suffer from exponential concentration, requiring an exponential number of measurements to resolve the kernel values, with the exception of trivial (i.e., classically simulable) kernels. Here we propose a QKM that is free of exponential concentration, yet remains hard to simulate classically. Our QKM utilizes the weak ergodicity-breaking many-body dynamics in the Rydberg blockade of coherently driven neutral atom arrays. We demonstrate the fundamental properties of our QKM by analytically solving an approximate toy model of its underpinning quantum dynamics, as well as by extensive numerical simulations on randomly generated datasets. We further show that the proposed kernel exhibits effective learning on real data. The proposed QKM can be implemented in current neutral atom quantum computers.

Publication Details

Journal
ArXiv.org
Published
2025-08-14
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Concentration-Free Quantum Kernel Learning in the Rydberg Blockade

ArXiv.org
Quantum Computing Algorithms and Architecture
article

Concentration-Free Quantum Kernel Learning in the Rydberg Blockade

article en

Abstract

Quantum kernel methods (QKMs) offer an appealing framework for machine learning on near-term quantum computers. However, QKMs generically suffer from exponential concentration, requiring an exponential number of measurements to resolve the kernel values, with the exception of trivial (i.e., classically simulable) kernels. Here we propose a QKM that is free of exponential concentration, yet remains hard to simulate classically. Our QKM utilizes the weak ergodicity-breaking many-body dynamics in the Rydberg blockade of coherently driven neutral atom arrays. We demonstrate the fundamental properties of our QKM by analytically solving an approximate toy model of its underpinning quantum dynamics, as well as by extensive numerical simulations on randomly generated datasets. We further show that the proposed kernel exhibits effective learning on real data. The proposed QKM can be implemented in current neutral atom quantum computers.

ArXiv.org
Openalex Percentile: Top 73%
Quantum Computing Algorithms and Architecture
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.