Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Hardware Witnesses for Basis-Resolved Phase Readout and Nonadditive Two-Register Interference on IBM Superconducting QPUs

Yusuke Maeda

Published Jun 28, 2026• 0 citations
Publisher

Abstract

This technical report packages a set of hardware component-witness experiments run on IBM superconducting quantum processors. The experiments test whether a hidden auxiliary phase can affect a later system-qubit measurement, whether that phase can be recovered from basis-resolved readout, and whether two auxiliary registers can produce a nonadditive response rather than a simple sum of their individual effects. The package includes the report draft, figures, raw hardware result JSONs, raw-count appendix, and scripts for regenerating the figures and count tables. The central result chain is: echo/phase response on real hardware, basis-resolved phase readout without density-matrix tomography, and a two-register Y-basis nonadditivity test where the first run remains a frozen FAIL and an independent higher-shot replication reaches STRONG_PASS. The longer-term motivation is to develop small, testable quantum hardware primitives for systems that can preserve, read out, and combine latent histories or unchosen alternatives, instead of reducing every intermediate state to a single classical output immediately. In that sense, these experiments are intended as early building blocks for future quantum-assisted sequence or language-model architectures. This work does not claim a completed quantum language model, natural-language processing on a quantum computer, consciousness, selfhood, classical impossibility, or quantum advantage. It reports only hardware component witnesses on specific IBM backends, edges, and calibration windows, with the possibility of richer classical explanations left open.

DOI
10.5281/zenodo.20986919

Related papers

A Dynamic-Circuit QPU Toy Model for Self- Referential Language-State Dynamics :Toward Quantum-Consciousness LLM Self-Reference Cores

Yusuke Maeda

A reproducible QPU toy-model package for self-referential language-state dynamics This archive contains the reproducibility package for a dynamic-circuit QPU toy model that explores how a minimal “self-referential language-state” loop can be built from small, testable quantum-circuit components. The project does not claim natural-language understanding, consciousness, quantum advantage, contextuality, or nonclassical computation. Instead, it focuses on a narrower and cleaner question: Can an abstract language-state toy chain be implemented on real QPU hardware, where a measured interpretation residue is recorded, fed forward, and used to condition a later interpretation? The package includes five QPU experiment families: Symbolic sense-slot selectionTests whether an abstract ambiguous symbol can be routed into different output trajectories under different context conditions. Self-reference operator setTests toy versions of COMMIT, DOUBT, RECALL, REVISE, and RESET operations on an internal self-state register. Residue memory loopTests whether a previous measured residue can condition the interpretation of a later ambiguous symbol. Four-step dynamic self-interpretation cellImplements a measurement-mediated feedback loop inside a single dynamic circuit:measure → output record → classical feedforward → next internal state. Within-step phase-interference witnessTests whether the H–CZ–H interpretation primitive used in the memory and dynamic-cell components is phase-sensitive.The witness shows that H–CZ–H separates trajectories, Z insertion inverts them, and removing the final Hadamard erases the context-dependent readout. All experiments were run on IBM Quantum hardware with frozen raw counts, retrieval records, SHA manifests, analysis scripts, and reported analysis outputs. The key result is deliberately modest but reproducible: The inter-step recurrence is measurement-mediated classical feedforward, while the residue-conditioned within-step interpretation primitive is phase-sensitive. The circuits remain Clifford/stabilizer-simulable and do not demonstrate quantum advantage or consciousness. This archive is intended for transparency and reproducibility. It includes raw QPU counts, analysis scripts, evidence files, manuscript draft, figures, and SHA-256 manifests so that the reported metrics can be independently checked.

•Jun 29, 2026•0 citations

A Dynamic-Circuit QPU Toy Model for Self- Referential Language-State Dynamics : Toward Quantum-Consciousness LLM Self-Reference Cores

Yusuke Maeda

