Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2605.30952

Spectral Anatomy of Quantum Gaussian Process Kernels

Jian Xu, Chao Li, Guang Lin, Yuning Qiu, Delu Zeng, John Paisley, Qibin Zhao

Published May 29, 2026• 0 citations
arXivHTMLPDF

Abstract

Two recent results have reshaped quantum Gaussian processes (QGPs). On the one hand, \citet{lowe2025assessing} rule out the exponential speedups claimed by HHL-based QGP regression in the typical, well-conditioned regime; on the other, an independent line of work shows that highly expressive quantum kernels suffer posterior pathologies that break Bayesian optimization. We show that these seemingly unrelated phenomena are governed by the same quantity: the normalized spectral entropy $S(K)/\log n$ of the kernel Gram matrix. We prove a Cauchy--Schwarz tail bound on Nyström approximation error, a finite-sample variance-contraction identity in terms of Bach's degrees of freedom $d_σ(K)$, and a characterization of the \emph{target-dependent} optimal entropy via the intrinsic dimension of the target in the kernel eigenbasis. Empirically, the diagnostic is kernel-agnostic: hardware-efficient, matchgate, IQP \emph{and} RBF/Matérn/RFF/deep-kernel families all collapse onto identical $S/\log n$ curves on dequantization, ECE, and variance-contraction panels. The NLL sweet spot lives at high entropy for smooth targets and at low entropy for band-limited quantum-data targets. The diagnostic transfers from simulator to IBM Heron hardware with median absolute error $3.2\%$ and mean $5.2\%$ in $S/\log n$ across $24$ configurations at $n_q = 4$, with matchgate and IQP within $5\%$ mean and a single HE configuration returning a $30\%$ outlier that drops to $0.5\%$ on rerun (attributed to calibration drift); the same diagnostic transfers to a second Heron backend (mean error $2.7\%$) and to a $n_q = 6$ scale-up on the original backend (mean error $1.7\%$). No error mitigation is applied throughout.

DOI
10.48550/arxiv.2605.30952

Related papers

Active Quantum Kernel Acquisition for Gaussian Process Regression

Jian Xu, Artur Miroszewski, John William Paisley +2 more

Quantum kernel estimation on near-term hardware is shot-budgeted: every entry of the kernel Gram matrix is a Bernoulli expectation that must be sampled with a finite number of circuit executions. Recent work on quantum kernel classification has shown that allocating shots non-uniformly across kernel entries, weighted by their downstream task sensitivity, can reduce the shot budget required to reach a target accuracy. We extend this idea to Gaussian process (GP) regression, a setting whose downstream quantities (full-spectrum posterior variance, log-determinant, marginal likelihood) couple to kernel error more tightly than the sign-only outputs of classification. We derive three closed-form pair-level sensitivities predictive coupling $|α_iα_j|$, leave-one-out residual, and marginal-likelihood gradient and plug them into a Neyman-style minimum-variance allocation rule. To prevent catastrophic over-concentration when the warm-up sensitivity estimate is itself noisy, we add a high uniform coverage floor justified by a Frobenius lower bound on the missing-entry perturbation. On four UCI benchmarks and two synthetic RBF + Bernoulli controlled studies, the resulting allocator delivers $10$--$21\%$ test-RMSE improvement over uniform allocation across the moderate-budget regime. The gain transfers (i) to genuine ZZ and Pauli-Z quantum kernels on quantum-natural data ($-13$--$15\%$ at low budget, $p<0.05$ paired) and (ii) to four downstream tasks (Bayesian quadrature, heteroscedastic regression, hyperparameter learning, multi-output Cokriging). On UCI features embedded into a ZZ kernel the gain disappears, consistent with the exponential-concentration regime where shot allocation has nothing to exploit.

arXiv:2606.28833•Jun 27, 2026•1 citation

Diagnosing Quantum Kernel Failures: Spectral Audit, Dequantization, and the Dual Concentration Bottleneck

Neil Suarez

