It is proved that in the small-bandwidth regime the induced kernel is, to leading order, an anisotropic Gaussian kernel with metric M = I + pi^2 Q, where Q is the signless Laplacian of the entanglement graph, and that the quadratic structure persists at every circuit depth as a pullback of the Fubini-Study metric.
Abstract
Bandwidth-tuned quantum kernels have been shown to lose their advantage over classical kernels and to resemble radial basis function kernels, but the analytical support for that observation rests on separable encoding circuits and captures entangling circuits only qualitatively. We close this gap for the ZZ feature map. We prove that in the small-bandwidth regime the induced kernel has, to leading order, the anisotropic Mahalanobis geometry defined by M = I + pi^2 Q, where Q is the signless Laplacian of the entanglement graph, and that it admits a parameter-free Gaussian surrogate matching it through second order. The quadratic structure persists at any fixed depth as a pullback of the Fubini-Study metric. The anisotropy depends entirely on a phase convention: under the unshifted convention the metric is the identity irrespective of entanglement, which accounts analytically for the isotropic resemblance previously reported. The derivation is verified against direct simulation for path, cycle and complete graphs, with relative error below 10^-3. The corresponding classical kernel requires no fitted parameters and no quantum simulation. Compared with the quantum kernel on two near-infrared spectroscopic benchmarks, across four targets, five preprocessing pipelines and 100 resampled splits per cell, the paired 95% bootstrap interval contains zero in 18 of 20 cells, the typical relative difference in test error is 2.7%, and the two families select the same preprocessing pipeline in 96% of splits. The regime in which the reduction fails adds no robust predictive value: restricting the grid to the classical regime improves mean test error by 3.8%, a gain that an equally large random restriction does not reproduce.
A quantum kernel fusing amplitude encoding of l2-normalized delay windows with a grouped single-qubit rotation layer that assigns contiguous temporal blocks to each qubit, making the circuit delay-window-aware and the first mechanistic localisation of quantum-kernel advantage to a specific dynamical regime of a classic...
Zhi-Hui Wang, Sujit Roy, Ata Akbari et al.· 0 citations
A parametrized quantum circuit reports its state geometry through a quantum Fisher information matrix (QFIM), often singular. A small Fisher value can reflect exact state-preserving redundancy, compression by the circuit chart, or weak intrinsic distinguishability, and these mechanisms call for different numerical trea...
This work establishes quantum signal processing (QSP) as a solvable quantum model of the representation-learning regime, and proves a sparse-data guarantee for the full nonlinear gradient flow without freezing or ensemble-averaging the kernel.
This work derives a closed-form expression for the reduced quantum channel generated by a parametrized IQC with a single target qubit, and establishes Fourier analysis as a useful framework for understanding and designing open-system-inspired quantum learning models.
F. Novaes, Fernando M. de Paula, J. V. Cardoso· 0 citations
The results indicate that the effect of entanglement depends jointly on the feature-map architecture, dataset, and specific qubit connections rather than on entanglement density alone.
Natanael Natanael, H. Sugiarto, Yozef Tjandra· Journal of Computing Theorie...· 0 citations
An end-to-end expected learning guarantee is proved where the approximation term is determined by the omitted Fourier mass, while a normalized unbiased estimator yields an explicit statistical bound for empirical truncations.
Taha Hoseinpour Asli, Sajjad Hashemian, Ebrahim Ardeshir-Larijani· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.