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.
🚀 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.
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.
We implement and benchmark on IBM Quantum hardware the circuit family proposed by Violaris for estimating operational inter-branch communication witnesses, defined as correlations in classical measurement records produced by compiled Wigner's-friend-style circuits. We realize a five-qubit instance of the protocol as an inter-register message-transfer pattern within a single circuit, rather than physical signaling, and evaluate its behavior under realistic device noise and compilation constraints. The circuit encodes branch-conditioned evolution of an observer subsystem whose dynamics depend on a control qubit, followed by a controlled transfer operation that probes correlations between conditional measurement contexts.
Executing on the ibm_fez backend with 20000 shots, we observe population-based visibility of 0.877, coherence witnesses of 0.840 and -0.811 along orthogonal axes, and a phase-sensitive magnitude of approximately 1.17. While the visibility metric is insensitive to some classes of dephasing, the coherence witnesses provide complementary sensitivity to off-diagonal noise.
This work does not test or discriminate among interpretations of quantum mechanics. Instead, it provides a reproducible operational constraint pipeline for evaluating detectability of non-ideal channels relative to calibrated device noise.
Within the familiar circuit-based quantum computational setting, we introduce and analyze a toy model of a quantum physical device capable of internal, self-referential deliberation. The key idea is to represent ``deliberation'' as a coherent iterative branching process, in which competing branch-dependent system evolutions are maintained in superposition, with additional control and memory registers recording branch histories, and the policy register adaptively biasing subsequent development. We provide explicit quantum circuit realizations and carry out detailed step-by-step derivations of the entangled control--memory--system--policy dynamics. We carefully distinguish between internally adaptive and internally reinforced deliberations, proposing the architectures for both, and briefly discuss categorical and controlled--Stinespring reformulations, as well as their conceptual implications. The primary construction models a memory-driven deliberation where the policy update depends on which actions were taken, not on their results. We also present a simple extension that allows for minimalistic, outcome-driven policy updates, implementing a coherent feedback loop that steers the system toward a target state regardless of initial branch-dependent evolution. This loop can be interpreted as a quantum autopilot or search-and-rescue mechanism, illustrating how a device can autonomously correct and optimize its internal strategy in superposition. Finally, we briefly consider various implementations of a dialogue that may take place between two deliberating machines. Taken together, this frames the proposed model as a plausible setting for exploring how such devices may maintain multiple alternatives in parallel, while performing an internal decision-making process through coherent branching, entanglement, adaptive policy updates, and policy-driven self-modifying unitary dynamics.
An autoregressive language model, read at the token-commit step, is a near-fully-inspectable classical bounded-inference substrate: the competing-route distribution over candidate tokens — the live propensity before it resolves into one committed answer — is read directly from the output logits. Used as a measurement model, it lets each structural signature of quantum measurement be tested one by one, and the genuinely-quantum residue isolated by its absence. The substrate reproduces the phenomenology of quantum measurement from classical self-conditioning — back-action, non-commutativity (order effects), entropy-collapse on commitment, a substantial Busemeyer–Wang QQ-structure (order-effect difference q not distinguishable from the parameter-free quantum value 0; pooled across eight de-saturated base models over five vendors and four architectures, N=96, q=-0.003, 95% CI [-0.025, +0.019]), interference, einselection, an Aharonov-style weak-versus-strong asymmetry, and measurement-mode dependence — but not the quantum core: genuine contextuality is robustly absent (an analog Contextuality-by-Default cyclic-4 analysis gives CNT < 0 in every model and scenario), and no phase/coherence is demonstrated. A controllable analog Bell-loophole testbed makes each premise's price visible within one substrate (S_analog ~ 2.00 with all loopholes closed; ~ 2.8 on opening locality or measurement-independence), and a within-substrate timeline reads the propensity resolving across network depth, including a maximally-contested case whose outcome is never created. The order-effect incompatibility is shown to be a measured, correctly-signed classical-complementarity dial that falls as the readout partition refines. Positioning. The contribution is the demarcation itself, with statistics, made possible by an inspectability no veiled (physical or psychological) substrate allows. It instantiates beim Graben & Atmanspacher's classical complementarity and the Busemeyer–Wang / Pothos quantum-cognition program empirically; it makes no claim about physical reality. Companion papers (Friction Theory series): Paper 1 — Friction as the cost of probabilistic computation (10.5281/zenodo.20012654); Paper 10 — Race all the way down/up (10.5281/zenodo.20014567); Paper 21 — LLMs as a measurement model for bounded-decision cognition (10.5281/zenodo.20562416); Paper 28 — Dread without a dreader (10.5281/zenodo.20690747).Paper 18 in the Friction Theory paper-series. Submitted as a careful, honestly-scoped empirical demarcation (target venue: Entropy, Quantum Information / quantum-cognition & foundations-of-measurement). v2 (August 2026) — prior-art revision. The paper describes competition resolving to a commitment and cited none of the tradition that formalised it. Luce (1959) for the choice axiom the softmax implements, Ratcliff (1978) for evidence accumulated to a bound, and Usher and McClelland (2001) for the leaky competing accumulator are now credited at the point where the reading is made, with the limit stated: the estimators here are computed on a language model's output distribution, and the parallel is why the measurement was worth making rather than evidence of a shared mechanism. Editorial pass. Earlier versions remain in the version history.
Abstract We report a hardware implementation of a reversible imprint-retrieval cycle motivated by the Quantum Memory Matrix (QMM) framework. Using IBM Quantum backends, we realize five circuits that scale from a minimal three-qubit memory cell to a five-qubit dual-cycle architecture, including variants with controlled phase evolution and deliberate perturbation. Because the circuit readout is based on computational-basis bit strings, the primary experimental metric is the basis-matched retrieval probability, Pret=Nmatch/Nshots P ret = N match / N shots , reported together with Wilson-score 95% 95 % confidence intervals, Pearson correlations, and mutual information between field and output qubits. Across the five experiments, Pret P ret ranges from 0.487±0.017 0.487 ± 0.017 in the evolution stress test to 0.732±0.012 0.732 ± 0.012 in the baseline three-qubit cycle, with the dual-cycle and controlled-error variants remaining near 0.70 under realistic device noise. These results provide a proof-of-principle demonstration that finite-dimensional quantum registers can store and return basis-level information through local unitary gates. The experiments therefore support the operational imprint-retrieval primitive underlying QMM, while also identifying full state tomography as the next step toward verifying phase-coherent state recovery.