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.
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.
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.
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 computing offers exponential computational advantages across diverse application domains, yet the inherent probabilistic nature of quantum measurements poses challenges for program testing. Existing quantum black-box testing approaches rely on ad-hoc tolerance checks applied to empirical probability distributions estimated from large measurement samples, often requiring a large number of measurements, because of lacking formal Type I error control, power guarantees, or principled sample size determination. We present a statistical hypothesis-testing method for quantum program testing, encompassing two paradigms: marginal probability testing and joint distribution testing over the full2d-dimensional state space. By combining exact and asymptotic tests, bootstrap procedures, sequential designs, and kernel-based two-sample testing, our method provides rigorous error control with substantially improved sample efficiency. Experiments on quantum programs with 2 to 12 qubits show measurement reductions from 97 to 99 percent over the conventional practice of ten thousand shots against strong synthetic faults. A structural mutation study separates the faults that every test detects at one hundred measurements from those that no measurement-based test can detect. The exact marginal test, the exact branch of the sequential design, and the permutation-calibrated joint tests control the Type I error rate at or below the nominal level of 0.05. The adaptive chi-square branch is mildly anticonservative on random states, with a median of 0.060, and conservative on the named benchmarks. On QFT, the sequential design rejects a faulty program with 32 to 85 percent fewer measurements than a properly powered fixed-sample test at two to twelve qubits on its adaptive branch, and with 19 to 60 percent fewer on its exact branch, which is valid under any dependence and reaches the target power from four qubits upward. Power exceeds 0.80 above a characterized fault strength, and faults that preserve the output distribution are shown to be undetectable by any measurement-based test. These results establish a principled and practical foundation for quantum program testing.
This paper investigates the application of Bayesian inference for optimizing quantum measurement schemes. Traditional quantum measurement strategies often rely on heuristic approaches or specific system constraints, potentially leading to suboptimal outcomes. We propose a framework where the quantum measurement process is modeled as a Bayesian inference problem. This allows us to systematically explore the measurement landscape, incorporating prior knowledge and iteratively refining the measurement strategy based on observed outcomes. The core of this approach lies in formulating the measurement problem as a probabilistic model and utilizing Bayesian updating to determine the optimal measurement basis or parameters. We demonstrate, through theoretical analysis and conceptual design, that Bayesian optimization can lead to improved measurement accuracy and efficiency compared to conventional methods. The key benefits include reduced measurement errors, enhanced signal-to-noise ratios, and potentially the ability to extract more information from quantum systems. This work presents a novel methodology for quantum measurement, bridging the gap between classical Bayesian optimization and the unique properties of quantum mechanics.
Abstract Near-term demonstrations of HHL-type quantum linear-system solvers require implementations that make spectral assumptions, post-selection costs, and hardware-induced errors explicit. This is particularly important for small hardware experiments, where finite-shot sampling, phase-estimation resolution, and multi-controlled-gate overhead can dominate the observed performance. A hardware-executable HHL benchmark pipeline for Hermitian linear systems is presented and evaluated on small positive-definite and indefinite benchmark instances. By fixing the complete end-to-end workflow, including sign-aware handling of indefinite spectra and post-selected diagnostic readout, the pipeline provides a reproducible basis for comparing ideal simulation, backend-calibrated noisy simulation, and selected IBM Quantum hardware executions. The benchmark instances are organized into amplitude-resolvability classes, indexed by a threshold factor τ, enabling finite-shot sampling effects to be compared across increasingly well-resolved instance families. Experiments on 8×8 positive-definite and indefinite nonsingular systems show close agreement across ideal simulator backends. Within the constructed benchmark family, more restrictive resolvability classes yield lower reference-sign-assisted diagnostic vector errors. Indefinite instances are more noise-sensitive because sign-aware handling introduces additional controlled phase operations and reduces the effective phase resolution available within each sign sector. Selected IBM Quantum hardware runs show end-to-end executability and broad consistency with backend-calibrated noisy simulation in the reference-sign-assisted diagnostic vector error. However, for these selected runs, the noisy simulator systematically overestimates the number of shots that survive ancilla post-selection, revealing a limitation of calibrated noise models for predicting the usable sampling budget of deep HHL circuits. Overall, the results provide a reproducible baseline for evaluating resource--accuracy trade-offs in near-term HHL-type routines. They also support the view that such routines are most naturally used as subroutines for estimating task-relevant quantities from ∣x⟩, rather than as standalone tools for full vector reconstruction.
Abstract Classical-to-quantum workload migration is not a direct code-translation task because theoretical speedup, reversible mapping, circuit resources, device noise, compilation, queueing, and classical--quantum orchestration must be considered together. This work presents CQ-Migrate, a structured decision framework for determining whether a workload should remain classical, be decomposed into a hybrid workflow, or be evaluated on a quantum processing unit. Grover search is used as an empirical case study. A true two-qubit Grover circuit was validated locally, executed on the Quantum Inspire QX emulator, and then evaluated on the 17-qubit Tuna-17 superconducting processor. Four marked states were tested with five independent hardware runs per state and 1024 shots per run, totaling 20,480 hardware shots. The emulator returned the marked state in 100% of 4096 shots. Tuna-17 produced 19,076 correct measurements, corresponding to an aggregate success probability of 93.14% (95% Wilson interval: 92.79--93.48%). State-wise mean success ranged from 91.82% to 94.30%; run-level differences across marked states were statistically detectable (one-way ANOVA (F=5.99), (p=0.0062); Kruskal--Wallis (H=10.88), (p=0.0124)). The study also reports complete provider job provenance and reinterprets earlier archived IBM executions as a backend-variability control rather than a Grover validation. The results support evidence-driven, hardware-aware migration decisions without claiming practical quantum speedup for the small instance studied.