Repeated states in state-ranked Array-RQMC receive rank-specific inputs. We execute the reranked population without visiting every particle when complete states repeat and transitions admit short finite-word interval partitions. Primal image-basis and dual constraint counters preserve the realized histogram path and supported readouts. Fixed suffix dependencies survive triangular scrambles; syndrome-prefix diversity determines exact conditional demand for shared dual transformations. A sharp finite-sum bound and rank-boundary geometry connect demand to execution cost. Six compiled executors share repair and tandem tapes and return every step histogram and readout. With eight seeds per cell on one non-isolated host, median within-seed timing ratios favor direct basis over the other non-enumerating methods in all 17 cells. With 2^20 particles, it outpaces compact rank streaming by about 41-57 times for repair and 10 for tandem. Dual coefficient retention improves on matched reconstruction; fixed-workload diagnostics characterize the remaining work. This record contains the 20-page author manuscript and 6-page reader supplement, version 20261005-estimator. This is an author preprint; it has not yet been peer reviewed or accepted for publication. Code and reproduction data. The fixed public companion exact-state-ranked-array-rqmc-v1.0.0 provides the measured source, all 4,080 original timings, saved trajectories, corrected executors, and table, figure and PDF reproduction. Download array-rqmc-repro-20261006.zip and follow its README. It is the public counterpart of array-rqmc-review-20261005-estimator.zip named in the paper; its provenance file identifies the unchanged scientific inputs and the omission of private editorial material. Code and the layout template use MPL-2.0; author publication materials and saved data use CC BY 4.0. Dependencies retain their own licenses. The two PDFs deposited here remain unchanged.
Repeated states in state-ranked Array-RQMC receive rank-specific inputs. We execute the reranked population without visiting every particle when complete states repeat and transitions admit short finite-word interval partitions. Primal image-basis and dual constraint counters preserve the realized histogram path and supported readouts. Fixed suffix dependencies survive triangular scrambles; syndrome-prefix diversity determines exact conditional demand for shared dual transformations. A sharp finite-sum bound and rank-boundary geometry connect demand to execution cost. Six compiled executors share repair and tandem tapes and return every step histogram and readout. With eight seeds per cell on one non-isolated host, median within-seed timing ratios favor direct basis over the other non-enumerating methods in all 17 cells. With 2^20 particles, it outpaces compact rank streaming by about 41-57 times for repair and 10 for tandem. Dual coefficient retention improves on matched reconstruction; fixed-workload diagnostics characterize the remaining work. This record contains the 20-page author manuscript and 6-page reader supplement, version 20261005-estimator. This is an author preprint; it has not yet been peer reviewed or accepted for publication. Code and reproduction data. The fixed public companion exact-state-ranked-array-rqmc-v1.0.0 provides the measured source, all 4,080 original timings, saved trajectories, corrected executors, and table, figure and PDF reproduction. Download array-rqmc-repro-20261006.zip and follow its README. It is the public counterpart of array-rqmc-review-20261005-estimator.zip named in the paper; its provenance file identifies the unchanged scientific inputs and the omission of private editorial material. Code and the layout template use MPL-2.0; author publication materials and saved data use CC BY 4.0. Dependencies retain their own licenses. The two PDFs deposited here remain unchanged.
Exact Binary Projections for Array-RQMC: Joint Laws and Pathwise-Preserving Execution Aoi Kawasaki. Preprint; not peer reviewed. Contribution For a specified two-dimensional Sobol net with linear matrix scrambling and a digital shift, the complete rank-ordered binary innovation vector is uniform over exactly N outcomes at N = 2^m paths. An odd mask and a fair bit describe the law, requiring m independent fair bits per step under the stated ideal randomization model. Independent adjacent antithetic pairs have the same covariance but need not have the same higher-order law; exact nonlinear witnesses give variances 0 versus 2 and 4 versus 2. This characterization enables direct generation without generating unused coordinates or sorting the point set. A second rewrite maintains exactly the reference state order for stopped scalar binary chains with monotone branches, including absorption and floating-point ties. Measured results and limits Across eight fixed benchmark cases in two input encodings, state-order maintenance reduced warm execution time by 37.2% at N = 512 and 67.5% at N = 4,096 relative to direct binary generation with full state sorting. The encodings do not create sixteen independent model laws. The measurements are from one CPU/software stack, not a held-out hardware or dynamics study. The joint-law equivalence of the library and direct generators is an ideal-law statement, not equality under the same finite integer seed. Direct and order-maintained execution do preserve the same finite-seed trajectories and outputs under the stated arithmetic conditions. No new convergence rate or universal variance advantage is claimed. Comparisons with the measured CRN and antithetic implementations remain workload- and reuse-dependent. Avoidable mask initialization was included in the measured baselines; it is not an intrinsic CRN cost. Startup and calibration can outweigh warm-time savings. The publication retains those recorded costs. Included materials and reproducibility scope The record contains the manuscript PDF and a self-contained reproducibility capsule with manuscript/build sources, three array kernels, 19 tests, saved table/figure inputs, two figures, dependency versions, and SHA-256 inventories. The tests include exact finite enumeration, within-project separate reference implementations, absorption and floating-point tie checks, and saved-data arithmetic. They are not third-party peer review. The capsule does not include every raw calibration/validation observation, bootstrap sample, timing round, or baseline/calibration driver. Regenerating saved tables and figures is not a rerun of the full original experiment. No GPU, pretrained model, private workspace, or external dataset is required. Rights and disclosure Publication materials and saved data: CC BY 4.0. Code: MPL-2.0, with per-file scope in LICENSES.txt. Generative-AI assistance is disclosed in the manuscript. The version-specific archival identifier is doi:10.5281/zenodo.22728405.
Preprint and reproducibility archive; not peer reviewed. What this record contains. The full text of the manuscript "Identical Few-Particle Gauge Hamiltonians, Programmable Collective Charge Response" (M. J. Baek), its Supplementary Information with complete proofs, and the archive that certifies every closed-form value the paper states. The result. Few-particle dynamics are routinely used to infer collective response in paired quantum matter. This work constructs finite-range interacting response twins that defeat that inference exactly. For any prescribed finite p, two positive finite-range parents have complete static gauge Hamiltonians that coincide at every Peierls link phase on every sector N ≤ p and first separate at N = p+1; their zero-twist finite-density ground rays are the same Dicke condensate, yet their collective charge curvatures differ extensively. The obstruction has no universal depth, and the paper locates it exactly: the blind depth equals the spectator body order, the algebraic bound is independent of geometric range, and bounded range still bounds depth only through the number of sites a ball can hold — so no arbitrary-depth family of uniformly fixed range is claimed. Conversely, a structurally closed exact-pair tower closes at depth two. What is hidden is designable: with d(d+1)/2 displacement families the whole symmetric response-tensor difference is locally realizable at interior filling, and a triangular-lattice twin pair differs only in shear while both diagonal responses stay equal. A 4×4 hard-core-qubit discriminator gives an exact factor-of-two contrast with an internal null control and a state-preparation certificate in 17 equal-time settings. What is certified, and what is not. Results proved in closed form are stated as theorems and proved in full in the Supplementary Information; results established by exact rational or symbolic computation are labelled computer-assisted and carry the script that produces them; the 16-qubit discriminator is a blueprint with an end-to-end noise simulation, not a hardware demonstration, which is not claimed anywhere. Scope limits, open proof lines and one refuted conjecture are recorded explicitly rather than omitted. The archive. response_twins_unified_v1.0.zip contains the manuscript and Supplementary sources, the proof notes, the complete fail-closed verification harness (31 executed stages in release mode — 27 claim-bearing certificate stages, 1 non-claim diagnostic stage and three fail-closed gates — and 24 in quick mode) with one frozen log per stage, independent reimplementations of the load-bearing calculations, negative controls that must fail, the exact-arithmetic certificates behind every closed-form value in the paper, the figure-generation scripts, the scientific claim and provenance record (79 rows with status and scope notes, 50 of them naming the in-archive script or certificate that checks them, the rest saying in words why not), and a per-file SHA-256 manifest of all 209 payload files. Verifying it. Extract the archive and run python3 REPRODUCIBILITY/run_all.py --mode quick for the fast subset or --mode release for all 31 stages; bash BUILD.sh rebuilds both PDFs from source. The three gates check journal-format limits, the release payload against its manifest, and every number the documentation states about the artefacts. Running the harness does not modify the archive: all runtime output is written outside the immutable tree, so verification cannot invalidate the manifest. README.md separates reproducing the content (TeX Live 2023 or newer) from reproducing the archived PDF bytes, which needs the exact producing build recorded inside the PDFs. Licences. Manuscript, Supplementary Information and documentation CC BY 4.0; source code MIT; certificate data CC0 1.0. LICENSE.md is the authoritative per-file mapping and is included both in the archive and as a separate file on this record.
Computational model-development and verification note. With fixed coefficients, a controlled I/X update separates initially equal sector Z readouts by 0.6668017457457079. A reusable compiler constructs a reduced fixed-qubit model with 15 variable coordinates, versus 18 for the complete class-query contract. An eight-step trajectory agrees to approximately 1.82e-15. The computational audit passes 18 checks. A separate color/component supplement passes 36 consistency checks and treats three colors and their generators as supplied representation inputs. The included Astra Medium review recommends publication as a short computational verification or software note, subject to ordinary editorial review. The ZIP includes code, frozen inputs, manifests, results, earlier versions and complete AI review records. Public release: https://github.com/Wonsik-Choi-janefather/wrra-m-0.1/tree/78c50fbc7074e74bf5f84d70387a1874fe5906e2/publication/WRRA_Schwartz_Contract_Audit_v1_1
RTCG-P4, version 1.0, is a Complementarity-First preprint on using signed preparation-calibration responses to sharpen a uniform certificate for a prescribed complete quantum instrument. Fifteen trusted Pauli analyzers on each of six preparations determine the target contribution to a displaced-input validation response. Complete-flag trace cancellation bounds the remaining unknown-instrument contribution by an acquired preparation allowance times the actual unhalved flagged diamond error. An inherited source-specific instrument estimate then yields a record-based maximum-of-ratios bound with explicit denominator, cap, and fallback conditions. The same-record synthetic count comparison improves from 0.000079105273917 to 0.000071209076256. A support-preserving preparation-error population example gives the new sufficient upper 0.000074611876587 versus the inherited 0.008404839640705. The latter is a population comparison; it does not establish nonnominal finite-sample power. Both certificate rules hold on the same confidence event. Named-source power retains nominal actual calibration, and the fixed acquisition schedule remains unchanged. The written proofs allow arbitrary complete complex CP competitors under the stated trusted-reference, shared-world and within-setting iid sampling contract, with dependence between settings allowed. Exact finite source and implementation evidence is provided. A source-matched Lean companion supports the deterministic response and conditional instrument-composition chain. Physical acquisition/source estimates, the complete-channel cap, identification of the full compatible family, stabilization/representation, and probability/count implementation retain their explicit formal boundaries. The public materials are the main manuscript, supplement, and selected reproducibility companion with editable LaTeX, exact numerical inputs and code, accepted Lean sources, historical execution evidence and verification instructions. Manuscript, documentation and author-owned data are licensed under CC BY 4.0; original numerical, checking and Lean code are licensed under MIT. Retained inherited and third-party notices continue to apply.
The observations available for a quantum instrument need not guarantee the accuracy of the device that generated them. On a fixed four-dimensional incidence-record benchmark, the paper compares two readout augmentations retaining six mixed preparations, both instrument outcomes, all attempts and shared completeness. Each adds three four-outcome bases and eighteen preparation/readout pairs. At r = 1/300000000, the 123 design admits a complete compatible instrument with unhalved prescribed-target diamond error at least 0.000103738856511, above the prospective 10^(-4) threshold. Replacing one basis gives the 124 design and a uniform upper 396319/8640000000 = 0.0000458702546296296... for every compatible complete instrument. The diagnostic generates data; its noise law and a Choi-rank bound are not imposed on the unknown device. The added basis effects observe ten Hermitian output directions, while original destination tests supply the leakage control. Five triples in the fixed finite menu are sufficient, one has a complete counterexample, and four remain unresolved. The paper claims neither a general measurement minimum, optimal radius, experimental certification, finite-sample power, calibrated hardware nor a general small-noise rate classification. Exact instrument identification remains obstructed on the unchanged preparations. Scientific cutoff: AUG04, 15 October 2026; AUG05 remains unexecuted. The companion contains editable manuscript sources, complete exact scientific arrays, the unchanged standalone reader, and accepted returned Mac Lean evidence for a supporting subset: 83 supporting theorems, 37 definitions and one abbreviation, with all 121 source/type/axiom correspondences. The complete-instrument theorems are not formalized end to end. Public execution views have documented path-only redactions; this preparation does not add a kernel run or external human peer review.