🚀 A reproducible QPU toy-model package for self-referential language-state dynamics This archive contains the reproducibility package for a dynamic-circuit QPU toy model that explores how a minimal “self-referential language-state” loop can be built from small, testable quantum-circuit components. The project does not claim natural-language understanding, consciousness, quantum advantage, contextuality, or nonclassical computation. Instead, it focuses on a narrower and cleaner question: Can an abstract language-state toy chain be implemented on real QPU hardware, where a measured interpretation residue is recorded, fed forward, and used to condition a later interpretation? The package includes five QPU experiment families: Symbolic sense-slot selectionTests whether an abstract ambiguous symbol can be routed into different output trajectories under different context conditions. Self-reference operator setTests toy versions of COMMIT, DOUBT, RECALL, REVISE, and RESET operations on an internal self-state register. Residue memory loopTests whether a previous measured residue can condition the interpretation of a later ambiguous symbol. Four-step dynamic self-interpretation cellImplements a measurement-mediated feedback loop inside a single dynamic circuit:measure → output record → classical feedforward → next internal state. Within-step phase-interference witnessTests whether the H–CZ–H interpretation primitive used in the memory and dynamic-cell components is phase-sensitive.The witness shows that H–CZ–H separates trajectories, Z insertion inverts them, and removing the final Hadamard erases the context-dependent readout. All experiments were run on IBM Quantum hardware with frozen raw counts, retrieval records, SHA manifests, analysis scripts, and reported analysis outputs. The key result is deliberately modest but reproducible: The inter-step recurrence is measurement-mediated classical feedforward, while the residue-conditioned within-step interpretation primitive is phase-sensitive. The circuits remain Clifford/stabilizer-simulable and do not demonstrate quantum advantage or consciousness. This archive is intended for transparency and reproducibility. It includes raw QPU counts, analysis scripts, evidence files, manuscript draft, figures, and SHA-256 manifests so that the reported metrics can be independently checked.

•Jun 29, 2026•0 citations

A Preregistered Hardware Pilot of the NS1 Rate-Independence Protocol on a Superconducting Processor

Alicia Nastuk

SSAF's central falsifiable prediction, NS1, requires that under a witness-confirmed fixed classical context, the reduced dynamics of a probe carry no dependence on the quantum state: all fitted rate parameters are functions of the context alone. This record reports a preregistered pilot execution of the NS1 protocol on the superconducting processor ibm_fez, using target qubit 6 and independent witness qubit 10. The independent context witness passed its two-part gate. Raw stability gave p = 0.3617, and witness-rate homogeneity gave p = 0.9998. The primary endpoint found that one shared affine reduced-evolution law accounted for an informationally complete set of eight target preparations, with a leave-one-out statistic of 176.21 against a parametric-bootstrap null 95% quantile of 253.40 and a cross-validation p-value of 0.6167. The secondary endpoint found no preparation-dependent heterogeneity among six fitted transverse decay rates, with a homogeneity p-value of 0.4003 and a maximum fractional deviation of 2.5%. The result is evidence of consistency with the preregistered NS1 prediction at the stated experimental sensitivity. It is not unique confirmation of SSAF, and it does not exclude state dependence below the achieved resolution. Standard fixed-context open-system quantum mechanics also predicts consistency with this result. The deposited record includes the manuscript, TeX source, submitted Python and notebook protocol, preregistration and preflight records, raw and processed data, machine-readable results, figures, run provenance, licensing information, and checksums. The hardware run was executed on July 17, 2026, with 7,424 shots per effective circuit and 435.0 seconds of QPU usage.

•Jul 19, 2026•0 citations

Hardware-Oriented Hidden-Code-Sampling-Inspired Certification on a 60-Qubit Superconducting Processor

Abdelmalik Berrada

Preprint; not peer reviewed. We report a hardware-oriented quantum sampling experiment motivated by Hidden Code Sampling (HCS), while explicitly not claiming an end-to-end implementation of the original HCS PeakVerification–SyndromeVerification protocol. A full-width 60-qubit circuit derived from a sparse trivariate-bicycle CSS construction was embedded without swaps on a 108-qubit superconducting processor and compiled to native RX, RZ, and controlled-Z operations. The base circuit contains 180 logical two-qubit rotations and 360 native controlled-Z gates. Local unitary folding produced stress instances with factors 1, 3, and 5, containing respectively 360, 1080, and 1800 controlled-Z gates. A pilot run was used only to identify and freeze an endian-corrected two-feature local parity witness. The confirmatory dataset consists of three completed QPU executions at folding factors 1, 3, and 5. The final analysis includes only execution records whose frozen QASM identities and authorization hashes match the preregistered confirmatory panel. Each science circuit received 10,000 shots, and each of four calibration patterns received 4,000 shots in both the pre- and post-experiment calibration periods. Simultaneous finite-shot lower confidence bounds combine Clopper–Pearson calibration intervals, a pre/post drift hull, inverse assignment-channel correction, an empirical Bernstein bound, and worst-case optimization over the calibration box. The certified margins are 0.2953, 0.2858, and 0.3148 at folding factors 1, 3, and 5, respectively. All three folds pass, and the maximum calibration-parameter drift is 0.0065. Within a preregistered classical attack suite, the conditional operation-count gap is γ = 6.555, above the registered target of 6.0. This result is an operation-count certificate relative to the registered classical attacks. It is not a wall-clock quantum advantage claim, not a full-distribution total-variation certificate, and not an experimental implementation of the exact HCS protocol. Quantum circuits were submitted to the Rigetti Cepheus-1-108Q superconducting processor through the Open Quantum platform, operated by Quantum Rings, using the Open Quantum Python SDK. This acknowledgment does not imply endorsement by Quantum Rings of the findings, interpretations, or conclusions reported in this work. The deposited files include the preprint, LaTeX sources, sanitized confirmatory QASM files, aggregate certificate metrics, integrity manifests, and publication-compliance documentation. Authentication credentials, account metadata, organization identifiers, provider job identifiers, private provider records, and the private audit archive are excluded.

