Pre-registration (frozen 21 Nov 2026): do GNN-proposed circuits plus polynomial post-processing need fewer parameters than a hardware-efficient ansatz? Test of a 4-qubit TFIM claim
Frozen protocol, code, labelled training set, trained GNN weights and pre-freeze gate results, deposited before any scored run. CLAIM (a machine-generated, untested hypothesis from solver.press): GNN-proposed circuit layouts with a 'channel polynomial' post-processing step reach diamond-norm error <= 0.01 with at least 15% fewer parameters than a hardware-efficient Ry-Rz-CNOT baseline, on a 4-qubit open-chain transverse-field Ising model at t = 0.5, 1, 2, while meeting every target the baseline meets. DESIGN: six arms (baseline, Trotter structure control, search-labeller control, GNN proposal, and polynomial post-processing on the baseline, the Trotter control and the GNN), 60 units per arm (3 targets x seeds 1000-1019), equal optimiser budget (10,000 gradient evaluations), exact diamond distance. DECISION RULE: Supported only if the combined method meets every target, its median parameter count is at most 0.85 of the baseline's, a one-sided paired Wilcoxon test gives p < 0.05, and the median shot-overhead factor is at most 10; an attribution line reports whether it also beats every control. SCOPE: only the row's own falsification clause is tested (the 30%, 12-qubit, MaxCut, SU(4) and hardware claims are not). The 'channel polynomial' is my operational definition, not the row's. PRE-FREEZE: 500 labelled instances, five trained GNNs and gates G1-G6 (all pass) are included; no scored result exists.
Authors
- John Goodman (ORCID: https://orcid.org/0009-0008-4080-8043)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-21
- DOI
- https://doi.org/10.5281/zenodo.24410737
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- article
- Field-Weighted Citation Impact
- 0.00