Skip to content
Preprint

The ZZ feature map induces a signless Laplacian metric: a closed-form classical surrogate for quantum kernel regression

Aug 2026 · 1 citation · 35 references
Physics

TL;DR

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.

View source

Similar papers

Preprint Sep 2026

Structured Quantum Kernels for Chaotic Forecasting

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
Preprint Aug 2026

Quantum Natural Gradient on Quotient Spaces

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...

Ze-Yu Chen · 2 citations · ⚡1
#artificial intelligence Preprint Aug 2026

Representation Learning with Quantum Signal Processing

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.

Jun-Qin Wang, Jun-Yu Liu · 0 citations
#machine learning Preprint Sep 2026

Fourier Analysis of Parametrized Interactive Quantum Classifiers

Interactive Quantum Classifiers (IQCs) constitute a family of quantum machine learning models inspired by open quantum systems, in which the interaction between a target qubit and an environment is described by a Hamiltonian. Previous works introduced alternative Hamiltonian parameterizations and showed empirically tha...

F. Novaes, Fernando M. de Paula, J. V. Cardoso · 0 citations
Open access Sep 2026

Exhaustive Entanglement-Topology Enumeration and Edge-Vertex-Level Attribution in Quantum Feature Map Design for Classification

Quantum kernel methods encode classical data into quantum states using specially designed feature-map circuits and then train a classical SVM on the resulting kernel matrix. Prior studies of entanglement structure typically compare only a few basic topologies, such as linear, circular, and full entanglement, leaving th...

Natanael Natanael, H. Sugiarto, Yozef Tjandra · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.