Matched Presents, Different Futures: History-Dependent Relational Response Geometry on a Superconducting Quantum Processor

Can systems matched on a declared present nevertheless show different future responses because they retain different relational organisation? We test this in a six-qubit hybrid quantum-classical architecture on IBM Heron hardware. Written and sham preparations use exactly the same five coupling values and the same number of native two-qubit operations; only the edge assignment differs. Under a frozen preregistered decision rule with randomised block orders, matched fast preparations displayed different later directional responses when the prepared slow classical relational configuration differed. Because the full-sample cosine alignment and norm-based retention estimates sat outside their original percentile intervals, a post hoc audit was performed from the sealed raw-count archive. That audit is reported alongside, and does not replace, the frozen rule. Claim boundary. The result is real under its frozen analysis. It is not autonomous cross-job quantum memory, and it is not evidence of a hidden quantum degree of freedom persisting between jobs. The classical coupling configuration is part of the preparation and is named as such throughout. No claim is made about quantum coherence surviving between executions. This deposit contains the manuscript in PDF and DOCX form together with the complete evidence archive: protocol freezes, compiled QPY circuits, inspection tables, randomised block orders, backend snapshots, raw-count files for both runs, IBM job ledgers, point estimates, blockwise endpoints, the frozen decision JSON, an artefact inventory and a checksum ledger.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-13
DOI
https://doi.org/10.5281/zenodo.22736917
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Matched Presents, Different Futures: History-Dependent Relational Response Geometry on a Superconducting Quantum Processor

Joel Pearcey
Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
preprint

Matched Presents, Different Futures: History-Dependent Relational Response Geometry on a Superconducting Quantum Processor

Joel Pearcey
preprint en

Abstract

Can systems matched on a declared present nevertheless show different future responses because they retain different relational organisation? We test this in a six-qubit hybrid quantum-classical architecture on IBM Heron hardware. Written and sham preparations use exactly the same five coupling values and the same number of native two-qubit operations; only the edge assignment differs. Under a frozen preregistered decision rule with randomised block orders, matched fast preparations displayed different later directional responses when the prepared slow classical relational configuration differed. Because the full-sample cosine alignment and norm-based retention estimates sat outside their original percentile intervals, a post hoc audit was performed from the sealed raw-count archive. That audit is reported alongside, and does not replace, the frozen rule. Claim boundary. The result is real under its frozen analysis. It is not autonomous cross-job quantum memory, and it is not evidence of a hidden quantum degree of freedom persisting between jobs. The classical coupling configuration is part of the preparation and is named as such throughout. No claim is made about quantum coherence surviving between executions. This deposit contains the manuscript in PDF and DOCX form together with the complete evidence archive: protocol freezes, compiled QPY circuits, inspection tables, randomised block orders, backend snapshots, raw-count files for both runs, IBM job ledgers, point estimates, blockwise endpoints, the frozen decision JSON, an artefact inventory and a checksum ledger.

Zenodo (CERN European Organization for Nuclear Research)
Peace, Justice and strong institutions
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.