Empirical quantum-software papers often claim that one compiler produces smaller circuits, one optimizer is more reliable, or one ansatz achieves better solution quality. Such comparisons depend on benchmark scope, circuit construction, compilation, sampling, backends, noise models, optimizer choices, and resource budgets. Existing testing, benchmarking, and reproducibility methods help assess programs and experiments but do not directly audit whether the reported comparison is supported by the evidence available in the paper and artifact. We present CLAIMSTAB-QC, a source-bounded framework that records baselines, metric, relation, and admissible evidence; locks the audit design before outcomes are computed; and reports a scoped relation outcome or an explicit evidence boundary. Strict scalar-directional comparisons are classified as Sustained, Unresolved, or Not preserved within the locked audit scope. We examine 455 comparative claims from 119 quantum-software papers. A materialization gap emerges: 175 claims can be represented for audit planning, 79 become scalar-directional planning records, and 53 yield lockable audit or diagnostic designs, but only 8 expose enough matched evidence to audit the original comparison without proxy reconstruction. Among these 8, 2 are Sustained, 4 Unresolved, and 2 Not preserved. Controlled diagnostics over 24 benchmark-relevant quantum-workload comparisons further show that simpler checks can preserve apparent directions despite weaker support under locked designs. These results indicate that performance orderings should be reported with matched evidence sufficient to audit their stated scope.
Empirical quantum-software papers often claim that one compiler produces smaller circuits, one optimizer is more reliable, or one ansatz achieves better solution quality. Such comparisons depend on benchmark scope, circuit construction, compilation, sampling, backends, noise models, optimizer choices, and resource budgets. Existing testing, benchmarking, and reproducibility methods help assess programs and experiments but do not directly audit whether the reported comparison is supported by the evidence available in the paper and artifact. We present CLAIMSTAB-QC, a source-bounded framework that records baselines, metric, relation, and admissible evidence; locks the audit design before outcomes are computed; and reports a scoped relation outcome or an explicit evidence boundary. Strict scalar-directional comparisons are classified as Sustained, Unresolved, or Not preserved within the locked audit scope. We examine 455 comparative claims from 119 quantum-software papers. A materialization gap emerges: 175 claims can be represented for audit planning, 79 become scalar-directional planning records, and 53 yield lockable audit or diagnostic designs, but only 8 expose enough matched evidence to audit the original comparison without proxy reconstruction. Among these 8, 2 are Sustained, 4 Unresolved, and 2 Not preserved. Controlled diagnostics over 24 benchmark-relevant quantum-workload comparisons further show that simpler checks can preserve apparent directions despite weaker support under locked designs. These results indicate that performance orderings should be reported with matched evidence sufficient to audit their stated scope.
Quantum compiler assurance requires a semantic relation that matches the intended use and observations that can expose violations at the delivered interface. This critical integrative survey compares verified transformations, equivalence checking, differential and metamorphic testing, property-based testing, and evidence for assurance across revisions. A source catalogue and focused extraction matrix distinguish formal guarantees, reported empirical findings, analytical deductions, and proposed practice. A recorded coverage update and source-level selection decisions make the review auditable within its declared scope. Four documented failure cases connect conditional applicability, parameter association, termination, and phase conventions to method selection. A worked example involving layout metadata, parameter bindings, and ancillary qubits demonstrates why validating a circuit under a reconstructed interpretation can leave the delivered interface unchecked. An illustrative revision scenario then separates fault detection from change attribution. The resulting guidance specifies applicability, complementary observations, and treatment of inconclusive outcomes. Published bug counts, mutation results, and processing benchmarks support different claims and do not establish a common effectiveness ranking. The proposed regression architecture remains unevaluated as a complete system; its practical value requires controlled comparisons on independently adjudicated compiler-change events.
Quantum software relies on compilers, intermediate representations, and execution frameworks that transform programs before execution. Faults in these components can change the behavior of otherwise correct quantum programs. Yet quantum testing techniques are often evaluated using mutation-generated faults and curated bug benchmarks. We investigate how well the faults represented by these artifacts reflect those encountered in modern quantum software. We audit four quantum mutation-testing tools and three curated bug benchmarks, and collect 410 verified bugs from ten quantum software repositories over two years. We classify faults from all three sources into a common taxonomy of 56 bug families and compare their representation across mutation operators, curated benchmarks, and recent real-world bugs. The mutation tools support 20 bug families, and curated benchmarks add 15 more. Yet only 56 of the 410 real-world bugs (13.7%) belong to families represented by either source; the remaining 354 (86.3%) belong to families absent from both. The largest unrepresented families concern compiler transformations (66 bugs), type handling (53), and input validation (47). Unlike local gate or statement changes, these faults often depend on intermediate representations, compiler pipelines, input types, or dependency versions. Existing mutation operators primarily modify circuits and program constructs, whereas many real-world faults arise in the compilers, representations, and framework interfaces that process them. Addressing this gap requires looking beyond circuit-level faults toward testing semantic preservation across compiler transformations, correctness at representation boundaries, and interactions between software components. Our study provides empirical evidence to guide fault models and benchmarks that capture these mechanisms and preserve the contexts needed to reproduce them.
This record contains a manuscript and supporting reproducibility materials for “Ledger-Valid Recovery Diagnostics for Quantum Computing: A Prespecified Sequential Audit for Claim-Limited Recovery Validation.” The paper proposes a methodological validation framework for quantum-computing recovery claims. Its central claim is that endpoint recovery success is necessary but not sufficient for a strong recovery claim when calibration failure, false-carrier acceptance, postselection artifacts, leakage, sentinel blindness, or hidden discard can carry failure modes out of view. The manuscript introduces a prespecified S0–S4 ledger audit that converts familiar diagnostic ingredients—label calibration, candidate recovery, false-carrier challenge tests, postselection/leakage accounting, and sentinel observability—into an ordered, claim-limiting taxonomy. A supportive recovery claim is permitted only when all required gates pass; otherwise, the first failed stage determines a lower claim ceiling and an interpretable failure class. The evaluation is based on synthetic endpoint-level validation suites rather than circuit-level simulation or hardware data. These suites test the behavior of the decision architecture under clean support, degraded observability, false-carrier artifacts, postselection/leakage artifacts, sentinel-blind cases, correlated artifacts, and adversarial overlap. The results show a strong specificity/sensitivity tradeoff: the full ledger protocol sharply reduces synthetic non-support supportive-call rates relative to endpoint-only reporting, but with substantial loss of mechanism-positive support sensitivity. The paper explicitly treats this as a conservative claim-validity architecture, not as a new quantum error-correcting code, new physical observable, hardware speedup, or proof of improved device performance. The supporting materials document the final synthetic validation protocol, endpoint definitions, decision-bound implementation, direction-aware threshold sensitivity analysis, latent-threshold eligibility analysis, mechanism-negative/latent-eligible boundary cases, and figure/table traceability. The archive is intended to support review of the manuscript’s aggregate numerical claims and methodological provenance. Hardware implementation, independent simulator validation, and full raw-event-ledger reproduction are identified as future extensions. Suggested keywords: quantum computing; quantum error correction; validation methodology; recovery diagnostics; leakage; postselection; benchmarking; synthetic validation; decision architecture; reproducibility.
Empirical scaling laws for the Quantum Approximate Optimization Algorithm (QAOA) on near-term hardware are often motivated by noise-compounding arguments or circuit-structure heuristics. Such models are rarely evaluated under pre-specified failure criteria that prevent post-hoc rescue. This study reports an audit-disciplined attempt to construct and test a predictive scaling law for QAOA-based minimal cut set recovery in fault tree models. The workflow used hash-locked artifacts, pre-specified kill switches, one-time holdout evaluation, and explicit no-rerun and no-rescue rules at every phase boundary. The initial F²-grounded compounding specification failed its pre-specified identifiability gate (KS3). Under an anti-leakage filter applied to 108 candidate rescue terms, zero candidates recovered a passing α₁ slope while also adding explanatory power above the structural baseline. A pre-specified structure-dominated fallback model was then defined and fit. The fallback reproduced its locked training prediction pathway to machine precision, with maximum absolute prediction difference of 3.55 × 10⁻¹⁵. It then failed the locked 24-row transport holdout. Holdout RMSE was 5.2214 against a locked threshold of 0.3770, and all 24 residuals were positive, giving a two-sided sign-test p-value of 1.19 × 10⁻⁷. The mean log residual of 5.198 corresponds to approximately 180-fold underprediction on the linear scale. Post-failure diagnostics indicated lower-n domain shift with standardized mean difference of −2.27 and four holdout rows with G_2q below the training range. By design, these diagnostics were explanatory only and did not authorize rescue, refit, reweighting, row removal, or threshold revision. The results do not support a deployable scaling law on the present corpus. Instead, they demonstrate that pre-specified audit controls can convert an attempted positive scaling-law claim into a reproducible falsification result with clear claim boundaries. The audit framework, the locked failure chain, and the allowed-and-forbidden claim boundary together constitute the paper's contribution. The work is offered as a methodological reference for future QAOA-on-hardware scaling studies.
Quantum software testing (QST) checks whether quantum programs behave according to their intended specifications. A key requirement for QST research is a benchmark that supports rigorous empirical evaluation on programs that are testable and better reflect current software development practices. However, existing studies heavily rely on small hard-coded or circuit-level benchmarks, while available quantum programs are scattered across repositories without clear selection criteria, which limits fair comparison and systematic reproducibility. To this end, we present Qolumbina, a benchmark infrastructure for controlled QST experiments on scalable quantum programs. Qolumbina curates 40 programs from open-source repositories, turns them into test-ready subjects through systematic selection, refactoring, specifications, test case examples, unit tests, and standardized interfaces. We also propose QST-oriented criteria to characterize quantum programs along functionality, output behavior, development complexity, and quantum-specific execution complexity. Using these criteria, our empirical study shows that Qolumbina covers diverse testing-relevant properties and supports scalability analysis beyond fixed-size circuit benchmarks. Through controlled experiments with two recent QST approaches, we demonstrate the feasibility of using Qolumbina for execution-cost and fault-detection studies, and highlight backend-dependent effects that can influence QST result interpretation.
Quantum-control optimisation typically begins with calibration records assumed to remain applicable to the intended operation. Yet coherence, phase references, coupling, read-out response and subsystem interactions vary with time and operating context. Local calibration success may therefore be insuffi- cient to justify joint or changed-context control, allowing optimisation to pursue candidates founded on stale, incomplete or inapplicable evidence. We propose an evidence-governed admissibility framework that checks evidence role, scope, freshness, provenance and composition authority before constructing control candidates. Its computational layers have distinct functions: Layer 1 classifies routes as Permit, Withhold or Revalidate, retaining auditable native states and reasons; Layer 2A constructs and screens reduced-model candidates only for permitted routes; and Layer 2B checks applicable end-to-end workflows. Synthetic integration and authority-ablation tests demonstrate enforceable differences in permission, and the implementation passed 150/150 core and 10/10 slew-specific tests. These are computational findings, not hardware validation. We also provide two complementary prospective experimental arms for evaluating practical benefit. Arm 1 (predictive lift) freezes assessments before hardware outcomes are known and tests whether they predict the performance of independently authorised ordinary-baseline operations better than calibration- or availability-only benchmarks. Arm 2 (constructive recovery) tests whether initially unsuitable cases can yield authorised alternative controls after evidence refresh or reconfirmation, a new Layer 1 decision and downstream construction, while preserving the original classification. We release code, schemas, guided workbooks, fixtures and prespecified protocols for independent pilots. Hardware validation could establish whether this approach reduces wasted searches and improves control reliability or qubit performance.