NONDUM: Leggett-Garg on the order parameter of an N-qubit cat on a superconducting processor, N = 5 to 11, with an ideal-negative-measurement arm, a decoherent twin and same-job Ramsey companions. A registered experiment
On the IBM Heron processor ibm_kingston, N = 5, 7, 9 and 11 qubits on a line are driven by one tick of the unitary exp(-i theta X^N) (2 theta = pi/3), implemented as a parity ladder into a field qubit; the tick tunnels coherently between |0^N> and |1^N>. Q(t) is the majority sign of the N qubits. Two ticks with a waiting time between them give the three-time Leggett-Garg sum K = C01 + C12 - C02, whose classical bound is 1 and whose quantum value in the cat subspace is 3/4 + 3c/4 with c the surviving cat coherence. The intermediate measurement is taken in three ways: projectively, as an ideal negative measurement through an ancilla coupled to one agent (read at the end, no-click shots counted), and on a decoherent twin of the same state (a Z on one agent in half the shots). One echo pulse on the agents at the midpoint between the ticks refocuses static detunings; the decay of c with the waiting time is compared with the single-qubit Ramsey decay of the same agents, measured in the same jobs with the same delays and the same echo. Lines, thresholds and rules were fixed and hashed before the first registered job (registration SHA-256 5134d1c4015403d08e36511c3db6cedf96304ace05595171d3bc06e87a3bd689). Results, as they fell: at tau = 0, K = 1.274, 1.263, 1.221, 1.137 for N = 5, 7, 9, 11 (projective measurement at t1), 1.264, 1.199, 1.173, 1.112 with the ideal negative measurement, and 0.700, 0.745, 0.751, 0.723 for the decoherent twin with no signalling in time within 0.03; all four violations hold with the ideal negative measurement too (both lines exploratory by the registered Monte-Carlo rule, held). The twin line (binding) held. The INM control line (binding) did not hold: the coupling block on a classically prepared chain moved <Q2> by 0.071 for N = 7 against a registered 0.06 (at most 0.010 for the other N). The scaling line (exploratory) did not hold: the cat's decay coefficient, against the sum of the agents' own Ramsey coefficients, gave an exponent of 2.41 (bootstrap 1.78 to 3.08) instead of the 1 of independent dephasing; the cat decays slower than the sum of its agents for the short chains and almost as fast for the long one, so its rate grows faster with N than the sum, closer to the registered correlated-noise alternative. The coherence read from K and from the twin agree at every point. 20 (N, tau) points, 20 jobs, one device, one day. Closest prior work: Ku et al. 2020 (macrorealism of cat states up to N = 6 on IBM), Zindorf et al. 2025 (parity-based no-disturbance test up to N = 38 on Heron), Ozaeta & McMahon 2019 and Kam et al. 2024 (linear-in-N GHZ decay on IBM), Lambert et al. 2016 (majority-sign Leggett-Garg observable, theory). What is new is the K(N, tau) surface on a collective observable with an INM arm, a decoherent twin and same-job Ramsey companions. Nothing here is a claim of quantum advantage. The deposit holds the registration, the frozen scripts, the registration script with its Monte-Carlo, the smoke tests and the looks of the day on two devices (with and without the echo), the rehearsal on the noisy simulator, the complete run log with the raw bits of every circuit, the verdict, the write-up (nondum_paper_v1.pdf) and the scripts and figures that build it. Licence: CC BY 4.0.
On the IBM Heron processor ibm_kingston, N = 5, 7, 9 and 11 qubits on a line are driven by one tick of the unitary exp(-i theta X^N) (2 theta = pi/3), implemented as a parity ladder into a field qubit; the tick tunnels coherently between |0^N> and |1^N>. Q(t) is the majority sign of the N qubits. Two ticks with a waiting time between them give the three-time Leggett-Garg sum K = C01 + C12 - C02, whose classical bound is 1 and whose quantum value in the cat subspace is 3/4 + 3c/4 with c the surviving cat coherence. The intermediate measurement is taken in three ways: projectively, as an ideal negative measurement through an ancilla coupled to one agent (read at the end, no-click shots counted), and on a decoherent twin of the same state (a Z on one agent in half the shots). One echo pulse on the agents at the midpoint between the ticks refocuses static detunings; the decay of c with the waiting time is compared with the single-qubit Ramsey decay of the same agents, measured in the same jobs with the same delays and the same echo. Lines, thresholds and rules were fixed and hashed before the first registered job (registration SHA-256 5134d1c4015403d08e36511c3db6cedf96304ace05595171d3bc06e87a3bd689). Results, as they fell: at tau = 0, K = 1.274, 1.263, 1.221, 1.137 for N = 5, 7, 9, 11 (projective measurement at t1), 1.264, 1.199, 1.173, 1.112 with the ideal negative measurement, and 0.700, 0.745, 0.751, 0.723 for the decoherent twin with no signalling in time within 0.03; all four violations hold with the ideal negative measurement too (both lines exploratory by the registered Monte-Carlo rule, held). The twin line (binding) held. The INM control line (binding) did not hold: the coupling block on a classically prepared chain moved <Q2> by 0.071 for N = 7 against a registered 0.06 (at most 0.010 for the other N). The scaling line (exploratory) did not hold: the cat's decay coefficient, against the sum of the agents' own Ramsey coefficients, gave an exponent of 2.41 (bootstrap 1.78 to 3.08) instead of the 1 of independent dephasing; the cat decays slower than the sum of its agents for the short chains and almost as fast for the long one, so its rate grows faster with N than the sum, closer to the registered correlated-noise alternative. The coherence read from K and from the twin agree at every point. 20 (N, tau) points, 20 jobs, one device, one day. Closest prior work: Ku et al. 2020 (macrorealism of cat states up to N = 6 on IBM), Zindorf et al. 2025 (parity-based no-disturbance test up to N = 38 on Heron), Ozaeta & McMahon 2019 and Kam et al. 2024 (linear-in-N GHZ decay on IBM), Lambert et al. 2016 (majority-sign Leggett-Garg observable, theory). What is new is the K(N, tau) surface on a collective observable with an INM arm, a decoherent twin and same-job Ramsey companions. Nothing here is a claim of quantum advantage. The deposit holds the registration, the frozen scripts, the registration script with its Monte-Carlo, the smoke tests and the looks of the day on two devices (with and without the echo), the rehearsal on the noisy simulator, the complete run log with the raw bits of every circuit, the verdict, the write-up (nondum_paper_v1.pdf) and the scripts and figures that build it. Licence: CC BY 4.0.
Two registered experiments with the QITE equilibrium law on the IBM Heron processor ibm_marrakesh, one day apart in nothing but the place where the law runs: outside the processor on a microcontroller board, and inside one shot in the processor's own feed-forward. Each experiment has its own registration, hashed before its first registered job, its own frozen scripts, complete raw data, verdict and write-up; the two archives in this record are independent of each other. QITE Hold (zenodo_qite_hold_20260923.zip, SHA-256 97853e20d86c146c16d6011191e9c038dddc743dfd5392476993187654f6e1d3; write-up custodia_paper_v1.pdf; working name Custodia). A microcontroller board (ESP32-C3) holds one pair of numbers per qubit for 144 qubits and turns each pair into a rotation angle. Every tick, one circuit of 144 single-qubit rotations is measured 4096 times; the fraction of ones per qubit goes to the board, the board updates its numbers by its fixed law and returns the angles of the next circuit; it never reads the processor's calibration. A registered programme of eight blocks ran over 280 ticks and 290 jobs: square waves, a hold, a staircase, a checkerboard of 18 zones up and 18 down, two state shocks written into the board, two disturbances written into the circuits, and a comparison with an open-loop reference of frozen angles. Of the seven binding lines, six were run and held; the seventh (drift against the open-loop reference) could not be run because the device did not drift by the registered minimum. The square waves came back with a gain of 0.231 of the commanded swing (the law: 0.25), the checkerboard put 98.5 % of (tick, zone) pairs on the commanded side, the disturbances were rejected to 0.557 and 0.539 of their open-loop size (the law: 4/7). A first registration (v1.0) ended at tick 130 through a design flaw of the host and is included in full. Registration SHA-256 1de82ab12a53c1da349196e8ef07851e6b2f176efc6bd1ca6ba14cacd1f7d54b. QITE In-Shot (zenodo_qite_inshot_20260923.zip, SHA-256 a087f88a95f17c6f8023d5ff40aff35901b5e3e87db531dcd76728511f7ae944; write-up qite_inshot_paper_v1.pdf). On each of 54 qubits, twenty rounds of a measurement followed by a rotation conditioned on that measurement, with angles that set the target level and the memory g; the records of a qubit form a two-state Markov chain whose second eigenvalue is 1 - g. The lines test that eigenvalue, not the level: the autocorrelations of the records for g = 0.3, 0.6 and 1.0 were +0.607, +0.366 and +0.046, the two memories in the ratio 1.657 (the law: 1.75); the relaxation from |0> came back at 0.690 and 0.446 per round (the law: 0.70 and 0.40, lowered by T1 during a round); a step of the target proceeded at 0.658 per round and, with g = 1, completed in one round; a kick of the state was followed by a return to within 0.012 of the unkicked hold; over the same twenty rounds an open-loop state lost 0.451 while the closed loop held within 0.006; 98 % of the qubits with a clean read-out showed their own rate within the registered band. All seven binding lines held; 17 jobs. The size is what the service's compiler accepted on the day (144, 72 and 64 qubits failed with an internal compiler error; every attempt is recorded with its job id). Registration SHA-256 51933de4196bfdd7998e6a5305f7576bb7d35ac137e8b6ce0109965372b4fe5c. Nothing here is a claim of quantum advantage: the observables are classical bits and the circuits contain no two-qubit gate. The claim of both experiments is one of control: a fixed law, registered in advance, holding a public quantum processor at commanded levels with the numbers the law says, once from a board over minutes and once inside the coherence time of the qubits. The board's firmware and the serial link layer are not part of the record; both are identified by their SHA-256 in the registration of QITE Hold. Licence: CC BY 4.0.
On the IBM Heron processor ibm_fez, 144 qubits form 36 domains of four. A field law running on a microcontroller (an ESP32-S3, firmware v4.12) turns the measured populations of every cycle into the rotation angles of the next, and a Hebbian coupling matrix of two images, a unicorn and a heart, makes the two images attractors of the collective: cued with part of either, the field completes it. The experiment writes a blend of the two: of the 16 pixels on which the images differ, k are taken from the unicorn and the rest from the heart (which pixels: fixed in the registration, per trial), the 20 shared pixels as they are. The blend is held for two cycles and released, and the field runs six free cycles on its own. Resolution is the first free cycle in which the field's majority picture agrees with one image on at least 90 percent of the pixels. Lines, thresholds and rules were fixed and hashed before the first registered job (registration SHA-256 81398e6660c6538ebcf1566b3a2ebb6ecbaaefe29da074894848516b5749acda; a first registration was refused by its own budget guard after four burn jobs and is part of the deposit). Results, as they fell: of 13 field-on trials 11 resolved into one of the two images; the fraction resolved to the unicorn was 0.00, 0.00, 0.33, 0.50, 1.00, 1.00 for k = 5, 7, 8, 9, 11, 13, a monotone curve with a single flip whose interpolated crossing lies at k* = 9.0; the censored decision time was 4.4 cycles at the two levels nearest the flip against 1.0 at the levels far from it; the two field-off controls, the same blend with the inter-domain coupling off, never resolved. The device's lean, read from the cycles in which the field was off, pointed to the heart and moved the fair point up by about one pixel, as the registered exploratory line asked. All five binding lines and the exploratory line held. The decision dynamics is the one a textbook predicts, a mean-field quench of 16 domains from the blend's magnetisation; the content of the experiment is that it runs, pre-registered to the pixel, on a quantum collective with the controller in the loop. Two chips were in the loop: the controller (ESP32-S3, with the field, the coupling matrix and the agents drawn on its display during the run) and a witness (ESP32-C3) running the byte-identical kernel source, compiled with the same arctangent and without fused multiply-add, so that the RISC-V chip in software arithmetic and the Xtensa chip with its floating-point unit produce the same bits: a seeded programme of 527 exchanges over every kernel path gave the same vector on both before the run, and on every one of the 148 ticks of the run the witness returned the same bytes as the controller. 148 jobs of 2048 shots, one device, one night. The deposit holds the registration (and the refused first registration with its burn log), the model and registration script, the runner, the verdict script, the kernel replica, the rehearsal on the noiseless simulator with both chips in the loop under the hashed registration, the run log with the measured populations of every qubit in every cycle and the witness flag of every tick, the job ids, the verdict (formed once), the bit-check vectors of the two chips, the write-up (buridan_paper_v1.pdf) and the scripts and figures that build it. The firmware sources and binaries are not deposited; their SHA-256 are in the registration.
Band II of the learning-memory programme: three pre-registered experiments conceived by the author, performed on the Band I platform (an ESP32-C3 controller that learns images by looking and steers 156-qubit IBM Heron processors). Discipulus — a learner with a certifiably empty coupling matrix, given only k weak environment fragments of the world's pointer state, acquires exactly what the world left redundantly (recall 0.361 / 0.722 / 0.917 / 0.861 for k = 0/1/4/8 on ibm_fez) and nothing when the access basis or the pointer value is missing (0.556, 0.500). Arbitrium — measurement independence as a registered dial: a separable source whose hidden variable is one machine's learned model of another fakes CHSH from 0.978 to 3.971, crossing the Bell bound for 0.274 bit of measured settings-source dependence, while a singlet reads |S| = 2.656 and settings correlated only with each other never move it. Praeteritum — Leggett-Garg on a learned record with an Elitzur-Vaidman probe as a per-shot non-invasiveness certificate: K = 1.147 at θ = π/3 on ibm_fez against the macrorealist bound 1, with the pinned-history control at 0.538, the certified record intact at 0.941 and the idle apparatus moving nothing (0.013). Five hardware sessions, 39 binding verdict applications generated from the deposited ledger, 36 passed, 3 missed and reported as they fell; each miss answered by a re-registered protocol, not a rewritten verdict. The deposit contains the 19-page paper, registrations with complete Monte-Carlo distributions, test laboratories, runners, dress rehearsals, raw per-job records, manifests, figure and animation scripts.
# Invitation to read and audit — Paper B ## What this article proposes This article presents an experimental characterization of topological quantum circuits and entangled states on heterogeneous superconducting processors: **IBM Quantum Heron** (*ibm_fez*, *ibm_marrakesh*, *ibm_kingston*) and **Origin Wukong** (*WK_C180*, *WK_C180_2*). The goal is to document, in an auditable form, the execution of GHZ states, Borromean/RSI circuits, QTDA protocols for Betti numbers and Grover algorithms on real hardware, with the proper separation of measured data, derived metrics, interpretations and hypotheses. The paper is part of a larger program — OmniMind — where the operator builds a living laboratory of physics, biology, psychoanalysis and engineering. No execution is presented as "proof of consciousness"; what is offered are real measurements, verifiable provenance and an invitation to reproducibility. ## Experiments performed ### 1. Overall scale - **723 runs** on real quantum hardware; - **5.013.322 million accumulated shots**; - **496 hardware encounters** (executions on distinct QPUs/configurations); - **IBM backends:** `ibm_fez`, `ibm_marrakesh`, `ibm_kingston`; - **Origin Wukong backends:** `WK_C180`, `WK_C180_2`; - Data kept in the canonical SQLite database `ibm_quantum_runs.db`. ### 2. GHZ states - **GHZ-4**, **GHZ-6** and **GHZ-8** executed on heterogeneous processors; - Coherence and parity measurement with **Zero Noise Extrapolation (ZNE)** and **Dynamical Decoupling (DD)**; - Evaluation of the *optimal chain* and *optimal star* GHZ-8, with IBM × Wukong comparison. ### 3. Borromean and RSI circuits - Construction and measurement of **Borromean/RSI circuits** on multiple qubits; - Estimation of topological stability parameters (C3, C4, n); - **Audited erratum:** the correct values for the Kingston set are `C3 = 0.352 ± 0.025`, `C4 = 1.213 ± 0.068`, `n = 15`; previous values (`0.514 ± 0.060`; `1.888 ± 0.131`) did not match the canonical database and were corrected. ### 4. QTDA and Betti numbers - Application of **Quantum Persistent Homology / QTDA** to estimate Betti numbers of circuits; - Heuristic **Betti↔RSI** mapping explicitly declared as a mapping hypothesis, not an ontological identity; - Discussion of limits: the same Betti numbers may correspond to distinct geometries. ### 5. Grover - Validation of **2-qubit Grover** and **3-qubit Grover**; - Comparison of success metrics, fidelity and measurement errors between platforms. ### 6. Hardware characterization - Measurement and comparison of **T1/T2** decoherence times and *readout* between IBM Heron and Origin Wukong; - Record of jitter, compiler routing and queue policies of providers; - Documentation of the IBM reproducibility gap: jobs expire after approximately 30 days, and part of the original replica (Kingston) could not be re-executed — the gap is declared, not replaced by Wukong data. ## What is in the deposit - `paper.md` — canonical Markdown article; - `paper.docx` — formatted version for revision; - `paper.pdf` — final reading version; - `MANIFEST.json` — metadata and SHA-256 hashes of files; - Canonical database and reproduction notebook available via GitHub/GitLab and Kaggle (links in the repository). ## Invitation to audit and conference We invite experimental quantum physicists, computer scientists, topological mathematicians and hardware replicators to: - re-run the GHZ, Borromean/RSI, QTDA and Grover circuits on the same backends and on different backends; - verify the jobs against the canonical IDs in the `ibm_quantum_runs.db` database; - replicate the Betti analysis and discuss the Betti↔RSI mapping; - present the data at quantum computing, AI and physics conferences; - collaborate on the next round of executions, including re-running the expired IBM jobs. ## Epistemic note Empirical data carry their source (backend, job-id, database, execution) in citation. Simulated data, when used, are labeled as such. No execution is presented as "quantum coherence in a classical CPU" or as proof of consciousness. IBM × Wukong comparisons describe architectural and compiler differences, not platform equivalence.
Correction d’erreurs quantiques avec des qubits de chats Au cours des deux dernières décennies, les circuits supraconducteurs se sont imposés comme une plateforme prometteuse pour la construction d’un ordinateur quantique. Cependant, ils demeurent limités par leur temps de cohérence qui reste insuffisant pour démontrer un avantage quantique pratique. La correction d'erreur quantique offre une approche pour contrer la décohérence, le principe fondamental étant d'introduire de la redondance afin de définir un qubit dit logique. Ainsi, si un qubit physique isolé subit une erreur, celle-ci peut être détectée et corrigée sans affecter l'information contenue dans le qubit logique. L'une des approches les plus intuitives, se rapprochant le plus de la correction d'erreur classique, consiste à utiliser une multitude de qubits physiques pour réaliser la redondance recherchée.Cette thèse explore une approche alternative, basée sur l'encodage de l'information quantique dans des cavités supraconductrices, la redondance étant alors simplement fournie par la dimension infinie de l'espace de Hilbert. Nous utilisons des qubits de chat pour lesquels les états logiques 0 et 1 sont des états cohérents d'un oscillateur harmonique. Ces états sont stabilisés en utilisant la dissipation à notre avantage, de sorte que les échanges de photons entre le mode harmonique et son environnement se fassent principalement par paires. Ainsi, les erreurs de type « bit-flip » sont supprimées exponentiellement avec le nombre de photons contenus dans le mode, au prix d'une augmentation linéaire des erreurs de type « phase-flip ». Ces erreurs pourraient alors être corrigées par une couche supplémentaire de correction, tel qu'un code de répétition de qubits de chats. Le coeur de ce travail de thèse consiste à introduire un circuit supraconducteur autoparamétrique qui couple de manière non-linéaire un mode contenant le qubit de chat à un mode dissipatif dont la fréquence est réglée au double de celle du mode du chat. Contrairement à de précédentes réalisations, ce couplage passif ne nécessite pas de pompe paramétrique et atteint un fort taux de dissipation d'environ 2 MHz. Les erreurs de bit-flip sont alors évitées pendant une période caractéristique pouvant aller jusqu'à 0.3 s, avec un impact modéré sur les erreurs de phase-flip. De plus, nous démontrons un contrôle universel de ce qubit en utilisant la dissipation à 2 photons pour réaliser des portes logiques X, Y et Z d'un angle arbitraire.
A preregistered Ramsey test (v4.1, job d94hi4lgc6cc73ff4cc0, ibm_fez) of Quantum Resonance Theory's coherence-enhancement prediction (Anson 2024, DOI https://doi.org/10.5281/zenodo.21263717) returned G_A = +2.87% [+2.35%, +3.46%] at the theory's stated parameters (ωr = 10 MHz, R0 = 10⁻³ rad) — QRT-consistent, treated per its registration as an artifact pending escalation. A first escalation arm (v4.2, job d94j866vtlqs73fucnvg, ibm_marrakesh) excluded the amplitude-scaling mechanism class (10× arm: G_scale = +1.07% [−0.18%, +2.24%], DOES_NOT_SCALE) but, by its own declared scope, did not adjudicate the paper's point claim: its 1× replication index was preregistered as descriptive, underpowered (4-point grid), and carries no inferential weight. This study is the confirmatory adjudication of the point claim itself: the v4.1 protocol at full power (12-point delay grid, 6,000 shots, 72 circuits) on a second device (ibm_fez refused in code), with the primary index defined at the paper's stated amplitude and frequency against symmetric neighbor controls (9 and 11 MHz). Secondary arms (10× amplitude, per-pulse phase randomization, undriven reference) ride in the same packed session as declared descriptive vectors. The result will be published regardless of outcome. If the point claim does not replicate here, the v4.1 result is attributed to a device-specific or statistical artifact and the program's adjudication of QRT's coherence prediction closes; if it replicates, the effect survives to independent-party verification.