Mitigating exponential concentration in covariant quantum kernels for subspace and real-world data

Abstract Fidelity quantum kernels provide a provable advantage on classification problems where a group structure in the data can be exploited. However, in practical applications, the group structure may be unknown or approximate, and scaling to the ‘utility’ regime is affected by exponential concentration. We prove that an ideal behavior of fidelity kernels is always associated with a (possibly unknown) group structure in the feature map. We also propose a mitigation strategy for fidelity kernels, called Bit Flip Tolerance (BFT), to alleviate exponential concentration. Applied to real-world data with unknown structure, related to the charge schedule of electric vehicles, BFT proves useful on 40 + qubits, where mitigated accuracies reach 80%, in line with classical, compared to 33% without BFT. Through a synthetic dataset with 156 qubits, we obtain an accuracy of 80%, compared to 83% of classical models, and 37% of unmitigated quantum. This constitutes the largest experiment of quantum machine learning on IBM devices to date.

Authors

Institutions

Publication Details

Journal
npj Quantum Information
Published
2025-12-13
DOI
https://doi.org/10.1038/s41534-025-01154-2
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

Mitigating exponential concentration in covariant quantum kernels for subspace and real-world data

Gabriele Agliardi, Víctor Valls, Kavitha Yogaraj, Anton Dekusar et al.
npj Quantum Information
Quantum Computing Algorithms and Architecture
article

Mitigating exponential concentration in covariant quantum kernels for subspace and real-world data

Gabriele Agliardi, Víctor Valls, Kavitha Yogaraj, Anton Dekusar, Sergiy M. Zhuk, Corey O’Meara, Kumar Ghosh, Naeimeh Mohseni, G. Cortiana
article en

Abstract

Abstract Fidelity quantum kernels provide a provable advantage on classification problems where a group structure in the data can be exploited. However, in practical applications, the group structure may be unknown or approximate, and scaling to the ‘utility’ regime is affected by exponential concentration. We prove that an ideal behavior of fidelity kernels is always associated with a (possibly unknown) group structure in the feature map. We also propose a mitigation strategy for fidelity kernels, called Bit Flip Tolerance (BFT), to alleviate exponential concentration. Applied to real-world data with unknown structure, related to the charge schedule of electric vehicles, BFT proves useful on 40 + qubits, where mitigated accuracies reach 80%, in line with classical, compared to 33% without BFT. Through a synthetic dataset with 156 qubits, we obtain an accuracy of 80%, compared to 83% of classical models, and 37% of unmitigated quantum. This constitutes the largest experiment of quantum machine learning on IBM devices to date.

npj Quantum InformationVol. 12(1)
TÜV Nord (Germany) (DE), IBM Research - India (IN), IBM (Italy) (IT), IBM (India) (IN), IBM Research - Ireland (IE)
Openalex Percentile: Top 79%
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.

Mitigating exponential concentration in covariant quantum kernels for subspace and real-world data — Gabriele Agliardi, Víctor Valls, et al. · npj Quantum Information (2025) | TGRS Research Map | TGRS