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 classical system is introduced.
Abstract
Quantum kernels promise exponentially large feature spaces, but expressive circuits render their Gram matrices uninformative, bandwidth tuning collapses them toward classical RBF, and the practical consensus is that quantum kernels add nothing on classical data. We answer another productive question, an architectural one: whether the structure of an encoding circuit can carry an inductive bias that tuned classical kernels lack. We introduce AeRot, 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. On Lorenz-63 kernel ridge regression with cross-validated bandwidths over 100 seeds, AeRot outperforms tuned RBF and Matern-5/2, the advantage emerging at physical horizons>= 0.15 tu and reaching +0.137 mean R^2 at 0.25 tu (5 qubits, window 32). Linear-stability analysis of the window tail localises the advantage to the unstable saddle-approach regime: AeRot wins 83% of windows in the most unstable decile, with the win rate rising monotonically with tail instability and a sign flip at the local stability boundary. The difficulty is fold-branch ambiguity: trajectories approaching the saddle are locally diverging, and Euclidean kernels struggle to resolve which lobe the trajectory will commit to. Structural diagnostics confirm Gram matrices structurally distinct from tuned RBF, with strictly higher target-kernel alignment at every horizon. The gain is architectural: a finite-sample inductive-bias effect of temporally structured encoding on a folded attractor, with no computational-separation claim attached. To our knowledge this is the first mechanistic localisation of quantum-kernel advantage to a specific dynamical regime of a classical system.
Banks predict credit default with Logistic Regression because regulators can read its coefficients—but it cannot express interactions. We add the missing non-linearity with a quantum-inspired feature map: 8 of the data's 23 columns become rotation angles of 8 qubits in an IQP circuit simulated in PennyLane, and 2 × 8 =...
Menachem Finkelstein, Diana Levy, Sarel Cohen et al.· Proceedings of the 19th ACM...· 0 citations
This work proposes Quantum SEDONet (Spectral-Embedded Deep Operator Network), which assigns each trunk coordinate a spectral basis according to its boundary condition: Fourier features for periodic coordinates and Chebyshev features for bounded, non-periodic coordinates.
Muhammad Abid, Arth Sojitra, Bipin Tiwari et al.· 0 citations
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.
We introduce Quantum-KIP, a method that compresses a training set into a small set of kernel inducing points with soft labels. It uses a quantum feature map to compute state-fidelity overlaps and relies only on forward evaluations, avoiding backpropagation through quantum circuits. We provide a compression-induced stab...
Baobao Song, Shiva Raj Pokhrel, Athanasios V. Vasilakos et al.· IEEE Transactions on Informa...· 0 citations
Together, these results delineate a practical operating regime for high-dimensional local quantum learning and show that receptive-field scaling can be managed through a coordinated choice of upload granularity, entangling structure, information retention, and execution depth.
Wen-Bin Yu, Yan-Feng Fan, You-Le Wang et al.· Machine Learning: Science an...· 0 citations
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
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.