Quantum artificial-life (QAL) claims combine two demanding vocabularies. Artificial-life labels such as inheritance, mutation, interaction, turnover, and selection require population records and lineage controls. Quantum-resource labels such as coherence, entanglement, Bell nonlocality, and channel resources require resource diagnostics and resource-destroying controls. QALBench makes these claims independently auditable. It is a tiered benchmark suite and reference implementation that separates artificial-life adequacy, quantum-resource evidence, and computational nonclassicality. The reference results are deliberately diagnostic. Under matched seeds, basis-selection demographic, phenotype, and lineage summaries are identical for the quantum, dephased, and classical controls, excluding resource diagnostics. A software positive-control assay inserts a stored negativity-derived birth-event score into the reproduction rule and shows that resource-coupled reproduction is removed by dephasing or Markov controls. A no-inheritance resource control remains resource-positive but transmission-negative, establishing that resource-coupled reproduction and inherited resource-mediated artificial life are distinct claims. QALBench also supplies finite-shot certification and simulator-challenge submission workflows for external evidence. Its included reference packages exercise those workflows without asserting quantum advantage, loophole-free hardware certification, open-ended evolution, or persistent population-level entanglement.
Quantum artificial-life (QAL) claims combine two demanding vocabularies. Artificial-life labels such as inheritance, mutation, interaction, turnover, and selection require population records and lineage controls. Quantum-resource labels such as coherence, entanglement, Bell nonlocality, and channel resources require resource diagnostics and resource-destroying controls. QALBench makes these claims independently auditable. It is a tiered benchmark suite and reference implementation that separates artificial-life adequacy, quantum-resource evidence, and computational nonclassicality. The reference results are deliberately diagnostic. Under matched seeds, basis-selection demographic, phenotype, and lineage summaries are identical for the quantum, dephased, and classical controls, excluding resource diagnostics. A software positive-control assay inserts a stored negativity-derived birth-event score into the reproduction rule and shows that resource-coupled reproduction is removed by dephasing or Markov controls. A no-inheritance resource control remains resource-positive but transmission-negative, establishing that resource-coupled reproduction and inherited resource-mediated artificial life are distinct claims. QALBench also supplies finite-shot certification and simulator-challenge submission workflows for external evidence. Its included reference packages exercise those workflows without asserting quantum advantage, loophole-free hardware certification, open-ended evolution, or persistent population-level entanglement.
The Quantum Pi Benchmark (QPB) is a family of verification, search, counting, frequency-estimation, and collision tasks over the digits of Pi. It is designed as an architecture-neutral specification of mathematically fixed instances, classical comparators, resource boundaries, and admissible claims. The specification fixes zero-based indexing, binary and hexadecimal digit conventions, dense and sparse candidate domains, and task-specific payloads for target-bearing and collision problems. It separates three independent properties that benchmark descriptions can conflate: digit access (lookup or direct), oracle-construction provenance (P0–P4), and controller blindness (B0 or B1). A non-total capability grid retains codes R0–R12 as stable claim labels while stating their named dependencies; a higher-numbered code does not automatically inherit every lower-numbered capability. The evidence protocol requires pre-execution validation, routed-resource accounting, preservation of raw outcomes, outcome-independent eligibility, visible conditioning, uncertainty estimates, protocol separation, and formal record freezing. Collision scaling is stated as a heuristic candidate-domain model: birthday behavior gives D_h = Θ(16^(h/2)), while element distinctness gives O(D_h^(2/3)) coherent queries only under declared access and memory assumptions. These query bounds do not establish the earliest repeat, a quantum frontier, or end-to-end advantage. Frontier status depends on a current classical post-hoc resource audit; advantage requires a predeclared matched cost comparison that includes preparation, oracle construction, error correction, sampling, readout, and verification. The resulting framework classifies future Pi-derived experiments without importing device-specific performance into the foundational definition.
Version 6.1 develops the Quantum Correlations Stack into a complete multi-resource researcharchitecture.The framework integrates six principal resource families:1. quantum coherence;2. quantum discord;3. quantum steering;4. contextuality;5. entanglement;6. Bell nonlocality.Version 6.1 introduces and preserves a formal separation between:witness ̸= estimator ̸= certification ̸= selection ̸= application utility. (1)Each resource is represented by an estimated state, uncertainty, certification status, imple-mentation cost, latency, robustness, and application utility.A resource-state vector is defined asR = (RC , RD, RS, RV , RE, RB, uC , uD, uS, uV , uE, uB). (2)The selection problem is extended from scalar optimization to constrained multiobjectiveoptimization:R⋆ ∈ arg minR∈HcertF(R; A), (3) where Hcert contains only resources that pass preregistered certification criteria.The Pareto frontier is explicitly retained so that the architecture does not artificiallymanufacture a unique winner from an arbitrary weighting scheme.The framework additionally specifies:• resource certification;• witness-based evidence versus full resource estimation;• uncertainty propagation;• multiplicity control;• classical and quantum reference states;• resource-conversion accounting;• FMEA risk analysis;• Go/No-Go criteria;• configuration locking;• digital audit trails;• economic-cost separation;• independent reproduction;• computational reference implementation.No experimental result is claimed.
This paper reframes logical-qubit benchmarking from a scalar error-suppression problem into a branch-resolved logical-state maintenance problem. Conventional quantum error-correction reporting focuses on logical error rates, better-than-physical comparisons, code-distance scaling, decoder performance, and accepted-stream outcomes. These metrics are essential, but they do not by themselves reveal which stabilization mechanism produced the improvement, whether the result depends on active correction or detection-assisted filtering, how much acceptance overhead was paid, or which branches remain underdetermined because raw timing, reset, syndrome, leakage, or feed-forward records are unavailable. The central contribution is QHOME-RETROFIT, a branch-resolved diagnostic framework that operationalizes the Quantum-State Homeostasis condition of Paper 22 on published quantum error-correction records. The framework converts logical-state maintenance into normalized engineering margins, evidence-status labels, tiered verdicts, limiting-branch reports, and a reproducible CSV-first evaluation workflow. It separates restoration capacity, logical-basis sharpness, protected-mode occupation, source-sink coupling, logical gain, acceptance overhead, and repeated-round stability instead of collapsing them into a single logical-error-rate claim. QHOME-RETROFIT is not a new quantum processor, error-correcting code, decoder, or threshold theorem. It does not claim raw shot-level access where such records are not publicly available, and it does not treat detection-assisted post-selection as equivalent to full real-time source-sink closure. The core operating rule is: score only the branch supported by the released evidence, label what is weakly proxied, and leave underdetermined what the public record cannot decide. The manuscript is a systems-code and reproducibility-layer paper, not a hardware demonstration. It defines a diagnostic grammar, evidence classes, tier gates, reproducibility plans, raw-record replay boundaries, and package-level audit artifacts. Its companion package provides fixed CSV inputs, generated outputs, dashboards, tests, and manifest checks so that the branch verdicts can be inspected rather than accepted as prose claims. Before scaling claims about fault-tolerant quantum computing, this paper argues, researchers should test logical-state maintenance: whether a reported improvement is correction-driven, detection-assisted, acceptance-limited, repeated-round stable, source-sink supported, and sufficiently evidenced to justify the engineering claim being made. Keywords: QHOME-RETROFIT, quantum error correction, logical qubits, fault-tolerant quantum computing, logical-state maintenance, branch-resolved diagnostics, source-sink architecture, post-selection, accepted-stream filtering, reproducibility, systems code, evidence-status labels, tiered verdicts, logical error suppression.
Claims of quantum advantage should remain robust even when classical strategies have access to side information correlated with the benchmark under evaluation, just as Bell certification must account for measurement dependence. We formalize such correlations as benchmark dependence, a task-level generalization of measurement dependence. For every bounded-reward task, we show that the optimal benchmark-dependent classical score obeys Sη≤min{1,Scl+η}, and construct a family of tasks that saturates this bound, showing that the linear dependence on η is tight without further assumptions. For repeated product tasks with roundwise dependence, we obtain the stronger multiplicative bound Sη(n)≤(ωc+η)n, and extend the framework to finite-sample data, mutual-information constraints, multipartite tasks, and correlations distributed along a causal path. Applying these results to aggregated IBM hardware data, we obtain positive raw-count cycle-product certificates of 0.0812 for CHSH and 0.2178 for Mermin--GHZ, while the nine-context magic-square construction remains uncertified; readout-mitigated values are reported separately as sensitivity estimates. We also analyze a non-Bell quantum-kernel benchmark, where a label-construction variable has measured conditional dependence ηλ(Y)=0.5, above the threshold ηreq=0.375, required to close the reported score gap, and yields perfect classical classification. The framework therefore converts a quantum--classical score separation into a quantitative lower bound on the benchmark-correlated classical information required to explain the score separation.
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.
Rare-regime discovery in parameterized dynamical systems is an active-search problem: find one verified parameter at which a scientifically defined qualitative threshold is crossed, even when acceptable candidates are rare, nonconvex, or fragmented. We introduce Quantum-Classical Phase-space and Stability-Threshold Search (QC-PHAST), an evidence-gated decision protocol and query-accounting framework for finite candidate libraries. A candidate induces a dynamical object, simulator-derived criticality score, and verified first-hit predicate. Scientific metadata and charged pilot evidence are used to assess whether equation-aware search, scalar-score active search, predicate-only search, or only a query-model comparison is admissible. The quantum row is the inherited Grover/Boyer--Brassard--Hoyer--Tapp (BBHT) unknown-M marked-set query reference; it is not a new quantum-search theorem, materialized circuit, or hardware-speedup claim. The result is a regime map. Direct boundary constructions, geometry controls, online simulator loops, and learned-label accounting further identify when classical structure, false positives, calibration cost, or state preparation erases the query-model margin. QC-PHAST is therefore an auditable protocol for deciding when a finite-pool marked-set reference is informative and when classical or resource-aware search should dominate.