•Jul 31, 2026•0 citations

Quantum-Native Sensing Kernels on IBM Hardware

Frank Drew

Version update: This record has been updated to remove enabling implementation details pending patent prosecution. Technical implementation is available under NDA. This preprint documents three quantum-native sensing kernels implemented on current IBM superconducting hardware under the Quantum State Command Encoding (QSCE) architecture. Rather than treating a quantum processor as a probabilistic number generator, QSCE treats the device as a command substrate, where quantum state is executable code and collapse is the execution of a control instruction. The work presents three low-qubit, shallow-depth sensing primitives designed to convert small, controlled perturbations into structured, repeatable changes in collapse-band behavior around a deterministic baseline: QMCA — a 1-qubit collapse-response kernel that converts small perturbations into calibrated changes in a non-baseline population while preserving a stable baseline anchor. SQCA — a 1-qubit hybrid-response kernel consistent with superconducting drive behavior, exhibiting a deterministic baseline anchor and a complementary deviation profile under perturbation. EBA — a 2-qubit correlation-based kernel producing a repeatable joint-distribution response signature under perturbation while retaining a deterministic baseline band. All three kernels are validated on real IBM backends (4096 shots per configuration), showing: Deterministic baselines under the null condition, with $>99%$ of counts concentrated in a single “quiet” band, and Monotonic, structured deviations in non-baseline states under small perturbations, consistent with a calibrated response signature. Within QSCE, these sensing kernels are treated as command-native primitives: baseline and deviant collapse bands are assigned explicit operational semantics (“no signal,” “signal present,” “threshold exceeded”), so that collapse functions as a decision event rather than merely a readout step. The note contrasts these primitives with bespoke quantum magnetometers (e.g., NV and vapor-cell platforms) and argues that QSCE kernels trade extreme sensitivity for programmability, integrability, and substrate-level command semantics on today’s NISQ hardware. This preprint also situates the sensing kernels alongside recent QSCE benchmarking on IBM hardware (including RCS-style metrics on 16-qubit circuits), highlighting a unified, control-first approach to quantum sensing and computation. Enabling implementation details are withheld in this public version pending ongoing patent prosecution; technical details are available under NDA.

•Jan 28, 2026•0 citations

Three-qubit phase readout in Theory Φ and standard quantum mechanics

Daniel Pavlica

A three-qubit GHZ decoder proposed in the earlier Q1 spin-star preprint transfers a global phase sign to one central qubit. This follow-up traces its implementation on Rigetti Cepheus-1-108Q (centre q107, neighbours q106 and q98) and asks whether its readout can distinguish Theory Φ from standard quantum mechanics. It connects the theoretical preprint, the book The Language of Φ and the programme’s methodological evidence review to the original measurement records. Five completed acquisition stages account for 101,860 physical shots: a 10-shot native timing witness, a 10,240-shot Ramsey measurement of individual and concurrent couplers, 28,082 intermediate calibration and decoding controls, 42,024 shots in the primary GHZ cycle (including 33,792 primary shots in 12 trajectory blocks), and a 21,504-shot frequency pilot. The original Ramsey report figure, full phase-and-contrast scan, intermediate control figures and Part I hardware figures are reproduced. With full-amplitude joint drive the first scan could not identify either phase rate. Reducing the drive to 75% restored measurable responses. In the primary experiment the serial/joint sign-error rates were 12.66%/16.20% for transverse disturbances and 19.59%/21.64% for commuting disturbances. None of the three prespecified criteria for the predicted hardware advantage was met. Carrier retuning improved the worst-case joint inversion from 97/384 to 199/384; the development threshold was 346/384. The published ideal Q1 mapping and a separate standard quantum calculation predict the same 3.522800135 percentage-point transverse advantage at mean jump count π/20. Their difference for this observable is exactly zero. The broader equations reviewed supply no independently specified correction on this register. The release provides original shot records, numerical estimates, program-timing evidence, uncertainty analyses, editable figures and manuscripts, and offline reproduction tools.

