Bayesian Sequential Verification for Budget-Aware Quantum Program Testing

• URL: http://arxiv.org/abs/2605.15601v1
• Date: Fri, 15 May 2026 04:21:08 GMT
• Title: Bayesian Sequential Verification for Budget-Aware Quantum Program Testing
• Abstract summary: This paper formulates Bayesian sequential verification as a reference-based hypothesis testing workflow.<n>It is evaluated in Qiskit on two complementary workloads: Bell-state and QAOA-MaxCut.
• Score: 5.589961715298686
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• 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 case studies, the results show that Bayesian sequential verification can substantially reduce measurement costs compared to fixed-budget baselines when the success probability of the program exceeds the target threshold. The findings position Bayesian sequential verification as a practical verification workflow for quantum programs. The approach provides a foundation for future quantum continuous-integration pipelines that require reliable, budget-aware pass/fail decisions and motivates validation on real quantum hardware.

Related papers

• Certifying Adversarial Robustness of Quantum Classifiers under Known-Readout Query Access [6.902322288643561]
  A quantum classifier assigns labels by evolving an input quantum state and measuring the output, so repeated executions reveal only a distribution over labels.<n>We give a measurement-only framework that returns two complementary guarantees for each input.<n>From 40 executions of two 8-qubit quantum neural networks, our method estimates both bounds, with the expected lower-upper ordering on every tested input.
  arXiv  Detail & Related papers  (2026-09-10T14:45:21Z)
• Verifiable blind probabilistic error cancellation [5.1287945894217355]
  Quantum error mitigation (QEM) is an essential tool for mitigating hardware noise without incurring space overhead.<n>We introduce verifiable blind probabilistic error cancellation (VBPEC), the first secure verification protocol against a fully malicious adversary.<n>VBPEC performs PEC with perfect blindness and an exponentially small security error.
  arXiv  Detail & Related papers  (2026-07-28T13:27:08Z)
• Bayesian control for coding agents [63.64172141184361]
  We propose a cost-sensitive sequential hypothesis testing framework for coding agents.<n>A Bayesian controller maintains a belief over correctness and decides whether to gather more evidence, refine the candidate, verify it, or stop.<n>We show that the belief state yields an interpretable correctness score that outperforms token-probability and raw tool-success baselines for uncertainty quantification.
  arXiv  Detail & Related papers  (2026-06-23T11:41:32Z)
• LiveFMBench: Unveiling the Power and Limits of Agentic Workflows in Specification Generation [75.05397479715576]
  Large language models (LLMs) and agents have shown promising progress, but their true capabilities and failure modes remain unclear.<n>We present the first systematic and contamination-aware study of LLM- and agent-based formal specification generation for C programs.
  arXiv  Detail & Related papers  (2026-05-02T11:31:33Z)
• The 4/$δ$ Bound: Designing Predictable LLM-Verifier Systems for Formal Method Guarantee [5.345468714252351]
  This work bridges the gap by developing an LLM-Verifier Convergence Theorem.<n>We model the interaction between the LLM and the verifier as a discrete-time Markov Chain.<n>We stress-tested this prediction in an extensive empirical campaign comprising more than 90,000 trials.
  arXiv  Detail & Related papers  (2025-11-30T22:19:09Z)
• The Cost of Certainty: Shot Budgets in Quantum Program Testing [0.0]
  This paper develops a unified framework for reasoning about how many measurements are required to verify quantum programs.<n>We analyze the relationship between error probability, fidelity, trace distance, and the quantum Chernoff bound to establish fundamental shot count limits.<n>It provides practical guidance for budgeting measurement shots in quantum program testing, helping practitioners balance rigour against cost when designing verification strategies.
  arXiv  Detail & Related papers  (2025-10-25T19:34:16Z)
• Efficient Fidelity Estimation with Few Local Pauli Measurements [3.428706362109922]
  We develop a protocol for quantifying how close an experimental state aligns with a target.<n>We analyze the bias in this estimator, linking its performance to the mixing time $tau$ of a Markov chain induced by the target state.<n>This work enables scalable benchmarking, error characterization, and tomography assistance.
  arXiv  Detail & Related papers  (2025-10-09T12:35:58Z)
• COIN: Uncertainty-Guarding Selective Question Answering for Foundation Models with Provable Risk Guarantees [51.5976496056012]
  COIN is an uncertainty-guarding selection framework that calibrates statistically valid thresholds to filter a single generated answer per question.<n>COIN estimates the empirical error rate on a calibration set and applies confidence interval methods to establish a high-probability upper bound on the true error rate.<n>We demonstrate COIN's robustness in risk control, strong test-time power in retaining admissible answers, and predictive efficiency under limited calibration data.
  arXiv  Detail & Related papers  (2025-06-25T07:04:49Z)
• Quantum Fidelity Estimation in the Resource Theory of Nonstabilizerness [11.386506926570442]
  fidelity estimation is essential for benchmarking quantum states and processes on noisy quantum devices.<n>We propose several efficient protocols for both quantum states and channels within the resource theory of nonstabilizerness.
  arXiv  Detail & Related papers  (2025-06-15T18:51:09Z)
• Verifying a stabilizer state with few observables but many shots [0.0]
  We propose a quantum-state-certification protocol for stabilizer states, motivated by application in in-situ testing of NISQ-era quantum computer systems.<n>We provide mathematically rigorous analysis of the false-negative and false-positive rates.
  arXiv  Detail & Related papers  (2024-12-21T16:31:49Z)
• Bayesian Quantum Amplitude Estimation [46.03321798937855]
  We present BAE, a problem-tailored and noise-aware Bayesian algorithm for quantum amplitude estimation.<n>In a fault tolerant scenario, BAE is capable of saturating the Heisenberg limit; if device noise is present, BAE can dynamically characterize it and self-adapt.<n>We propose a benchmark for amplitude estimation algorithms and use it to test BAE against other approaches.
  arXiv  Detail & Related papers  (2024-12-05T18:09:41Z)
• SMURF-THP: Score Matching-based UnceRtainty quantiFication for Transformer Hawkes Process [76.98721879039559]
  We propose SMURF-THP, a score-based method for learning Transformer Hawkes process and quantifying prediction uncertainty. Specifically, SMURF-THP learns the score function of events' arrival time based on a score-matching objective. We conduct extensive experiments in both event type prediction and uncertainty quantification of arrival time.
  arXiv  Detail & Related papers  (2023-10-25T03:33:45Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• Sample-efficient device-independent quantum state verification and certification [68.8204255655161]
  Authentication of quantum sources is a crucial task in building reliable and efficient protocols for quantum-information processing. We develop a systematic approach to device-independent verification of quantum states free of IID assumptions in the finite copy regime. We show that device-independent verification can be performed with optimal sample efficiency.
  arXiv  Detail & Related papers  (2021-05-12T17:48:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.