We present ThylerSpectral-Audit-Q, a three-layer automated diagnostic framework for quantum kernel pathologies, validated across 124 configurations spanning 7 data domains plus a systematic six-family quantum kernel survey: tabular (digits, diabetes, California housing, covtype), clinical (Iris, Wine, Breast Cancer), quantum-native (V0/V1 ZZFeatureMap, V2 IQPFeatureMap), molecular graph (MUTAG, PTC_FM), industrial (semiconductor proxy, Steel Plates Faults, satellite proxy), time series (AR2, ECG5000 via ZZFeatureMap, QHMM, and TSHK kernels). The kernel survey applies six encoding families (PauliFeatureMap, AngleEncoding, AmplitudeEncoding, EfficientSU2, RandomCircuitKernel, QFTFeatureMap) to three tabular benchmark datasets at n ∈ {4, 6, 8}. Contribution 1 — Diagnostic framework. Three sequential layers — exponential concentration (EC) detection (Shannon effective rank ratio r_eff; five-tier spectral taxonomy), dequantization filter (Tang-Chia eigenvalue truncation), and kernel-target alignment evaluation (centered KTA) — combine into a composite PROCEED/CAUTION/ABORT Spectral Health Card. All four primary datasets (breast cancer, make_moons, Iris, Wine) yield ABORT or CAUTION verdicts under ZZFeatureMap. The framework generalizes: IQPFeatureMap reproduces EC_COLLAPSE at n=8 (r_eff=0.943) without recalibration. A data-kernel structural sensitivity is also detected: the same kernel yields LIKELY_DEQUANTIZABLE on molecular graph data (r_eff=0.153) versus CONFIRMED_DEQUANTIZABLE on tabular data (r_eff=0.095) — a distinction invisible to kernel architecture inspection alone. Contribution 2 — Advantage regime, retired at n_train=150 (v19). At n_train=50, Hamming Quantum Kernel (HQK) on quantum-native data produced the paper's only non-ABORT signal: large effect sizes over SVM-Linear on V2 (IQPFeatureMap) data (d=+0.949–1.015; under the corrected resampled t-test for repeated-CV dependence, p_NB=0.0605 for λ=0.5 and p_NB=0.0485 for λ=0.1 — marginal). Because the pre-registered robustness criterion required corrected significance in both λ configurations, a recovery experiment at n_train=150 was pre-registered (exploracion_010) and has now been executed (S052). Result: every V2 effect size reverses sign — λ=0.5: d=−0.215 (p_NB=0.6375, ns); λ=0.1: d=−1.243 (p_NB=0.0189 — a significant disadvantage, HQK now performing worse than SVM-Linear/RBF) — and the pre-registered effect-size-floor control (d≥0.5 in both λ, designed to distinguish gradual collapse from sign reversal) fails in both configurations. The secondary same-architecture V0/V1 arm also reverses sign (d=+0.27→−0.374 vs Linear, ns). Per the pre-registered decision rule, the cross-architecture advantage claim is retired, not restored. This converges with exploracion_012's finding that V6 — a circuit verified diagonal-unitary by construction but structurally distinct from V0/V1/V2's ZZ/IQP coupling — also shows significant disadvantage at n_train=150 (d=−1.10 to −1.13, p_NB<0.05 in both λ): at the matched n_train=150 standard, no HQK configuration tested in this paper shows a robust advantage over classical baselines. The dual concentration bottleneck — global EC (fidelity collapse) and local EC (Pauli-Z observables ⟨Z_i⟩→0 as n increases) — disables both fidelity kernels and projected quantum kernels simultaneously, and this negative result is now the paper's consistent empirical picture rather than a partial exception to it. A complementary negative structural result: exhaustive hyperparameter optimization over ZZFeatureMap (63 grid configurations: γ × reps × entanglement, plus 100-step continuous variational search) on classical time series data (AR2_n4, r_eff=0.2975) finds zero configurations with Δ_kta > 0 in full audit, confirming that quantum-native data is a necessary but not sufficient structural condition for any advantage signal under the full three-layer audit within the ZZFeatureMap family. The D6 kernel survey further shows that K2 (AngleEncoding) achieves Δ_kta>0 on classical tabular data, but is blocked from PROCEED by the dequantization filter, confirming that Layers 1–2 are essential to prevent false PROCEED verdicts. Contribution 3 — Quantum kernel phase diagram. The 124 audited configurations form a quantum kernel phase diagram in (r_eff × Δ_acc × n_qubits) space with two robustly confirmed empirical phases (ABORT, CAUTION) and measurable phase boundaries, plus a third, provisional phase (PROCEED, 7/124 configs) that has not been re-verified at the n_train=150 standard that retired Contribution 2 above. Seven geometric patterns are observable, including a cross-domain discovery: the STRUCTURED_LOW_RANK regime (0.10 < r_eff ≤ 0.35) appears independently in molecular graph data (r_eff ∈ [0.036, 0.312]) and industrial quality-control data (r_eff=0.22), despite no domain relationship — a finding invisible to kernel architecture inspection alone. Contribution 4 — Domain-agnostic spectral classification. A k-nearest-neighbor classifier trained exclusively on spectral audit features achieves F1-macro=1.000 and MCC=1.000 on an external test set of 20 configurations from three entirely unseen domains: molecular graphs, industrial QC, and time series. Random Forest feature importance reveals dataset_type_code=0% — the framework's diagnostic accuracy is domain-invariant by construction. To the best of our knowledge, ThylerSpectral-Audit-Q is the only pre-execution diagnostic tool integrating EC detection, dequantization filtering, and structural alignment evaluation into a single automated pipeline with an empirical multi-domain phase diagram, validated across 124 configurations spanning 7 data domains and a systematic six-family quantum kernel survey.

