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:2608.24891

Measurement-Budget Allocation in Quantum Learning with Finite-Shot Generalization Guarantees

Ferhat Özgür Çatak

Published Jun 1, 2026• 0 citations
arXivHTMLPDF

Abstract

On near-term quantum hardware, estimating a Born probability requires repeated circuit executions. A quantum learning experiment with a fixed measurement budget $B$ must therefore decide how many distinct training states $n$ to use and how many shots $S$ to allocate to each state. We study this tradeoff for binary quantum classifiers with fixed or independently selected measurement operators $M$, where the ideal score is $Tr(M\rho)$. We prove a distribution-free generalization bound that separates the finite-sample and finite-shot contributions. The sample term scales as $\sqrt{d/n}$, while the shot term scales as $\sqrt{(\log n)/S}$; under the constraint $B=nS$, these two terms move in opposite directions. Minimising a conservative closed-form surrogate of the bound gives the allocation rule $n^{*} = 2\sqrt{2dB/\log(2B/\delta)}$ and $S^{*} = B/nstar$. This surrogate has the same asymptotic scaling as the exact minimizer and yields a worst-case rate of $B^{-1/4}$. The guarantee is intentionally conservative, since it applies to the full class of binary quantum measurements. We complement the theory with PennyLane simulations using 2-qubit and 4-qubit variational quantum circuits on nine synthetic binary classification benchmarks. In all tested configurations, the one-sided empirical generalization gap remains below the theoretical bound. The result provides a conservative statistical guideline for allocating measurement budgets in finite-shot evaluation and pre-experimental planning for near-term quantum learning systems, complementing hardware-level scheduling and circuit-design considerations. Extending the guarantee to fully adaptive shot-noisy training remains an open problem.

DOI
10.48550/arxiv.2608.24891

Related papers

Quantum statistical learning theory: concepts, regimes, and open problems

Ferhat Özgür Çatak

Statistical learning theory provides the mathematical foundations for understanding generalization from finite data. As quantum computing and quantum machine learning continue to develop, there is increasing interest in whether analogous principles can be formulated for learning settings involving quantum data, quantum models, or quantum computation. This paper offers an introductory perspective on quantum statistical learning theory. We begin by recalling the basic ideas of classical statistical learning theory, including empirical risk minimization, hypothesis classes, generalization, and sample complexity, and then discuss how these concepts must be adapted in the quantum setting. In particular, we distinguish between learning with classical data using quantum algorithms, learning with quantum models, and learning directly from quantum data. We then develop a resource-sensitive description that separates population risk, ideal empirical risk, and finite-shot empirical risk. This distinction makes explicit the different roles of training sample size and measurement budget. For a binary measurement-based classifier, we derive a finite-shot condition relating the required measurement budget to the sample size, confidence level, and classification margin. We further discuss how finite-sample generalization, finite-measurement estimation, and hardware imperfections can be represented as distinct contributions to experimentally observed learning performance. We conclude with a discussion of open problems and directions toward a more unified theory of generalization and learnability in quantum learning.

Quantum Information Processing•Oct 5, 2026•0 citations

AQKA: Active Quantum Kernel Acquisition Under a Shot Budget

Jian Xu, Chao Li, Delu Zeng +2 more

