This publication freezes the first completed evidence block of a joint Adriano Ciardo Labs (ACL) - TERRA-OUX validation programme spanning quantum-hardware resource use, classical quantum-emulation/QEC kernels, real-QPU context, and high-throughput chemistry screening on Aurora. The purpose is not to combine heterogeneous performance numbers into a single universal acceleration claim. Instead, each result is preserved within the computational boundary in which it was measured, and ACL terminology distinguishes independent verification of supplied execution evidence from independent re-execution. For the IBM Quantum line, the archived matched A/B record on backend ibm_marrakesh compares a RAW compiled Shor-15 order-readout run using 128 shots with a TERRA-OUX preconfigured run using 8 shots. Both passed the same predefined peak-mass threshold; the TERRA-OUX run therefore records an exact 16.0x shot-count ratio for this component. The compiled ISA depth changed from 104 to 63 and CZ operations from 27 to 18. Client wall time was approximately 16.59 s versus 16.84 s, so the result is explicitly not a 16x wall-clock speedup. Classical closure recovered order r=4 and factors 3 and 5. For the standard-PC QCEA line, ACL protocol-locked the frozen dense-GF(2)-reference versus sparse/vectorized syndrome benchmark. The locked local measurement files record a dense median reference time of 0.190476750 s, a vector median display time of 0.000021000 s, 1000 timed repetitions, exact bit-for-bit syndrome equality and a recorded median acceleration factor of 9070.353x. The acceleration applies only to the defined GF(2) component kernel. A historical matched whole-emulator A/B measurement remains separately recorded at 2.538x. For the OUXCHEM line, ACL independently verified the consolidated execution evidence for predeclared staged-spectrum workflows. Aurora results were 12.313x, 23.749x and 52.812x when detailed surrogate spectra were retained for 10%, 5% and 2% of candidates respectively, with corresponding local reference values of 21.038x, 58.162x and 119.584x. These are staged screening/routing measurements under changed predeclared output contracts, not identical-output speedups over VASP, Quantum ESPRESSO, CP2K, PySCF or another high-fidelity electronic-structure package. A later corrected Aurora R4 run established 11.275x 12-tile kernel scaling with 93.9585% efficiency; the earlier malformed rank-mapping subtest is retained as invalid for distributed-scaling claims. The accompanying Zenodo deposit includes reader-executable IBM and QCEA source code without source-code comments, extensive README and user-manual files, machine/protocol evidence, SHA-256 manifests and a non-commercial research-use license. Readers are encouraged to rerun the packages and publish the results they actually obtain, whether favourable or unfavourable.
This publication freezes the first completed evidence block of a joint Adriano Ciardo Labs (ACL) - TERRA-OUX validation programme spanning quantum-hardware resource use, classical quantum-emulation/QEC kernels, real-QPU context, and high-throughput chemistry screening on Aurora. The purpose is not to combine heterogeneous performance numbers into a single universal acceleration claim. Instead, each result is preserved within the computational boundary in which it was measured, and ACL terminology distinguishes independent verification of supplied execution evidence from independent re-execution. For the IBM Quantum line, the archived matched A/B record on backend ibm_marrakesh compares a RAW compiled Shor-15 order-readout run using 128 shots with a TERRA-OUX preconfigured run using 8 shots. Both passed the same predefined peak-mass threshold; the TERRA-OUX run therefore records an exact 16.0x shot-count ratio for this component. The compiled ISA depth changed from 104 to 63 and CZ operations from 27 to 18. Client wall time was approximately 16.59 s versus 16.84 s, so the result is explicitly not a 16x wall-clock speedup. Classical closure recovered order r=4 and factors 3 and 5. For the standard-PC QCEA line, ACL protocol-locked the frozen dense-GF(2)-reference versus sparse/vectorized syndrome benchmark. The locked local measurement files record a dense median reference time of 0.190476750 s, a vector median display time of 0.000021000 s, 1000 timed repetitions, exact bit-for-bit syndrome equality and a recorded median acceleration factor of 9070.353x. The acceleration applies only to the defined GF(2) component kernel. A historical matched whole-emulator A/B measurement remains separately recorded at 2.538x. For the OUXCHEM line, ACL independently verified the consolidated execution evidence for predeclared staged-spectrum workflows. Aurora results were 12.313x, 23.749x and 52.812x when detailed surrogate spectra were retained for 10%, 5% and 2% of candidates respectively, with corresponding local reference values of 21.038x, 58.162x and 119.584x. These are staged screening/routing measurements under changed predeclared output contracts, not identical-output speedups over VASP, Quantum ESPRESSO, CP2K, PySCF or another high-fidelity electronic-structure package. A later corrected Aurora R4 run established 11.275x 12-tile kernel scaling with 93.9585% efficiency; the earlier malformed rank-mapping subtest is retained as invalid for distributed-scaling claims. The accompanying Zenodo deposit includes reader-executable IBM and QCEA source code without source-code comments, extensive README and user-manual files, machine/protocol evidence, SHA-256 manifests and a non-commercial research-use license. Readers are encouraged to rerun the packages and publish the results they actually obtain, whether favourable or unfavourable.
This update consolidates the formal, numerical, and publication-level corrections identified after Revision 3.0 of the FEINMAN 2 project and after direct execution of its reproducibility package. The underlying proposal remains a typed directed operator-graph calculus organized through the locked 4S-11S operator-space chain. The update does not introduce a new interaction or a confirmed deviation from standard quantum mechanics or quantum electrodynamics. Its main contribution is instead evidential and methodological: the complete package was checked by exact SHA-256 verification and rerun in the frozen environment (Python 3.13.5, NumPy 2.3.5, Linux x86_64/glibc 2.41), producing STATE=DONE and TESTS=PASS. The run reproduces the Cl(0,8) eight-generator certificate, the 32x32 extended Pauli certificate, the standard-QED anomalous-frequency checksum, the TERRA/ZERRA finite-grid count, and the frozen H2/H3+ finite-basis molecular outputs. The update corrects the benchmark-contract hash to c006873e...db777, distinguishes a recovery checksum from an independent one-loop integration, replaces the ambiguous bridge limit B->I by an explicitly declared identification or isometry between Hilbert spaces, and separates verified implementation claims from open physical claims. It also records incomplete executable coverage for graph-schema rejection tests, numerical no-signalling regression, and the TERRA/ZERRA norm-residual certificate. FEYNMAN-2 is therefore supported as a reproducible formal and computational research platform, while promotion to a physical theory still requires a nonidentity operator assignment frozen before a sealed holdout and independently replicated.
This paper takes the first step towards hardware evidence for The Quantum Pi Benchmark (QPB) under its provenance (P) and blindness (B) axes and non-total capability grid (R). Using IBM Heron r2 Quantum Processing Units (QPUs), this paper reports findings to support P0/B0/R2 compiled-address amplification and P1/B0/R3 only for the loaded-content equality-predicate family, spanning 220 logical results and 324 job records. In the compiled-address family, single-iteration efficiency is approximately 66% through 110 routed CZ gates and falls to roughly 15% at the traceable larger instances. The two recoverable N = 512, k = 1 executions used 270 CZ gates and returned 84 marked outcomes in 32,768 shots, or 0.256% (95% Wilson interval 0.207%–0.317%), 1.31 times the uniform expectation. Matched true, scrambled, and zero controls show that this signal amplifies a compiled mark rather than evaluating Pi content. A content-addressed Quantum Read Only Memory (QROM) bridge and a coherent block-equality negative result are retained as P1/B0 diagnostics. Loaded-content equality separates supplied Pi blocks from corrupted controls: the monolithic discrimination gap decreases from 0.780 at six bits to 0.132 at 24 bits. Across three matched transpiler placements, tiled equality gives gaps of 0.761 ± 0.004, 0.404 ± 0.153, 0.344 ± 0.037, and 0.128 ± 0.034 at 6, 12, 18, and 24 bits, respectively, where uncertainties are descriptive sample standard deviations. The replicated mean routed-cost reduction is 29%–41%. Phase-pair circuits are classified as P1/B0 diagnostics rather than R3: five non-overlapping spans per control, ten circuits total, were submitted in one quantum hardware job. They recover 106/106 expected signs in each control with mean edge magnitudes 0.964 and 0.951. These are bounded results that do not establish direct digit access, controller-blind search, collision finding, frontier performance, or end-to-end advantage.
clifford_qc is a Python research toolkit for constructing quantum models, comparing variational and subspace eigensolvers, and estimating measurement resources. A common sparse Pauli algebra connects Hamiltonians, density operators, gates, and candidate-selection observables; dedicated interfaces handle circuits, execution, and statistical estimates. A worked gradient example illustrates shared measurements, and a molecular workflow separates reusable preparation, solving, and reference validation. Matrix-element banks support virtual subspaces, exact Ritz residuals, and folded-spectrum roots. Process-isolated benchmarks show that packed coefficients and streaming reduce observed peak memory on the larger tested inputs at increased runtime. Measurement studies separate setting counts, shot requirements, and device cost: fully commuting readout certifies a fixed first-order Ritz functional with fewer shots, while anticommuting cliques help some fixed reference energies and not others. Entangling-gate time and connectivity can offset shot savings or make a protocol inadmissible under illustrative device models. Further studies expose subspace bias, indeterminate encoding comparisons, failed approximate-restriction screens, and high residual-measurement costs under the tested uniform allocations. Generated tables, provenance records, a versioned evidence contract, and manuscript checks connect claims to their inputs. These small-system results support reproducible method development and establish neither hardware performance nor a general simulation speedup.
Abstract Quantum benchmarks for artificial intelligence require measurement budgets, target observables, and execution records to agree. We reanalyze archived signed-overlap, kernel, and quantum approximate optimization algorithm (QAOA) summaries from a cloud-hardware campaign, retaining incomplete runs and distinguishing measured entries from imposed values. For eight signed-overlap submissions, increasing shots per batch from 256 to 2048 changes reconstructed root-mean-square error from 0.1335 to 0.1292. At 2048 shots, squared offsets of the empirical batch means account for 98.2% of the reconstructed error. This decomposition is descriptive; it does not identify a physical noise mechanism. An incomplete kernel contains 18 measured off-diagonal entries out of 45; filling the others with zero changes its observed-entry mean from 0.2220 to 0.0888. A source-label conflict prevents a matched provider comparison. Across 43 Rigetti QAOA submissions, size-group mean edge-cut fractions range from 0.4782 to 0.5010, but heterogeneous parameters and absent raw histograms limit interpretation. Earlier learning and simulation results obtained with graphics processing units provide exploratory supplementary evidence.
This report records and interprets the second real-device execution of the CNC fork experiment in the certifiable T = 2 “binary-clock” design (runner v3), including a software-forensics correction: an obsolete analysis JSON incorrectly reported ν = 1.0 even though all 2-bit clock patterns are legal by construction in T = 2. It also specifies a final replication run (“Test 3”) intended to be maximally robust against the dominant remaining failure mode (near-threshold readout invasiveness on ibm_fez). A conclusive outcome of Test 3 is meaningful regardless of direction, because (as preregistered) the runner only emits a conclusive label after certifying overlap and bounding nuisance effects (mismatch and readout invasiveness). Run metadata (from locked runner output): backend: ibm_fez output created (UTC): 2026-01-10T19:03:16.074947+00:00 IBM Runtime job id: d5ha332gim5s73ahnueg physical layout (C1,C2,S): [1, 2, 3] protocol blocks: ε ∈ {0.40, 0.20} (primary block ε = 0.40) Qiskit versions (recorded by harness): qiskit 2.2.3, qiskit-ibm-runtime 0.43.1 Key certified outputs (primary block, ε = 0.40): D̄ = 0.381793 ν = 0.016503 (≤ ν_max = 0.020) ε_inv = 0.047647 (≤ ε_inv,max = 0.050) δ′ = 0.313209 decision (locked runner): reject hard CNC The Test 3 OSF preregistration is complete and time‑stamped, but remains embargoed until execution; the public link will be added here immediately after the embargo is lifted. Raw run artefacts and outputs to be archived as a separate Zenodo Dataset record by the hardware executor (Morgan Cameron). This report is a forensic note and replication/protocol document.
This paper records the principal scientific work completed within the ACL–OUXSPACE Collaborative Verification Framework, led on the experimental and institutional side by Adriano Ciardo and Adriano Ciardo Labs (ACL), and on the mathematical verification side by Alexandar Balevsky and the OUXSPACE Research Programme. The collaboration was deliberately structured around a demanding principle: a candidate model should be frozen before access to decisive outcomes, compared against matched baselines and null families, evaluated on sealed or protected data where appropriate, and assigned an automatic fail-closed verdict without post-hoc rescue. ACL undertook the execution and protected-data side of this programme with exceptional care, maintaining unusually strict boundaries around proprietary physical information while still returning the aggregate evidence needed for scientific assessment. The resulting chain progressed from implementation and algebraic verification of the Hamiltonian/Schrödinger–Pauli operator infrastructure, through an empirical C8 model comparison, to confirmatory spectral and prospective directional stages, and then to a separate TERRA–ZERRA state-distinguishability test. The documented record includes a Phase 1 PASS for the reference implementation, a Phase 2 PASS in which C8 improved phase error by 13.4% relative to the best frozen baseline (Holm-adjusted p = 0.0004), a schema-valid Phase 3 PASS, a reported numerical Phase 4 PASS subject to archival reconciliation, and a reported-and-replayed numerical PASS for Phase 5 TERRA–ZERRA. Regulated I/Z was deliberately separated into its own preregistered branch; this paper therefore distinguishes its mature testable formulation from any stronger claim of a final publicly documented PASS. The purpose of this account is not to disclose ACL technology, nor to convert one experimental chain into proof of the entire OUXSPACE ontology. Its purpose is to document a highly disciplined method of collaboration in which theoretical ambition, proprietary experimental work, and rigorous falsification were made to coexist. The authors record their particular appreciation for the diligence, seriousness, technical patience, and meticulous execution demonstrated by Adriano Ciardo Labs throughout the programme.