← 研踪 PaperTrailarXiv:2608.24891 · v2
Measurement-Budget Allocation in Quantum Learning with Finite-Shot Generalization Guarantees
首次提交 2026-06-01 21:43
版本更新 2026-11-19 20:14
雷达观测 2026-11-20 16:53
摘要
On near-term quantum hardware, estimating a Born probability requires repeated circuit executions. A quantum learning experiment with a fixed measurement budget must therefore decide how many distinct training states to use and how many shots to spend on each. We study this trade-off for binary quantum classifiers whose measurement operator is learned from the training data and evaluated with fresh measurement outcomes. We prove a distribution-free generalization bound for bounded, -Lipschitz losses with a sample term of order and a shot term of order ; under the two terms move in opposite directions. Minimizing a closed-form surrogate of the bound gives the allocation rule , , whose bound value is within 0.1% of the exact numerical minimum on all budgets we evaluate, and a worst-case rate of . PennyLane simulations with 2- and 4-qubit variational circuits on nine synthetic benchmarks show that the empirical gap stays below the bound in all configurations, although the bound is vacuous at the simulated budgets and becomes non-vacuous only for larger budgets (e.g., for ). For a loss that is concave in the score, the empirical gap is U-shaped under a fixed budget and the measured shot contribution matches its analytical value; for the absolute loss, shot noise is unbiased and no shot-limited regime appears. The rule can be used to plan finite-shot evaluations before an experiment is run.
作者备注:28 pages, 7 figures, 9 tables. v2: revised version; adds a fixed-budget experiment with a concave loss showing the U-shaped trade-off, an analysis of the sources of conservatism, a comparison with the exact numerical minimizer, and corrected logarithmic constants. Code and data: https://github.com/ocatak/quantum-measurement-budget-allocation
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v2 · 2026-11-19 20:14 · 最新观测版本
Measurement-Budget Allocation in Quantum Learning with Finite-Shot Generalization Guarantees
On near-term quantum hardware, estimating a Born probability requires repeated circuit executions. A quantum learning experiment with a fixed measurement budget must therefore decide how many distinct training states to use and how many shots to spend on each. We study this trade-off for binary quantum classifiers whose measurement operator is learned from the training data and evaluated with fresh measurement outcomes. We prove a distribution-free generalization bound for bounded, -Lipschitz losses with a sample term of order and a shot term of order ; under the two terms move in opposite directions. Minimizing a closed-form surrogate of the bound gives the allocation rule , , whose bound value is within 0.1% of the exact numerical minimum on all budgets we evaluate, and a worst-case rate of . PennyLane simulations with 2- and 4-qubit variational circuits on nine synthetic benchmarks show that the empirical gap stays below the bound in all configurations, although the bound is vacuous at the simulated budgets and becomes non-vacuous only for larger budgets (e.g., for ). For a loss that is concave in the score, the empirical gap is U-shaped under a fixed budget and the measured shot contribution matches its analytical value; for the absolute loss, shot noise is unbiased and no shot-limited regime appears. The rule can be used to plan finite-shot evaluations before an experiment is run.
查看此版本解读 →查看此版本原文 ↗