Estimating an $N \times N$ quantum kernel from circuit fidelities requires $Θ(N^2 S)$ 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. \textbf{First, a complete regime decomposition} for shot-budgeted quantum kernel learning: a principled menu of when each allocator wins. Our method, \emph{AQKA}, dominates the budget-limited regime ($B \lesssim 16 n_{\mathrm{pairs}}$) on sparse-sensitivity KRR, with the gap \emph{growing} from $+8$ to $+25$ pts over uniform as $N$ scales $225{\to}1000$ and reaching $+26$--$32$ pts on an \texttt{ibm\_pittsburgh} (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. \textbf{Second, a closed-form pair-level acquisition theory}: $s_{ij}^{\star} \propto |g_{ij}|\sqrt{K_{ij}(1-K_{ij})}$ with explicit gradient $g_{ij}$ for KRR (Lemma~1, $|β_iα_j+β_jα_i|\sqrt{K_{ij}(1-K_{ij})}$) and SVM via the envelope theorem ($|η_i^*η_j^*|\sqrt{K_{ij}(1-K_{ij})}$); a \emph{corrected} sparsity-aware Cauchy--Schwarz rate $ρ\le 2m/N$ matching empirics (vs.\ the naive $m^2/N^2$); an explicit-constant plug-in regret bound (Theorem~2); and a tighter SVM ceiling $ρ^{\mathrm{SVM}} \le m_{\mathrm{sv}}^2/N^2$. We close with the first multi-seed live online adaptive shot allocation on quantum hardware: $+17.0 \pm 4.8$ pts at $N{=}20$ on \texttt{ibm\_aachen} ($3.5σ$, 5 seeds), with the advantage holding at $N{=}30$ at higher budget on \texttt{ibm\_berlin} ($+14.0 \pm 8.5$ pts, 5 seeds).

arXiv:2605.14672•May 14, 2026•2 citations

Hardware-Efficient Error Mitigation and Shot-Efficient Sampling on IBM Quantum Hardware

Sumit Chongder

We experimentally study error mitigation and finite-shot sampling on superconducting quantum hardware under a constrained execution budget. The study combines calibration-aware qubit selection, circuit-depth scaling, zero-noise extrapolation, dynamical decoupling, readout-error mitigation, and repeated-shot estimation on an IBM Quantum processor. Experiments are organized across ideal simulation, noise-model simulation, and physical-device execution to separate sampling uncertainty from device-induced error. We investigate how mitigation performance changes with circuit depth, effective noise scale, qubit connectivity, and measurement budget, and quantify accuracy using expectation-value error, mean-squared error, statistical uncertainty, and mitigation gain. A fixed hardware-execution budget is used to evaluate shot allocation strategies and repeated measurements without relying on unlimited sampling. The resulting analysis provides a hardware-aware characterization of when mitigation improves expectation-value estimation and when finite-shot fluctuations offset the benefit of additional mitigation overhead. The implementation uses contemporary Qiskit and IBM Quantum Runtime workflows and is designed to provide reproducible experimental evidence for error-mitigation studies on current quantum processors.

quant-pharXiv:2608.28535•Aug 31, 2026•0 citations

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

Noise-regularized training of quantum circuit Born machines under a finite shot budget

Hoang M. Ngo, Quan Nguyen, Jung Taek Seo +2 more

Quantum circuit Born machines (QCBMs) can learn distributions that are hard to sample from classically, but their value depends on generalizing from finite training data. Here, we study how hardware noise affects this generalization. We show that, for any noise process, the generalization gap of a QCBM trained with the maximum mean discrepancy is bounded by the complexity of the distributions the noisy model can reach. Scrambled local Pauli noise contracts this complexity but biases the model towards the uniform distribution, so residual noise acts as a regularizer whose optimal strength can be intermediate. We propose GENIE, a framework that realizes a chosen noise level with capped error mitigation and selects it during training from held-out data within a fixed execution budget, with provably bounded regret. In simulations on synthetic and census data, GENIE stays close to the best of four noise-control strategies, whereas every fixed noise level falls short in many settings.

arXiv:2611.06630•Nov 4, 2026•0 citations

Generative Learning for Quantum Measurement Design

Jun Dai, Olivier Nahman-Lévesque, Guillaume Rabusseau +2 more

Extracting quantum information from a quantum state is a fundamental task of quantum computation, often requiring the estimation of many non-commuting observables under a finite measurement budget. For both near-term and early fault-tolerant settings, the measurement protocol must balance statistical efficiency against implementation resources such as circuit depth, connectivity, and entangling-gate count. Many existing strategies focus on two extremes: hardware-friendly product measurements with high sampling cost, and fully commuting measurements with deep circuits. Here we recast resource-constrained measurement design as a generative learning problem. We introduce FlowMeas, which uses a generative flow network to directly sample finite ensembles of shallow Clifford measurement circuits subject to a prescribed shot budget and hardware constraints. At zero entangling depth, FlowMeas learns qubit-wise commuting measurement schedules and already matches or improves leading product-measurement methods on nearly all molecular benchmarks. Allowing one or two entangling gate layers yields further reductions in energy estimation error of up to $27\%$ relative to the strongest state-independent product-measurement baseline. The learned policy can also be reused across related Hamiltonians, substantially accelerating retraining along a molecular potential-energy surface. We further obtain results for molecular Hamiltonians with up to 20 qubits and apply the framework to a compactly encoded 54-qubit interacting fermionic model, extending the demonstrated scale beyond prior molecular benchmarks. These results establish generative learning as a flexible and unified framework for quantum measurement design under practical resource constraints.

quant-pharXiv:2608.11396•Aug 13, 2026•0 citations
On near-term quantum hardware, estimating a Born probability requires repeated circuit executions. A quantum learning experiment with a fixed measurement budget BBB must therefore decide how many distinct training states nnn to use and how many shots SSS to allocate to each state. We study this tradeoff for binary quantum classifiers with fixed or independently selected measurement operators MMM, where the ideal score is Tr(Mρ)Tr(M\rho)Tr(Mρ). We prove a distribution-free generalization bound that separates the finite-sample and finite-shot contributions. The sample term scales as d/n\sqrt{d/n}d/n​, while the shot term scales as (log⁡n)/S\sqrt{(\log n)/S}(logn)/S​; under the constraint B=nSB=nSB=nS, these two terms move in opposite directions. Minimising a conservative closed-form surrogate of the bound gives the allocation rule n∗=22dB/log⁡(2B/δ)n^{*} = 2\sqrt{2dB/\log(2B/\delta)}n∗=22dB/log(2B/δ)​ and S∗=B/nstarS^{*} = B/nstarS∗=B/nstar. This surrogate has the same asymptotic scaling as the exact minimizer and yields a worst-case rate of B−1/4B^{-1/4}B−1/4. The guarantee is intentionally conservative, since it applies to the full class of binary quantum measurements. We complement the theory with PennyLane simulations using 2-qubit and 4-qubit variational quantum circuits on nine synthetic binary classification benchmarks. In all tested configurations, the one-sided empirical generalization gap remains below the theoretical bound. The result provides a conservative statistical guideline for allocating measurement budgets in finite-shot evaluation and pre-experimental planning for near-term quantum learning systems, complementing hardware-level scheduling and circuit-design considerations. Extending the guarantee to fully adaptive shot-noisy training remains an open problem.
Statistical learning theory provides the mathematical foundations for understanding generalization from finite data. As quantum computing and quantum machine learning continue to develop, there is increasing interest in whether analogous principles can be formulated for learning settings involving quantum data, quantum models, or quantum computation. This paper offers an introductory perspective on quantum statistical learning theory. We begin by recalling the basic ideas of classical statistical learning theory, including empirical risk minimization, hypothesis classes, generalization, and sample complexity, and then discuss how these concepts must be adapted in the quantum setting. In particular, we distinguish between learning with classical data using quantum algorithms, learning with quantum models, and learning directly from quantum data. We then develop a resource-sensitive description that separates population risk, ideal empirical risk, and finite-shot empirical risk. This distinction makes explicit the different roles of training sample size and measurement budget. For a binary measurement-based classifier, we derive a finite-shot condition relating the required measurement budget to the sample size, confidence level, and classification margin. We further discuss how finite-sample generalization, finite-measurement estimation, and hardware imperfections can be represented as distinct contributions to experimentally observed learning performance. We conclude with a discussion of open problems and directions toward a more unified theory of generalization and learnability in quantum learning.
Estimating an N×NN \times NN×N quantum kernel from circuit fidelities requires Θ(N2S)Θ(N^2 S)Θ(N2S) 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. \textbf{First, a complete regime decomposition} for shot-budgeted quantum kernel learning: a principled menu of when each allocator wins. Our method, \emph{AQKA}, dominates the budget-limited regime (B≲16npairsB \lesssim 16 n_{\mathrm{pairs}}B≲16npairs​) on sparse-sensitivity KRR, with the gap \emph{growing} from +8+8+8 to +25+25+25 pts over uniform as NNN scales 225→1000225{\to}1000225→1000 and reaching +26+26+26--323232 pts on an \texttt{ibm\_pittsburgh} (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. \textbf{Second, a closed-form pair-level acquisition theory}: sij⋆∝∣gij∣Kij(1−Kij)s_{ij}^{\star} \propto |g_{ij}|\sqrt{K_{ij}(1-K_{ij})}sij⋆​∝∣gij​∣Kij​(1−Kij​)​ with explicit gradient gijg_{ij}gij​ for KRR (Lemma~1, ∣βiαj+βjαi∣Kij(1−Kij)|β_iα_j+β_jα_i|\sqrt{K_{ij}(1-K_{ij})}∣βi​αj​+βj​αi​∣Kij​(1−Kij​)​) and SVM via the envelope theorem (∣ηi∗ηj∗∣Kij(1−Kij)|η_i^*η_j^*|\sqrt{K_{ij}(1-K_{ij})}∣ηi∗​ηj∗​∣Kij​(1−Kij​)​); a \emph{corrected} sparsity-aware Cauchy--Schwarz rate ρ≤2m/Nρ\le 2m/Nρ≤2m/N matching empirics (vs.\ the naive m2/N2m^2/N^2m2/N2); an explicit-constant plug-in regret bound (Theorem~2); and a tighter SVM ceiling ρSVM≤msv2/N2ρ^{\mathrm{SVM}} \le m_{\mathrm{sv}}^2/N^2ρSVM≤msv2​/N2. We close with the first multi-seed live online adaptive shot allocation on quantum hardware: +17.0±4.8+17.0 \pm 4.8+17.0±4.8 pts at N=20N{=}20N=20 on \texttt{ibm\_aachen} (3.5σ3.5σ3.5σ, 5 seeds), with the advantage holding at N=30N{=}30N=30 at higher budget on \texttt{ibm\_berlin} (+14.0±8.5+14.0 \pm 8.5+14.0±8.5 pts, 5 seeds).
We experimentally study error mitigation and finite-shot sampling on superconducting quantum hardware under a constrained execution budget. The study combines calibration-aware qubit selection, circuit-depth scaling, zero-noise extrapolation, dynamical decoupling, readout-error mitigation, and repeated-shot estimation on an IBM Quantum processor. Experiments are organized across ideal simulation, noise-model simulation, and physical-device execution to separate sampling uncertainty from device-induced error. We investigate how mitigation performance changes with circuit depth, effective noise scale, qubit connectivity, and measurement budget, and quantify accuracy using expectation-value error, mean-squared error, statistical uncertainty, and mitigation gain. A fixed hardware-execution budget is used to evaluate shot allocation strategies and repeated measurements without relying on unlimited sampling. The resulting analysis provides a hardware-aware characterization of when mitigation improves expectation-value estimation and when finite-shot fluctuations offset the benefit of additional mitigation overhead. The implementation uses contemporary Qiskit and IBM Quantum Runtime workflows and is designed to provide reproducible experimental evidence for error-mitigation studies on current quantum processors.
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.
Quantum circuit Born machines (QCBMs) can learn distributions that are hard to sample from classically, but their value depends on generalizing from finite training data. Here, we study how hardware noise affects this generalization. We show that, for any noise process, the generalization gap of a QCBM trained with the maximum mean discrepancy is bounded by the complexity of the distributions the noisy model can reach. Scrambled local Pauli noise contracts this complexity but biases the model towards the uniform distribution, so residual noise acts as a regularizer whose optimal strength can be intermediate. We propose GENIE, a framework that realizes a chosen noise level with capped error mitigation and selects it during training from held-out data within a fixed execution budget, with provably bounded regret. In simulations on synthetic and census data, GENIE stays close to the best of four noise-control strategies, whereas every fixed noise level falls short in many settings.
Extracting quantum information from a quantum state is a fundamental task of quantum computation, often requiring the estimation of many non-commuting observables under a finite measurement budget. For both near-term and early fault-tolerant settings, the measurement protocol must balance statistical efficiency against implementation resources such as circuit depth, connectivity, and entangling-gate count. Many existing strategies focus on two extremes: hardware-friendly product measurements with high sampling cost, and fully commuting measurements with deep circuits. Here we recast resource-constrained measurement design as a generative learning problem. We introduce FlowMeas, which uses a generative flow network to directly sample finite ensembles of shallow Clifford measurement circuits subject to a prescribed shot budget and hardware constraints. At zero entangling depth, FlowMeas learns qubit-wise commuting measurement schedules and already matches or improves leading product-measurement methods on nearly all molecular benchmarks. Allowing one or two entangling gate layers yields further reductions in energy estimation error of up to 27%27\%27% relative to the strongest state-independent product-measurement baseline. The learned policy can also be reused across related Hamiltonians, substantially accelerating retraining along a molecular potential-energy surface. We further obtain results for molecular Hamiltonians with up to 20 qubits and apply the framework to a compactly encoded 54-qubit interacting fermionic model, extending the demonstrated scale beyond prior molecular benchmarks. These results establish generative learning as a flexible and unified framework for quantum measurement design under practical resource constraints.