•Aug 19, 2026•0 citations

Benchmarking Quantum Kernel Support Vector Machines Against Classical Baselines on Tabular Data: A Rigorous Empirical Study with Hardware Validation

Siavash Kakavand, Christoph Strohmeyer, Michael Schlotter

Quantum kernel methods have been proposed as a promising approach for leveraging near-term quantum computers for supervised learning, yet rigorous benchmarks against strong classical baselines remain scarce. We present a comprehensive empirical study of quantum kernel support vector machines (QSVMs) across nine binary classification datasets, four quantum feature maps, three classical kernels, and multiple noise models, totalling 970 experiments with strict nested cross-validation. Our analysis spans four phases: (i) statistical significance testing, revealing that none of 29 pairwise quantum-classical comparisons reach significance at $α= 0.05$; (ii) learning curve analysis over six training fractions, showing steeper quantum slopes on six of eight datasets that nonetheless fail to close the gap to the best classical baseline; (iii) hardware validation on IBM ibm_fez (Heron r2), demonstrating kernel fidelity $r \geq 0.976$ across six experiments; and (iv) seed sensitivity analysis confirming reproducibility (mean CV 1.4%). A Kruskal-Wallis factorial analysis reveals that dataset choice dominates performance variance ($\varepsilon^2 = 0.73$), while kernel type accounts for only 9%. Spectral analysis offers a mechanistic explanation: current quantum feature maps produce eigenspectra that are either too flat or too concentrated, missing the intermediate profile of the best classical kernel, the radial basis function (RBF). Quantum kernel training (QKT) via kernel-target alignment yields the single competitive result -- balanced accuracy 0.968 on breast cancer -- but with ~2,000x computational overhead. Our findings provide actionable guidelines for quantum kernel research. The complete benchmark suite is publicly available to facilitate reproduction and extension.

quant-pharXiv:2604.18837•Apr 22, 2026•6 citations

Provable and scalable quantum Gaussian processes for quantum learning

Jonas Jäger, Paolo Braccia, Pablo Bermejo +3 more