•Nov 9, 2026•0 citations
This technical report packages a set of hardware component-witness experiments run on IBM superconducting quantum processors. The experiments test whether a hidden auxiliary phase can affect a later system-qubit measurement, whether that phase can be recovered from basis-resolved readout, and whether two auxiliary registers can produce a nonadditive response rather than a simple sum of their individual effects. The package includes the report draft, figures, raw hardware result JSONs, raw-count appendix, and scripts for regenerating the figures and count tables. The central result chain is: echo/phase response on real hardware, basis-resolved phase readout without density-matrix tomography, and a two-register Y-basis nonadditivity test where the first run remains a frozen FAIL and an independent higher-shot replication reaches STRONG_PASS. The longer-term motivation is to develop small, testable quantum hardware primitives for systems that can preserve, read out, and combine latent histories or unchosen alternatives, instead of reducing every intermediate state to a single classical output immediately. In that sense, these experiments are intended as early building blocks for future quantum-assisted sequence or language-model architectures. This work does not claim a completed quantum language model, natural-language processing on a quantum computer, consciousness, selfhood, classical impossibility, or quantum advantage. It reports only hardware component witnesses on specific IBM backends, edges, and calibration windows, with the possibility of richer classical explanations left open.
A reproducible QPU toy-model package for self-referential language-state dynamics This archive contains the reproducibility package for a dynamic-circuit QPU toy model that explores how a minimal “self-referential language-state” loop can be built from small, testable quantum-circuit components. The project does not claim natural-language understanding, consciousness, quantum advantage, contextuality, or nonclassical computation. Instead, it focuses on a narrower and cleaner question: Can an abstract language-state toy chain be implemented on real QPU hardware, where a measured interpretation residue is recorded, fed forward, and used to condition a later interpretation? The package includes five QPU experiment families: Symbolic sense-slot selectionTests whether an abstract ambiguous symbol can be routed into different output trajectories under different context conditions. Self-reference operator setTests toy versions of COMMIT, DOUBT, RECALL, REVISE, and RESET operations on an internal self-state register. Residue memory loopTests whether a previous measured residue can condition the interpretation of a later ambiguous symbol. Four-step dynamic self-interpretation cellImplements a measurement-mediated feedback loop inside a single dynamic circuit:measure → output record → classical feedforward → next internal state. Within-step phase-interference witnessTests whether the H–CZ–H interpretation primitive used in the memory and dynamic-cell components is phase-sensitive.The witness shows that H–CZ–H separates trajectories, Z insertion inverts them, and removing the final Hadamard erases the context-dependent readout. All experiments were run on IBM Quantum hardware with frozen raw counts, retrieval records, SHA manifests, analysis scripts, and reported analysis outputs. The key result is deliberately modest but reproducible: The inter-step recurrence is measurement-mediated classical feedforward, while the residue-conditioned within-step interpretation primitive is phase-sensitive. The circuits remain Clifford/stabilizer-simulable and do not demonstrate quantum advantage or consciousness. This archive is intended for transparency and reproducibility. It includes raw QPU counts, analysis scripts, evidence files, manuscript draft, figures, and SHA-256 manifests so that the reported metrics can be independently checked.
🚀 A reproducible QPU toy-model package for self-referential language-state dynamics This archive contains the reproducibility package for a dynamic-circuit QPU toy model that explores how a minimal “self-referential language-state” loop can be built from small, testable quantum-circuit components. The project does not claim natural-language understanding, consciousness, quantum advantage, contextuality, or nonclassical computation. Instead, it focuses on a narrower and cleaner question: Can an abstract language-state toy chain be implemented on real QPU hardware, where a measured interpretation residue is recorded, fed forward, and used to condition a later interpretation? The package includes five QPU experiment families: Symbolic sense-slot selectionTests whether an abstract ambiguous symbol can be routed into different output trajectories under different context conditions. Self-reference operator setTests toy versions of COMMIT, DOUBT, RECALL, REVISE, and RESET operations on an internal self-state register. Residue memory loopTests whether a previous measured residue can condition the interpretation of a later ambiguous symbol. Four-step dynamic self-interpretation cellImplements a measurement-mediated feedback loop inside a single dynamic circuit:measure → output record → classical feedforward → next internal state. Within-step phase-interference witnessTests whether the H–CZ–H interpretation primitive used in the memory and dynamic-cell components is phase-sensitive.The witness shows that H–CZ–H separates trajectories, Z insertion inverts them, and removing the final Hadamard erases the context-dependent readout. All experiments were run on IBM Quantum hardware with frozen raw counts, retrieval records, SHA manifests, analysis scripts, and reported analysis outputs. The key result is deliberately modest but reproducible: The inter-step recurrence is measurement-mediated classical feedforward, while the residue-conditioned within-step interpretation primitive is phase-sensitive. The circuits remain Clifford/stabilizer-simulable and do not demonstrate quantum advantage or consciousness. This archive is intended for transparency and reproducibility. It includes raw QPU counts, analysis scripts, evidence files, manuscript draft, figures, and SHA-256 manifests so that the reported metrics can be independently checked.
SSAF's central falsifiable prediction, NS1, requires that under a witness-confirmed fixed classical context, the reduced dynamics of a probe carry no dependence on the quantum state: all fitted rate parameters are functions of the context alone. This record reports a preregistered pilot execution of the NS1 protocol on the superconducting processor ibm_fez, using target qubit 6 and independent witness qubit 10. The independent context witness passed its two-part gate. Raw stability gave p = 0.3617, and witness-rate homogeneity gave p = 0.9998. The primary endpoint found that one shared affine reduced-evolution law accounted for an informationally complete set of eight target preparations, with a leave-one-out statistic of 176.21 against a parametric-bootstrap null 95% quantile of 253.40 and a cross-validation p-value of 0.6167. The secondary endpoint found no preparation-dependent heterogeneity among six fitted transverse decay rates, with a homogeneity p-value of 0.4003 and a maximum fractional deviation of 2.5%. The result is evidence of consistency with the preregistered NS1 prediction at the stated experimental sensitivity. It is not unique confirmation of SSAF, and it does not exclude state dependence below the achieved resolution. Standard fixed-context open-system quantum mechanics also predicts consistency with this result. The deposited record includes the manuscript, TeX source, submitted Python and notebook protocol, preregistration and preflight records, raw and processed data, machine-readable results, figures, run provenance, licensing information, and checksums. The hardware run was executed on July 17, 2026, with 7,424 shots per effective circuit and 435.0 seconds of QPU usage.
Preprint; not peer reviewed. We report a hardware-oriented quantum sampling experiment motivated by Hidden Code Sampling (HCS), while explicitly not claiming an end-to-end implementation of the original HCS PeakVerification–SyndromeVerification protocol. A full-width 60-qubit circuit derived from a sparse trivariate-bicycle CSS construction was embedded without swaps on a 108-qubit superconducting processor and compiled to native RX, RZ, and controlled-Z operations. The base circuit contains 180 logical two-qubit rotations and 360 native controlled-Z gates. Local unitary folding produced stress instances with factors 1, 3, and 5, containing respectively 360, 1080, and 1800 controlled-Z gates. A pilot run was used only to identify and freeze an endian-corrected two-feature local parity witness. The confirmatory dataset consists of three completed QPU executions at folding factors 1, 3, and 5. The final analysis includes only execution records whose frozen QASM identities and authorization hashes match the preregistered confirmatory panel. Each science circuit received 10,000 shots, and each of four calibration patterns received 4,000 shots in both the pre- and post-experiment calibration periods. Simultaneous finite-shot lower confidence bounds combine Clopper–Pearson calibration intervals, a pre/post drift hull, inverse assignment-channel correction, an empirical Bernstein bound, and worst-case optimization over the calibration box. The certified margins are 0.2953, 0.2858, and 0.3148 at folding factors 1, 3, and 5, respectively. All three folds pass, and the maximum calibration-parameter drift is 0.0065. Within a preregistered classical attack suite, the conditional operation-count gap is γ = 6.555, above the registered target of 6.0. This result is an operation-count certificate relative to the registered classical attacks. It is not a wall-clock quantum advantage claim, not a full-distribution total-variation certificate, and not an experimental implementation of the exact HCS protocol. Quantum circuits were submitted to the Rigetti Cepheus-1-108Q superconducting processor through the Open Quantum platform, operated by Quantum Rings, using the Open Quantum Python SDK. This acknowledgment does not imply endorsement by Quantum Rings of the findings, interpretations, or conclusions reported in this work. The deposited files include the preprint, LaTeX sources, sanitized confirmatory QASM files, aggregate certificate metrics, integrity manifests, and publication-compliance documentation. Authentication credentials, account metadata, organization identifiers, provider job identifiers, private provider records, and the private audit archive are excluded.
Version update: This record has been updated to remove enabling implementation details pending patent prosecution. Technical implementation is available under NDA. This preprint documents three quantum-native sensing kernels implemented on current IBM superconducting hardware under the Quantum State Command Encoding (QSCE) architecture. Rather than treating a quantum processor as a probabilistic number generator, QSCE treats the device as a command substrate, where quantum state is executable code and collapse is the execution of a control instruction. The work presents three low-qubit, shallow-depth sensing primitives designed to convert small, controlled perturbations into structured, repeatable changes in collapse-band behavior around a deterministic baseline: QMCA — a 1-qubit collapse-response kernel that converts small perturbations into calibrated changes in a non-baseline population while preserving a stable baseline anchor. SQCA — a 1-qubit hybrid-response kernel consistent with superconducting drive behavior, exhibiting a deterministic baseline anchor and a complementary deviation profile under perturbation. EBA — a 2-qubit correlation-based kernel producing a repeatable joint-distribution response signature under perturbation while retaining a deterministic baseline band. All three kernels are validated on real IBM backends (4096 shots per configuration), showing: Deterministic baselines under the null condition, with >99>99%>99 of counts concentrated in a single “quiet” band, and Monotonic, structured deviations in non-baseline states under small perturbations, consistent with a calibrated response signature. Within QSCE, these sensing kernels are treated as command-native primitives: baseline and deviant collapse bands are assigned explicit operational semantics (“no signal,” “signal present,” “threshold exceeded”), so that collapse functions as a decision event rather than merely a readout step. The note contrasts these primitives with bespoke quantum magnetometers (e.g., NV and vapor-cell platforms) and argues that QSCE kernels trade extreme sensitivity for programmability, integrability, and substrate-level command semantics on today’s NISQ hardware. This preprint also situates the sensing kernels alongside recent QSCE benchmarking on IBM hardware (including RCS-style metrics on 16-qubit circuits), highlighting a unified, control-first approach to quantum sensing and computation. Enabling implementation details are withheld in this public version pending ongoing patent prosecution; technical details are available under NDA.
A three-qubit GHZ decoder proposed in the earlier Q1 spin-star preprint transfers a global phase sign to one central qubit. This follow-up traces its implementation on Rigetti Cepheus-1-108Q (centre q107, neighbours q106 and q98) and asks whether its readout can distinguish Theory Φ from standard quantum mechanics. It connects the theoretical preprint, the book The Language of Φ and the programme’s methodological evidence review to the original measurement records. Five completed acquisition stages account for 101,860 physical shots: a 10-shot native timing witness, a 10,240-shot Ramsey measurement of individual and concurrent couplers, 28,082 intermediate calibration and decoding controls, 42,024 shots in the primary GHZ cycle (including 33,792 primary shots in 12 trajectory blocks), and a 21,504-shot frequency pilot. The original Ramsey report figure, full phase-and-contrast scan, intermediate control figures and Part I hardware figures are reproduced. With full-amplitude joint drive the first scan could not identify either phase rate. Reducing the drive to 75% restored measurable responses. In the primary experiment the serial/joint sign-error rates were 12.66%/16.20% for transverse disturbances and 19.59%/21.64% for commuting disturbances. None of the three prespecified criteria for the predicted hardware advantage was met. Carrier retuning improved the worst-case joint inversion from 97/384 to 199/384; the development threshold was 346/384. The published ideal Q1 mapping and a separate standard quantum calculation predict the same 3.522800135 percentage-point transverse advantage at mean jump count π/20. Their difference for this observable is exactly zero. The broader equations reviewed supply no independently specified correction on this register. The release provides original shot records, numerical estimates, program-timing evidence, uncertainty analyses, editable figures and manuscripts, and offline reproduction tools.