aiqbench analysis
This research addresses the critical issue of exponential concentration in fidelity-based quantum kernels, where increasing system size causes Gram matrices to degenerate into identity-like structures that lose discriminative power. By implementing local patch-wise and multi-scale aggregation strategies within Qiskit, the study demonstrates a consistent recovery of spectral richness and informative similarity across various tabular datasets. These findings offer practical pathways for stabilizing kernel methods as quantum feature maps scale up in dimensionality and expressivity.
Local and Multi-Scale Strategies to Mitigate Exponential Concentration in Quantum Kernels
arXiv:2602.16097v2 Announce Type: replace Abstract: Fidelity-based quantum kernels provide a direct interface between quantum feature maps and classical kernel methods, but they can exhibit exponential concentration: with increasing system size or circuit expressivity, the Gram matrix approaches the identity and suppresses informative similarity structure. We present an empirical study of two mitigation strategies implemented in Qiskit: (i) local (patch-wise) kernels that aggregate subsystem similarities, and (ii) multi-scale kernels that mix local and global similarity across patch granularities. We benchmark baseline, local, and multi-scale kernels under matched preprocessing, splits, and SVM protocols on several tabular datasets, sweeping the feature dimension $d\in\{4,6,\dots,20\}$. We report concentration diagnostics based on off-diagonal kernel statistics, spectral richness via effective rank, and centered alignment with labels. Across datasets, local and multi-scale constructions consistently mitigate concentration and yield richer kernel spectra relative to the global fidelity baseline, while the impact on classification accuracy depends on the dataset and dimension.
Abstract:Fidelity-based quantum kernels provide a direct interface between quantum feature maps and classical kernel methods, but they can exhibit exponential concentration: with increasing system size or circuit expressivity, the Gram matrix approaches the identity and suppresses informative similarity structure. We present an empirical study of two mitigation strategies implemented in Qiskit: (i) local (patch-wise) kernels that aggregate subsystem similarities, and (ii) multi-scale kernels that mix local and global similarity across patch granularities. We benchmark baseline, local, and multi-scale kernels under matched preprocessing, splits, and SVM protocols on several tabular datasets, sweeping the feature dimension $d\in\{4,6,\dots,20\}$. We report concentration diagnostics based on off-diagonal kernel statistics, spectral richness via effective rank, and centered alignment with labels. Across datasets, local and multi-scale constructions consistently mitigate concentration and yield richer kernel spectra relative to the global fidelity baseline, while the impact on classification accuracy depends on the dataset and dimension.
18 pages, 10 figures. Revised theoretical presentation and proofs; clarified notation, experimental protocol, and figure captions; updated references. Experimental results and main conclusions unchanged
arXiv:2602.16097 [quant-ph]
(or arXiv:2602.16097v2 [quant-ph] for this version)
Full text under the publisher's open licence · 178 words
Related coverage

News
Quantum Computing Report · Jul 25, 2026

WiMi Develops Variational Quantum Algorithm - Driven Multi-Dimensional Data Pooling Optimization Technology
chinatechnews.com · Sep 8, 2026

[AINews] Reality Checks on AI News (Yegge shuts down Gas Town, Databricks’ +60% Astra cost)
Latent Space · Sep 17, 2026

Lattice-Based Cryptography Explained
Quantum Zeitgeist · Aug 15, 2026