Despite rapid recent advances in quantum machine learning, the field is in many ways stuck. Existing approaches can exhibit serious limitations, and we still lack learning frameworks that are simple, interpretable, scalable, and naturally suited to quantum data. To address this, here we introduce quantum Gaussian processes, a Bayesian framework for learning from quantum systems through priors over unknown quantum transformations. We show that, under suitable conditions, unitary quantum stochastic processes define Gaussian processes, thereby enabling regression, classification, and Bayesian optimization directly on quantum data. The key ingredient in this framework is sufficient knowledge of a quantum process's structure and symmetries to define an informative prior through its corresponding quantum kernel, effectively injecting a strong, physics-informed inductive bias into the learning model. We then prove that matchgate, or free-fermionic, evolutions give rise to provable and scalable quantum Gaussian processes, providing the first family in our framework where the unknown unitary acts non-trivially on all qubits. Finally, we demonstrate accurate long-range extrapolation, phase-diagram learning in many-body systems, and sample-efficient Bayesian optimization in a quantum sensing task. Our results identify quantum Gaussian processes as a promising route toward simpler and more structured forms of quantum learning.

quant-pharXiv:2605.00099•May 4, 2026•6 citations

Effective Dimension Governs Generalization in Quantum Kernel Vision Models

Jian Xu, Delu Zeng, John Paisley +1 more

Recent quantum vision models-quantum vision transformers and quantum convolutional networks-report two striking but unexplained empirical phenomena: (i) ansatze with more, or more uniformly distributed, entanglement generalize better, and (ii) injecting quantum noise can improve test accuracy rather than degrade it. These observations are currently treated as curiosities, discovered by grid search and explained, if at all, by hand. We show that both are manifestations of a single, measurable quantity: the \emph{effective dimension} $d_{\rm eff}$ of the (noise-shaped) quantum feature kernel. Working primarily with quantum-kernel vision models-a quantum feature map read out by a kernel classifier-we give a spectral account in which entanglement structure and quantum noise are two knobs that move $d_{\rm eff}$; in an overfitting regime, contracting $d_{\rm eff}$ acts as ridge-like regularization. We analyze the mechanism: an \emph{exact} decomposition of the depolarized kernel $K_p=(1-p)^2K+\tfrac{p(2-p)}{D}\mathbf{1}\mathbf{1}^\top$ with $d_{\rm eff}(K_p)\to1$, a contraction result (and its boundary) for amplitude damping, a kernel-machine capacity bound, and a capacity/alignment risk decomposition; the monotone contraction operative in our entangled experiments is verified empirically, not proven in general. Along the one-parameter depolarizing family the collapse is instead exact by construction; we use it only to confirm the kernel decomposition to machine precision and at up to $12$ qubits, not as evidence for $d_{\rm eff}$. Amplitude damping contracts $d_{\rm eff}$ and lifts test accuracy by up to $+13\%$ along an inverted-U sweet spot; the effect's sign flips between the over- and under-fitting regimes; noise injection matches an explicit spectral-filtering frontier. Our results organize two reported anecdotes into a single measurable principle for designing quantum-vision models.

arXiv:2606.20183•Jun 18, 2026•0 citations

Statevector-to-Hardware Reconstruction of a Four-Qubit ZZ Quantum Kernel: A Single-Backend Case Study of Three Execution Jobs

Rostyslav Sipakov

Hardware noise and finite sampling perturb the fidelity estimates forming a quantum-kernel Gram matrix. We measured how far three hardware-reconstructed Gram matrices depart from an exact statevector reference for one frozen four-qubit ZZ feature map on N=24 indoor air-quality windows, executed on ibm_fez at 1024 shots per circuit in three single, non-interleaved jobs: baseline, dynamical decoupling alone, and gate twirling alone. All were complete, finite, and positive-semidefinite. Off-diagonal root-mean-squared error (RMSE) against the reference was 0.0878, 0.0864, and 0.0427; full-matrix centered kernel alignment (CKA) ranged 0.933-0.989 and the post hoc diagonal-excluded (U-centered) CKA 0.816-0.986. The gate-twirled job deviated least on every reported geometry axis; its baseline contrasts are deletion-stable for the Spearman, mean-absolute-error, RMSE, and full-matrix CKA diagnostics, while the Pearson and diagonal-excluded contrasts fall just below that convention. Dynamical decoupling was not separated from the baseline. The observed error exceeded both finite-shot reference scales, so, under those sampling-only models, sampling does not explain it. Centered kernel-target alignment did not track reconstruction fidelity and stayed at or below each label-permutation reference: implementation fidelity and task relevance are distinct diagnostic axes. All configuration-level statements describe three realized jobs on one backend; no mitigation-efficacy, classifier-superiority, forecasting, or quantum-advantage claim is made.

