Estimating an quantum kernel from circuit fidelities requires measurement shots, the dominant bottleneck for deployment on near-term hardware. Existing budget-saving methods (Nyström-QKE, ShoFaR, kernel-target alignment) sub-sample \emph{which} entries to measure but allocate shots \emph{uniformly} within their chosen subset, ignoring how much each entry drives the downstream classifier. We close this gap with two contributions. for shot-budgeted quantum kernel learning: a principled menu of when each allocator wins. Our method, \emph{AQKA}, dominates the budget-limited regime () on sparse-sensitivity KRR, with the gap \emph{growing} from to pts over uniform as scales and reaching – pts on an (156-qubit Heron) hardware kernel; Nyström-QKE wins at saturating budgets on planted-sparse via low-rank reconstruction; ShoFaR is competitive only at extreme low budgets. : with explicit gradient for KRR (Lemma~1, ) and SVM via the envelope theorem (); a \emph{corrected} sparsity-aware Cauchy–Schwarz rate matching empirics (vs.\ the naive ); an explicit-constant plug-in regret bound (Theorem~2); and a tighter SVM ceiling . We close with the first multi-seed live online adaptive shot allocation on quantum hardware: pts at on (, 5 seeds), with the advantage holding at at higher budget on ( pts, 5 seeds).

生成讲解博客的中文版本

生成AI智能校验的中文版本