Bayesian Sequential Verification for Budget-Aware Quantum Program Testing
Lei Zhang

TL;DR
This paper introduces a Bayesian sequential verification method for quantum programs that reduces measurement costs and is suitable for noisy hardware, enabling more efficient and reliable testing.
Contribution
It formulates a budget-aware, reference-based Bayesian hypothesis testing workflow for quantum program verification, improving efficiency over fixed-budget methods.
Findings
Bayesian sequential verification reduces measurement costs significantly.
The approach is effective on both Bell-state and QAOA-MaxCut workloads.
Results demonstrate practical applicability for quantum hardware testing.
Abstract
Quantum programs often produce probability distributions rather than deterministic outputs, making verification inherently statistical and increasingly costly on real hardware. In practice, developers still frequently rely on testing with fixed shot budgets on simulators, which are simple but time-consuming and poorly suited to noisy backends. What is missing is a verification approach that is both statistically explicit and budget-aware. This paper formulates Bayesian sequential verification as a reference-based Bayesian hypothesis testing workflow in which priors are derived from explicit reference sources, such as finite-shot reference runs or ideal/statevector-based computation, and verification decisions are updated batch by batch as measurement evidence accumulates. This approach is evaluated in Qiskit on two complementary workloads: Bell-state and QAOA-MaxCut. Across both…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