quant-pharXiv:2607.20377•Quantum Reports•Jul 23, 2026•1 citation
Two recent results have reshaped quantum Gaussian processes (QGPs). On the one hand, \citet{lowe2025assessing} rule out the exponential speedups claimed by HHL-based QGP regression in the typical, well-conditioned regime; on the other, an independent line of work shows that highly expressive quantum kernels suffer posterior pathologies that break Bayesian optimization. We show that these seemingly unrelated phenomena are governed by the same quantity: the normalized spectral entropy S(K)/log⁡nS(K)/\log nS(K)/logn of the kernel Gram matrix. We prove a Cauchy--Schwarz tail bound on Nyström approximation error, a finite-sample variance-contraction identity in terms of Bach's degrees of freedom dσ(K)d_σ(K)dσ​(K), and a characterization of the \emph{target-dependent} optimal entropy via the intrinsic dimension of the target in the kernel eigenbasis. Empirically, the diagnostic is kernel-agnostic: hardware-efficient, matchgate, IQP \emph{and} RBF/Matérn/RFF/deep-kernel families all collapse onto identical S/log⁡nS/\log nS/logn curves on dequantization, ECE, and variance-contraction panels. The NLL sweet spot lives at high entropy for smooth targets and at low entropy for band-limited quantum-data targets. The diagnostic transfers from simulator to IBM Heron hardware with median absolute error 3.2%3.2\%3.2% and mean 5.2%5.2\%5.2% in S/log⁡nS/\log nS/logn across 242424 configurations at nq=4n_q = 4nq​=4, with matchgate and IQP within 5%5\%5% mean and a single HE configuration returning a 30%30\%30% outlier that drops to 0.5%0.5\%0.5% on rerun (attributed to calibration drift); the same diagnostic transfers to a second Heron backend (mean error 2.7%2.7\%2.7%) and to a nq=6n_q = 6nq​=6 scale-up on the original backend (mean error 1.7%1.7\%1.7%). No error mitigation is applied throughout.
Quantum kernel estimation on near-term hardware is shot-budgeted: every entry of the kernel Gram matrix is a Bernoulli expectation that must be sampled with a finite number of circuit executions. Recent work on quantum kernel classification has shown that allocating shots non-uniformly across kernel entries, weighted by their downstream task sensitivity, can reduce the shot budget required to reach a target accuracy. We extend this idea to Gaussian process (GP) regression, a setting whose downstream quantities (full-spectrum posterior variance, log-determinant, marginal likelihood) couple to kernel error more tightly than the sign-only outputs of classification. We derive three closed-form pair-level sensitivities predictive coupling ∣αiαj∣|α_iα_j|∣αi​αj​∣, leave-one-out residual, and marginal-likelihood gradient and plug them into a Neyman-style minimum-variance allocation rule. To prevent catastrophic over-concentration when the warm-up sensitivity estimate is itself noisy, we add a high uniform coverage floor justified by a Frobenius lower bound on the missing-entry perturbation. On four UCI benchmarks and two synthetic RBF + Bernoulli controlled studies, the resulting allocator delivers 101010--21%21\%21% test-RMSE improvement over uniform allocation across the moderate-budget regime. The gain transfers (i) to genuine ZZ and Pauli-Z quantum kernels on quantum-natural data (−13-13−13--15%15\%15% at low budget, p<0.05p<0.05p<0.05 paired) and (ii) to four downstream tasks (Bayesian quadrature, heteroscedastic regression, hyperparameter learning, multi-output Cokriging). On UCI features embedded into a ZZ kernel the gain disappears, consistent with the exponential-concentration regime where shot allocation has nothing to exploit.
We present ThylerSpectral-Audit-Q, a three-layer automated diagnostic framework for quantum kernel pathologies, validated across 124 configurations spanning 7 data domains plus a systematic six-family quantum kernel survey: tabular (digits, diabetes, California housing, covtype), clinical (Iris, Wine, Breast Cancer), quantum-native (V0/V1 ZZFeatureMap, V2 IQPFeatureMap), molecular graph (MUTAG, PTC_FM), industrial (semiconductor proxy, Steel Plates Faults, satellite proxy), time series (AR2, ECG5000 via ZZFeatureMap, QHMM, and TSHK kernels). The kernel survey applies six encoding families (PauliFeatureMap, AngleEncoding, AmplitudeEncoding, EfficientSU2, RandomCircuitKernel, QFTFeatureMap) to three tabular benchmark datasets at n ∈ {4, 6, 8}. Contribution 1 — Diagnostic framework. Three sequential layers — exponential concentration (EC) detection (Shannon effective rank ratio r_eff; five-tier spectral taxonomy), dequantization filter (Tang-Chia eigenvalue truncation), and kernel-target alignment evaluation (centered KTA) — combine into a composite PROCEED/CAUTION/ABORT Spectral Health Card. All four primary datasets (breast cancer, make_moons, Iris, Wine) yield ABORT or CAUTION verdicts under ZZFeatureMap. The framework generalizes: IQPFeatureMap reproduces EC_COLLAPSE at n=8 (r_eff=0.943) without recalibration. A data-kernel structural sensitivity is also detected: the same kernel yields LIKELY_DEQUANTIZABLE on molecular graph data (r_eff=0.153) versus CONFIRMED_DEQUANTIZABLE on tabular data (r_eff=0.095) — a distinction invisible to kernel architecture inspection alone. Contribution 2 — Advantage regime, retired at n_train=150 (v19). At n_train=50, Hamming Quantum Kernel (HQK) on quantum-native data produced the paper's only non-ABORT signal: large effect sizes over SVM-Linear on V2 (IQPFeatureMap) data (d=+0.949–1.015; under the corrected resampled t-test for repeated-CV dependence, p_NB=0.0605 for λ=0.5 and p_NB=0.0485 for λ=0.1 — marginal). Because the pre-registered robustness criterion required corrected significance in both λ configurations, a recovery experiment at n_train=150 was pre-registered (exploracion_010) and has now been executed (S052). Result: every V2 effect size reverses sign — λ=0.5: d=−0.215 (p_NB=0.6375, ns); λ=0.1: d=−1.243 (p_NB=0.0189 — a significant disadvantage, HQK now performing worse than SVM-Linear/RBF) — and the pre-registered effect-size-floor control (d≥0.5 in both λ, designed to distinguish gradual collapse from sign reversal) fails in both configurations. The secondary same-architecture V0/V1 arm also reverses sign (d=+0.27→−0.374 vs Linear, ns). Per the pre-registered decision rule, the cross-architecture advantage claim is retired, not restored. This converges with exploracion_012's finding that V6 — a circuit verified diagonal-unitary by construction but structurally distinct from V0/V1/V2's ZZ/IQP coupling — also shows significant disadvantage at n_train=150 (d=−1.10 to −1.13, p_NB<0.05 in both λ): at the matched n_train=150 standard, no HQK configuration tested in this paper shows a robust advantage over classical baselines. The dual concentration bottleneck — global EC (fidelity collapse) and local EC (Pauli-Z observables ⟨Z_i⟩→0 as n increases) — disables both fidelity kernels and projected quantum kernels simultaneously, and this negative result is now the paper's consistent empirical picture rather than a partial exception to it. A complementary negative structural result: exhaustive hyperparameter optimization over ZZFeatureMap (63 grid configurations: γ × reps × entanglement, plus 100-step continuous variational search) on classical time series data (AR2_n4, r_eff=0.2975) finds zero configurations with Δ_kta > 0 in full audit, confirming that quantum-native data is a necessary but not sufficient structural condition for any advantage signal under the full three-layer audit within the ZZFeatureMap family. The D6 kernel survey further shows that K2 (AngleEncoding) achieves Δ_kta>0 on classical tabular data, but is blocked from PROCEED by the dequantization filter, confirming that Layers 1–2 are essential to prevent false PROCEED verdicts. Contribution 3 — Quantum kernel phase diagram. The 124 audited configurations form a quantum kernel phase diagram in (r_eff × Δ_acc × n_qubits) space with two robustly confirmed empirical phases (ABORT, CAUTION) and measurable phase boundaries, plus a third, provisional phase (PROCEED, 7/124 configs) that has not been re-verified at the n_train=150 standard that retired Contribution 2 above. Seven geometric patterns are observable, including a cross-domain discovery: the STRUCTURED_LOW_RANK regime (0.10 < r_eff ≤ 0.35) appears independently in molecular graph data (r_eff ∈ [0.036, 0.312]) and industrial quality-control data (r_eff=0.22), despite no domain relationship — a finding invisible to kernel architecture inspection alone. Contribution 4 — Domain-agnostic spectral classification. A k-nearest-neighbor classifier trained exclusively on spectral audit features achieves F1-macro=1.000 and MCC=1.000 on an external test set of 20 configurations from three entirely unseen domains: molecular graphs, industrial QC, and time series. Random Forest feature importance reveals dataset_type_code=0% — the framework's diagnostic accuracy is domain-invariant by construction. To the best of our knowledge, ThylerSpectral-Audit-Q is the only pre-execution diagnostic tool integrating EC detection, dequantization filtering, and structural alignment evaluation into a single automated pipeline with an empirical multi-domain phase diagram, validated across 124 configurations spanning 7 data domains and a systematic six-family quantum kernel survey.
Quantum kernel methods have been proposed as a promising approach for leveraging near-term quantum computers for supervised learning, yet rigorous benchmarks against strong classical baselines remain scarce. We present a comprehensive empirical study of quantum kernel support vector machines (QSVMs) across nine binary classification datasets, four quantum feature maps, three classical kernels, and multiple noise models, totalling 970 experiments with strict nested cross-validation. Our analysis spans four phases: (i) statistical significance testing, revealing that none of 29 pairwise quantum-classical comparisons reach significance at α=0.05α= 0.05α=0.05; (ii) learning curve analysis over six training fractions, showing steeper quantum slopes on six of eight datasets that nonetheless fail to close the gap to the best classical baseline; (iii) hardware validation on IBM ibm_fez (Heron r2), demonstrating kernel fidelity r≥0.976r \geq 0.976r≥0.976 across six experiments; and (iv) seed sensitivity analysis confirming reproducibility (mean CV 1.4%). A Kruskal-Wallis factorial analysis reveals that dataset choice dominates performance variance (ε2=0.73\varepsilon^2 = 0.73ε2=0.73), while kernel type accounts for only 9%. Spectral analysis offers a mechanistic explanation: current quantum feature maps produce eigenspectra that are either too flat or too concentrated, missing the intermediate profile of the best classical kernel, the radial basis function (RBF). Quantum kernel training (QKT) via kernel-target alignment yields the single competitive result -- balanced accuracy 0.968 on breast cancer -- but with ~2,000x computational overhead. Our findings provide actionable guidelines for quantum kernel research. The complete benchmark suite is publicly available to facilitate reproduction and extension.
Despite rapid recent advances in quantum machine learning, the field is in many ways stuck. Existing approaches can exhibit serious limitations, and we still lack learning frameworks that are simple, interpretable, scalable, and naturally suited to quantum data. To address this, here we introduce quantum Gaussian processes, a Bayesian framework for learning from quantum systems through priors over unknown quantum transformations. We show that, under suitable conditions, unitary quantum stochastic processes define Gaussian processes, thereby enabling regression, classification, and Bayesian optimization directly on quantum data. The key ingredient in this framework is sufficient knowledge of a quantum process's structure and symmetries to define an informative prior through its corresponding quantum kernel, effectively injecting a strong, physics-informed inductive bias into the learning model. We then prove that matchgate, or free-fermionic, evolutions give rise to provable and scalable quantum Gaussian processes, providing the first family in our framework where the unknown unitary acts non-trivially on all qubits. Finally, we demonstrate accurate long-range extrapolation, phase-diagram learning in many-body systems, and sample-efficient Bayesian optimization in a quantum sensing task. Our results identify quantum Gaussian processes as a promising route toward simpler and more structured forms of quantum learning.
Recent quantum vision models-quantum vision transformers and quantum convolutional networks-report two striking but unexplained empirical phenomena: (i) ansatze with more, or more uniformly distributed, entanglement generalize better, and (ii) injecting quantum noise can improve test accuracy rather than degrade it. These observations are currently treated as curiosities, discovered by grid search and explained, if at all, by hand. We show that both are manifestations of a single, measurable quantity: the \emph{effective dimension} deffd_{\rm eff}deff​ of the (noise-shaped) quantum feature kernel. Working primarily with quantum-kernel vision models-a quantum feature map read out by a kernel classifier-we give a spectral account in which entanglement structure and quantum noise are two knobs that move deffd_{\rm eff}deff​; in an overfitting regime, contracting deffd_{\rm eff}deff​ acts as ridge-like regularization. We analyze the mechanism: an \emph{exact} decomposition of the depolarized kernel Kp=(1−p)2K+p(2−p)D11⊤K_p=(1-p)^2K+\tfrac{p(2-p)}{D}\mathbf{1}\mathbf{1}^\topKp​=(1−p)2K+Dp(2−p)​11⊤ with deff(Kp)→1d_{\rm eff}(K_p)\to1deff​(Kp​)→1, a contraction result (and its boundary) for amplitude damping, a kernel-machine capacity bound, and a capacity/alignment risk decomposition; the monotone contraction operative in our entangled experiments is verified empirically, not proven in general. Along the one-parameter depolarizing family the collapse is instead exact by construction; we use it only to confirm the kernel decomposition to machine precision and at up to 121212 qubits, not as evidence for deffd_{\rm eff}deff​. Amplitude damping contracts deffd_{\rm eff}deff​ and lifts test accuracy by up to +13%+13\%+13% along an inverted-U sweet spot; the effect's sign flips between the over- and under-fitting regimes; noise injection matches an explicit spectral-filtering frontier. Our results organize two reported anecdotes into a single measurable principle for designing quantum-vision models.
Hardware noise and finite sampling perturb the fidelity estimates forming a quantum-kernel Gram matrix. We measured how far three hardware-reconstructed Gram matrices depart from an exact statevector reference for one frozen four-qubit ZZ feature map on N=24 indoor air-quality windows, executed on ibm_fez at 1024 shots per circuit in three single, non-interleaved jobs: baseline, dynamical decoupling alone, and gate twirling alone. All were complete, finite, and positive-semidefinite. Off-diagonal root-mean-squared error (RMSE) against the reference was 0.0878, 0.0864, and 0.0427; full-matrix centered kernel alignment (CKA) ranged 0.933-0.989 and the post hoc diagonal-excluded (U-centered) CKA 0.816-0.986. The gate-twirled job deviated least on every reported geometry axis; its baseline contrasts are deletion-stable for the Spearman, mean-absolute-error, RMSE, and full-matrix CKA diagnostics, while the Pearson and diagonal-excluded contrasts fall just below that convention. Dynamical decoupling was not separated from the baseline. The observed error exceeded both finite-shot reference scales, so, under those sampling-only models, sampling does not explain it. Centered kernel-target alignment did not track reconstruction fidelity and stayed at or below each label-permutation reference: implementation fidelity and task relevance are distinct diagnostic axes. All configuration-level statements describe three realized jobs on one backend; no mitigation-efficacy, classifier-superiority, forecasting, or quantum-advantage claim is made.