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

QITE DIAL: measurement-altered quantum criticality with an adjustable measurement strength, on rings of 12 and 20 superconducting qubits. A registered experiment

Bernd Westrick

Published Nov 13, 2026• 0 citations
Publisher

Abstract

A quantum critical state has correlations on all length scales, and theory predicts that measuring part of such a state weakly, and keeping one outcome, changes the power law with which the correlations of the rest decay, continuously with the strength of the measurement (Garratt, Weinstein and Altman, Phys. Rev. X 13, 021026; Weinstein et al., Phys. Rev. B 107, 245132; Murciano et al., Phys. Rev. X 13, 041042). For the critical Ising chain a measurement of the transverse field and a measurement of the bond energy, which are exchanged by the Kramers-Wannier duality, move the exponent in opposite directions. A recent roadmap for Rydberg arrays (arXiv:2506.21963) describes the experimental validation as an open problem; a literature search on the day of the run found no reported observation. This deposit holds a registered experiment on a public quantum processor. On the IBM Heron processor ibm_fez a ring of 12 qubits (one hexagon of the lattice) and a ring of 20 qubits (the perimeter of two adjacent hexagons) are prepared near the ground state of the critical transverse-field Ising ring with N/2 layers of ZZ and X rotations (144 and 400 CZ gates, every CZ twirled) and read out in four settings. The strength of the measurement is a dial that is turned after the fact: on qubits that are read anyway, a weak measurement with a selected outcome is identical to a weighting of the projective shots with exp(strength x sum of the outcomes), so every strength is evaluated from the same shots, without ancilla qubits, mid-circuit measurements or discarded shots. The registered quantity is the dial D: the slope of the correlations against distance, on logarithmic axes, under the field measurement minus the slope under the bond measurement. The rings were chosen at submission by a registered rule from the calibration of the moment. Lines, bands, the layout rule and the analysis were fixed and hashed before the first job (registration SHA-256 25b81a10fe1be08bfc0a700711724cdbe30ec87a3439a906800340f094b38fb3). Results, as they fell: 128 circuits, 1,032,000 shots, 8 jobs run back to back in five minutes, 288 s of QPU time. At strength 1.0 the dial is D = -0.357 +- 0.015 on 12 qubits and -0.358 +- 0.017 on 20 qubits (exact values of the critical ring: -0.328 and -0.333), more than 20 standard errors from zero and the same on both rings; at the four registered strengths it lies within two standard errors of the exact value; without weighting it is +0.026 +- 0.013 and -0.005 +- 0.014. A fault-free 20-qubit ring 5 % off the critical field would give -0.20 or -0.50, eight to ten standard errors away. All eight binding lines and the three attestation lines held. What is not shown: the two slopes taken separately. The faults of the processor attenuate the correlations to between 20 and 57 % of their exact size, the weighting also filters faulty shots, and the field measurement alone does not show the predicted steepening; that the faults cancel in the difference is taken from a noise model, and supported by the two rings, whose states are attenuated very differently, giving the same dial. At strong weighting the dial is about 0.03 deeper than the exact value on both rings, and the ratio of the two correlation curves lies a few per cent below the exact ratio. The strength is applied in the analysis; no weak measurement took place on the processor. The rings have 12 and 20 sites, the prediction tested is the exact one for these sizes, and nothing here is a claim of quantum advantage. The deposit holds the registration, the module with the angles, the layout rule, the circuits, the estimator and the lines, the session script, the verdict script, the registration script with its Monte Carlo, the script of the noise models and the eight model distributions, the script and the log of a preliminary look on the device, the session log with the bits of every shot of every circuit, the verdict (formed once), the ledger, a rehearsal of the whole session on the noiseless simulator under the hashed registration, the write-up (qite_dial_paper_v1.pdf) and the scripts and figures that build it. Licence: CC BY 4.0.

DOI
10.5281/zenodo.24208006

Related papers

QITE on a superconducting processor: a microcontroller board holds a 144-qubit field for 280 ticks (QITE Hold), and the same equilibrium law runs inside one shot on 54 qubits (QITE In-Shot). Two registered experiments

Bernd Westrick

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.

•Sep 23, 2026•0 citations

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

Bernd Westrick

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.

•Oct 25, 2026•0 citations

Quantum Computing on the Sixty-Ring: Every Gate a Setting, Every Gradient a Quarter Turn, and a Checksum on the Classical Half

Neal Strassner

Every tool of quantum computing is one of three moves on two sliding rings marked with the sixty last digits of the Fibonacci numbers. A setting is a value read off one placement of the rings. A fold is a product turned into a sum by the half-angle law. A turn is a shift of position that carries a digit with it. Every gate is a setting, its entries cos(θ/2) and sin(θ/2) the half-distances of the rings at crossing separation θ, and the Hadamard, CZ and CNOT are quarter and half turns. Born's rule is the fold, amplitudes read at position k and expectation values at 2k. Every gradient is a quarter turn, because the parameter-shift rule is the ring's derivative law, its two shifts the ×7 and ×3 laws, with four eighth turns where a Givens gate needs them. A complete variational run is worked on a two-qubit number-conserving Hamiltonian. The energy is the ring shifted ten positions, the ground state the vesica setting at position 20, the optimizer three readings and a gnomon with nothing to tune, its convergence one line. Noise is the radius of the rings, and the square inside the ring, the stabilizer octahedron, says when the noise has cost a magic state. Phase estimation, Shor's classical end, Grover's search, Trotter chains, QAOA, Bell tests, teleportation, error mitigation, benchmarking and the [[4,2,2]] and [[5,1,3]] codes each reduce to the same three moves, forty tools on one page, and because every unitary is a finite product of rotation gates, the list is open and the three moves are closed. A checksum rides every classical number of the loop, the digits under the crossings on each setting, the addition law on each sum, the quarter-turn law on each gradient, the symmetry identity ⟨XX⟩ = ⟨YY⟩ on the measured data with its alarm threshold read off the setting, every one-, two- and three-bit upset of a 32-bit phase word and every burst of up to fifteen bits caught by three rings in lockstep, every corruption of any kind caught by the ladder, and the decoder table of the perfect code built on the four quarter turns of the net, any four simultaneous faults in an entry restored. The guard stands on every classical register of the loop, and the code space stands on the qubits. Thirty-one jobs on three IBM machines close the paper. A clean run on a 156-qubit machine had every compiled angle certified, the injected bit flip flagged at over a hundred standard errors, the clean checksum inside its line, the radius reading the noise, and the Bell value above 2, and one bit flipped in a phase word before submission, four ways, caught by the guard every time, turning the ground state into the top of its number sector and, from the entangler word, into the top of the whole spectrum when sent unguarded. The same words were corrupted up to all ten at once, by any change up to every bit inverted, and read both ways in four runs, unguarded and through the guard, and every setting word of a many-qubit tower was corrupted past any real error rate, caught and rebuilt in place, and read right on the machine. Every number is verified by the script in the appendix on explicit matrices and states, and the hardware readings are checked against the result files.

•Oct 10, 2026•0 citations

NUNTIUS: an Everett-phone test on a public quantum processor. The sensor in the world where nothing was fired does not feel the drive fired in the other. A registered experiment

Bernd Westrick

If quantum mechanics had a state-dependent, nonlinear term of the kind proposed by Kaplan and Rajendran (Phys. Rev. D 105, 055002), the two outcomes of a measurement would not be closed to each other: what is done in one outcome would appear in the other as a weak background field, a possibility first noted by Polchinski for Weinberg's nonlinear theory (the "Everett phone"). In linear quantum mechanics, in any interpretation, the effect is exactly zero. Laboratory experiments have bounded the electromagnetic parameter at the level of 10^-11 to 10^-12. This deposit holds a test of the same effect in which the measurement, the sender and the receiver are two qubits and the control electronics of one publicly accessible processor. On the IBM Heron processor ibm_fez a switch qubit is measured inside the circuit. If it reads 1, the controller fires N signed pi pulses (N = 200 to 1600) on a sensor qubit 25 edges away; if it reads 0, the sensor rests for exactly the same time on the y axis of its Bloch sphere, where a small rotation about x appears linearly in <Z>. A leak would rotate the resting sensor by epsilon p N pi with the sign of the drive, p being the Born weight of the outcome in which the drive was fired (1/2 and 2/3). The session has four arms: the measurement arm; a classical twin in which the switch is prepared instead of being in superposition (the same pulses and feed-forward, no other outcome); a sender check; and the response of the sensor to a real rotation injected over the window, measured in the same session. The sensor and the switch were chosen at submission by a registered rule from a scan job. Which of the two sign labels is the + sign was sealed before the first job and opened after the lines were formed. Lines, thresholds, the layout rule and the analysis were fixed and hashed before the first job (registration SHA-256 fbdec5d40b76af84b1fc0d98f71ee0d534f454a1ea96052ba5059077ce16d134; a first version was replaced before any job ran under it and is part of the deposit). Results, as they fell: 1060 circuits, 844,000 shots, 11 jobs run back to back in five minutes. The slope is epsilon = (+0.8 +- 4.5) x 10^-6, 0.18 standard errors from zero; |epsilon| < 8.2 x 10^-6 (90 %). The silent sender, the classical twin and the split by the preceding shot are flat at all eight settings (at most 1.9, 1.7 and 1.3 standard errors against a registered limit of 4), the sender check separates the two signs (0.82 and 0.65 against a floor of 0.5), and the response of the sensor was 0.90, 0.86, 0.79, 0.62 for the four windows. All nine binding lines and the four attestation lines held. The bound is five to six orders of magnitude weaker than the laboratory bounds on the same parameter and competes with none of them. What the experiment adds is the place: the test runs on a public device, the sensor listens within microseconds of the measurement, and anyone with access to such a processor can run it again. Nothing here is a statement about the existence of other worlds. The deposit holds the registration and its superseded first version, the shared module with the circuits, the design and the estimators, the model and registration script, the runner, the verdict script, the logs of two preliminary looks on the device, the rehearsal of the whole session on the noiseless simulator under the hashed registration, the session log with the bits of every shot of every circuit in the order of execution, the seal file, the verdict (formed once), the ledger, the write-up (nuntius_paper_v1.pdf) and the scripts and figures that build it. Licence: CC BY 4.0.

•Nov 12, 2026•0 citations

Readable Quantum Dynamics Without Error Mitigation: Dual-Unitary Chains up to 91 Qubits and 3D Lattice Tests on IBM Heron Devices

TN.Holdings

Paper 7 of this series carried user-written two-dimensional circuits through an operating layer (psf-os) that reads no calibration-quality number, adds its own controls to each job and applies no error mitigation. Here the same policy is carried to a chain that no fixed shape can hold and to three-dimensional lattices that the heavy-hex coupling graph cannot embed. IBM's dual-unitary kicked-Ising chain (arXiv:2411.00765) at its largest width, N = 91, read raw on ibm_marrakesh: the decay rates agree with cos 2h at all three h (largest |k - cos 2h| 0.0037) and every depth up to t = 24 (2 205 CZ) is readable, on a chain placed by a fixed rule round the failed elements; a second run on ibm_fez, with the ruler h = 0 in both jobs, again found all three rates in agreement, while h = 0.15 sat +0.0037 above cos 2h on both devices. In three dimensions, a place rule that judges the place with the highest own mirror replaced a gate that had refused every place at 48 and 72 sites; kicked Ising on 4 x 4 x 3 read at every angle and depth, Heisenberg XXX on 4 x 2 x 2 read with a Neel retention of 0.72 to 0.51. Two new layouts cut the transport CZ of the Heisenberg step by 42%, and were compared with the old one on the same places of two devices; an Ising layout with 46% fewer CZ came closer to the exact answer at the judged 4 x 2 x 2 place but farther on 4 x 3 x 2. On the way we changed our main measure for such comparisons, from the retention of an order parameter to a normalised per-site error, because noise that slows the dynamics can raise the retention. Pair creation in the Schwinger model read in 16 of 18 circuits and beat both trivial guesses in all 18. A light-cone test failed as predicted: every front arrived late, while the shape of the spread was reproduced. Every device result re-scores to the same numbers from its committed raw counts (23 of 23). No quantum advantage is claimed: every answer is computed exactly on a classical machine.

•Nov 11, 2026•0 citations

Readable Depth Without the Calibration Map: Formula Placement on Heavy-Hex Devices, and a Defect the Calibration Does Not Show

TN.Holdings

Compilers for today's quantum processors choose a layout by reading the day's calibration. We ask how deep a circuit stays readable when no placement reads a quality number. We place a ring of CZ gates on IBM's heavy-hex devices in three ways that see only the coupling graph, the basis and which elements have failed: a formula that puts the ring on a lattice cycle (the rule), the ring folded onto the same qubits (zipper), and Qiskit's level-2 search without error rates (blind Qiskit). The workload is the kicked Ising ring at J = pi/4; the probes are a weight-2 charge conserved by the circuit, a mirror echo with a longitudinal field that breaks integrability, and the global parity. In declared tests on ibm_marrakesh and ibm_kingston (29-30 October 2026), the rule kept more of the charge than both other placements in all 24 comparisons (readable depth 56-90 steps against 15-26), and in the non-integrable echo it won 71, tied 11 and lost none of 144 comparisons, at sizes up to n = 72. Several declared predictions failed, and we report them with the results. On ibm_kingston the rule's n = 40 ring carried a run of 18 sites whose echo was near random or inverted: the same 18 sites in three runs of the byte-identical circuit over three hours, while the calibration showed nothing there and the same qubits were healthy on the n = 20 ring. Gate twirling, which leaves the ideal circuit unchanged, turned the inverted part random, so the cause is on the device, not in the circuit; a light-cone argument bounds how far one fault reaches. These sites set the readable depth at n >= 40 and erased the parity at n = 40. A map read from the calibration could not have avoided them. All declarations, records and raw counts are public in TOQB.

•Oct 31, 2026•0 citations
A quantum critical state has correlations on all length scales, and theory predicts that measuring part of such a state weakly, and keeping one outcome, changes the power law with which the correlations of the rest decay, continuously with the strength of the measurement (Garratt, Weinstein and Altman, Phys. Rev. X 13, 021026; Weinstein et al., Phys. Rev. B 107, 245132; Murciano et al., Phys. Rev. X 13, 041042). For the critical Ising chain a measurement of the transverse field and a measurement of the bond energy, which are exchanged by the Kramers-Wannier duality, move the exponent in opposite directions. A recent roadmap for Rydberg arrays (arXiv:2506.21963) describes the experimental validation as an open problem; a literature search on the day of the run found no reported observation. This deposit holds a registered experiment on a public quantum processor. On the IBM Heron processor ibm_fez a ring of 12 qubits (one hexagon of the lattice) and a ring of 20 qubits (the perimeter of two adjacent hexagons) are prepared near the ground state of the critical transverse-field Ising ring with N/2 layers of ZZ and X rotations (144 and 400 CZ gates, every CZ twirled) and read out in four settings. The strength of the measurement is a dial that is turned after the fact: on qubits that are read anyway, a weak measurement with a selected outcome is identical to a weighting of the projective shots with exp(strength x sum of the outcomes), so every strength is evaluated from the same shots, without ancilla qubits, mid-circuit measurements or discarded shots. The registered quantity is the dial D: the slope of the correlations against distance, on logarithmic axes, under the field measurement minus the slope under the bond measurement. The rings were chosen at submission by a registered rule from the calibration of the moment. Lines, bands, the layout rule and the analysis were fixed and hashed before the first job (registration SHA-256 25b81a10fe1be08bfc0a700711724cdbe30ec87a3439a906800340f094b38fb3). Results, as they fell: 128 circuits, 1,032,000 shots, 8 jobs run back to back in five minutes, 288 s of QPU time. At strength 1.0 the dial is D = -0.357 +- 0.015 on 12 qubits and -0.358 +- 0.017 on 20 qubits (exact values of the critical ring: -0.328 and -0.333), more than 20 standard errors from zero and the same on both rings; at the four registered strengths it lies within two standard errors of the exact value; without weighting it is +0.026 +- 0.013 and -0.005 +- 0.014. A fault-free 20-qubit ring 5 % off the critical field would give -0.20 or -0.50, eight to ten standard errors away. All eight binding lines and the three attestation lines held. What is not shown: the two slopes taken separately. The faults of the processor attenuate the correlations to between 20 and 57 % of their exact size, the weighting also filters faulty shots, and the field measurement alone does not show the predicted steepening; that the faults cancel in the difference is taken from a noise model, and supported by the two rings, whose states are attenuated very differently, giving the same dial. At strong weighting the dial is about 0.03 deeper than the exact value on both rings, and the ratio of the two correlation curves lies a few per cent below the exact ratio. The strength is applied in the analysis; no weak measurement took place on the processor. The rings have 12 and 20 sites, the prediction tested is the exact one for these sizes, and nothing here is a claim of quantum advantage. The deposit holds the registration, the module with the angles, the layout rule, the circuits, the estimator and the lines, the session script, the verdict script, the registration script with its Monte Carlo, the script of the noise models and the eight model distributions, the script and the log of a preliminary look on the device, the session log with the bits of every shot of every circuit, the verdict (formed once), the ledger, a rehearsal of the whole session on the noiseless simulator under the hashed registration, the write-up (qite_dial_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_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.
Every tool of quantum computing is one of three moves on two sliding rings marked with the sixty last digits of the Fibonacci numbers. A setting is a value read off one placement of the rings. A fold is a product turned into a sum by the half-angle law. A turn is a shift of position that carries a digit with it. Every gate is a setting, its entries cos(θ/2) and sin(θ/2) the half-distances of the rings at crossing separation θ, and the Hadamard, CZ and CNOT are quarter and half turns. Born's rule is the fold, amplitudes read at position k and expectation values at 2k. Every gradient is a quarter turn, because the parameter-shift rule is the ring's derivative law, its two shifts the ×7 and ×3 laws, with four eighth turns where a Givens gate needs them. A complete variational run is worked on a two-qubit number-conserving Hamiltonian. The energy is the ring shifted ten positions, the ground state the vesica setting at position 20, the optimizer three readings and a gnomon with nothing to tune, its convergence one line. Noise is the radius of the rings, and the square inside the ring, the stabilizer octahedron, says when the noise has cost a magic state. Phase estimation, Shor's classical end, Grover's search, Trotter chains, QAOA, Bell tests, teleportation, error mitigation, benchmarking and the [[4,2,2]] and [[5,1,3]] codes each reduce to the same three moves, forty tools on one page, and because every unitary is a finite product of rotation gates, the list is open and the three moves are closed. A checksum rides every classical number of the loop, the digits under the crossings on each setting, the addition law on each sum, the quarter-turn law on each gradient, the symmetry identity ⟨XX⟩ = ⟨YY⟩ on the measured data with its alarm threshold read off the setting, every one-, two- and three-bit upset of a 32-bit phase word and every burst of up to fifteen bits caught by three rings in lockstep, every corruption of any kind caught by the ladder, and the decoder table of the perfect code built on the four quarter turns of the net, any four simultaneous faults in an entry restored. The guard stands on every classical register of the loop, and the code space stands on the qubits. Thirty-one jobs on three IBM machines close the paper. A clean run on a 156-qubit machine had every compiled angle certified, the injected bit flip flagged at over a hundred standard errors, the clean checksum inside its line, the radius reading the noise, and the Bell value above 2, and one bit flipped in a phase word before submission, four ways, caught by the guard every time, turning the ground state into the top of its number sector and, from the entangler word, into the top of the whole spectrum when sent unguarded. The same words were corrupted up to all ten at once, by any change up to every bit inverted, and read both ways in four runs, unguarded and through the guard, and every setting word of a many-qubit tower was corrupted past any real error rate, caught and rebuilt in place, and read right on the machine. Every number is verified by the script in the appendix on explicit matrices and states, and the hardware readings are checked against the result files.
If quantum mechanics had a state-dependent, nonlinear term of the kind proposed by Kaplan and Rajendran (Phys. Rev. D 105, 055002), the two outcomes of a measurement would not be closed to each other: what is done in one outcome would appear in the other as a weak background field, a possibility first noted by Polchinski for Weinberg's nonlinear theory (the "Everett phone"). In linear quantum mechanics, in any interpretation, the effect is exactly zero. Laboratory experiments have bounded the electromagnetic parameter at the level of 10^-11 to 10^-12. This deposit holds a test of the same effect in which the measurement, the sender and the receiver are two qubits and the control electronics of one publicly accessible processor. On the IBM Heron processor ibm_fez a switch qubit is measured inside the circuit. If it reads 1, the controller fires N signed pi pulses (N = 200 to 1600) on a sensor qubit 25 edges away; if it reads 0, the sensor rests for exactly the same time on the y axis of its Bloch sphere, where a small rotation about x appears linearly in <Z>. A leak would rotate the resting sensor by epsilon p N pi with the sign of the drive, p being the Born weight of the outcome in which the drive was fired (1/2 and 2/3). The session has four arms: the measurement arm; a classical twin in which the switch is prepared instead of being in superposition (the same pulses and feed-forward, no other outcome); a sender check; and the response of the sensor to a real rotation injected over the window, measured in the same session. The sensor and the switch were chosen at submission by a registered rule from a scan job. Which of the two sign labels is the + sign was sealed before the first job and opened after the lines were formed. Lines, thresholds, the layout rule and the analysis were fixed and hashed before the first job (registration SHA-256 fbdec5d40b76af84b1fc0d98f71ee0d534f454a1ea96052ba5059077ce16d134; a first version was replaced before any job ran under it and is part of the deposit). Results, as they fell: 1060 circuits, 844,000 shots, 11 jobs run back to back in five minutes. The slope is epsilon = (+0.8 +- 4.5) x 10^-6, 0.18 standard errors from zero; |epsilon| < 8.2 x 10^-6 (90 %). The silent sender, the classical twin and the split by the preceding shot are flat at all eight settings (at most 1.9, 1.7 and 1.3 standard errors against a registered limit of 4), the sender check separates the two signs (0.82 and 0.65 against a floor of 0.5), and the response of the sensor was 0.90, 0.86, 0.79, 0.62 for the four windows. All nine binding lines and the four attestation lines held. The bound is five to six orders of magnitude weaker than the laboratory bounds on the same parameter and competes with none of them. What the experiment adds is the place: the test runs on a public device, the sensor listens within microseconds of the measurement, and anyone with access to such a processor can run it again. Nothing here is a statement about the existence of other worlds. The deposit holds the registration and its superseded first version, the shared module with the circuits, the design and the estimators, the model and registration script, the runner, the verdict script, the logs of two preliminary looks on the device, the rehearsal of the whole session on the noiseless simulator under the hashed registration, the session log with the bits of every shot of every circuit in the order of execution, the seal file, the verdict (formed once), the ledger, the write-up (nuntius_paper_v1.pdf) and the scripts and figures that build it. Licence: CC BY 4.0.
Paper 7 of this series carried user-written two-dimensional circuits through an operating layer (psf-os) that reads no calibration-quality number, adds its own controls to each job and applies no error mitigation. Here the same policy is carried to a chain that no fixed shape can hold and to three-dimensional lattices that the heavy-hex coupling graph cannot embed. IBM's dual-unitary kicked-Ising chain (arXiv:2411.00765) at its largest width, N = 91, read raw on ibm_marrakesh: the decay rates agree with cos 2h at all three h (largest |k - cos 2h| 0.0037) and every depth up to t = 24 (2 205 CZ) is readable, on a chain placed by a fixed rule round the failed elements; a second run on ibm_fez, with the ruler h = 0 in both jobs, again found all three rates in agreement, while h = 0.15 sat +0.0037 above cos 2h on both devices. In three dimensions, a place rule that judges the place with the highest own mirror replaced a gate that had refused every place at 48 and 72 sites; kicked Ising on 4 x 4 x 3 read at every angle and depth, Heisenberg XXX on 4 x 2 x 2 read with a Neel retention of 0.72 to 0.51. Two new layouts cut the transport CZ of the Heisenberg step by 42%, and were compared with the old one on the same places of two devices; an Ising layout with 46% fewer CZ came closer to the exact answer at the judged 4 x 2 x 2 place but farther on 4 x 3 x 2. On the way we changed our main measure for such comparisons, from the retention of an order parameter to a normalised per-site error, because noise that slows the dynamics can raise the retention. Pair creation in the Schwinger model read in 16 of 18 circuits and beat both trivial guesses in all 18. A light-cone test failed as predicted: every front arrived late, while the shape of the spread was reproduced. Every device result re-scores to the same numbers from its committed raw counts (23 of 23). No quantum advantage is claimed: every answer is computed exactly on a classical machine.
Compilers for today's quantum processors choose a layout by reading the day's calibration. We ask how deep a circuit stays readable when no placement reads a quality number. We place a ring of CZ gates on IBM's heavy-hex devices in three ways that see only the coupling graph, the basis and which elements have failed: a formula that puts the ring on a lattice cycle (the rule), the ring folded onto the same qubits (zipper), and Qiskit's level-2 search without error rates (blind Qiskit). The workload is the kicked Ising ring at J = pi/4; the probes are a weight-2 charge conserved by the circuit, a mirror echo with a longitudinal field that breaks integrability, and the global parity. In declared tests on ibm_marrakesh and ibm_kingston (29-30 October 2026), the rule kept more of the charge than both other placements in all 24 comparisons (readable depth 56-90 steps against 15-26), and in the non-integrable echo it won 71, tied 11 and lost none of 144 comparisons, at sizes up to n = 72. Several declared predictions failed, and we report them with the results. On ibm_kingston the rule's n = 40 ring carried a run of 18 sites whose echo was near random or inverted: the same 18 sites in three runs of the byte-identical circuit over three hours, while the calibration showed nothing there and the same qubits were healthy on the n = 20 ring. Gate twirling, which leaves the ideal circuit unchanged, turned the inverted part random, so the cause is on the device, not in the circuit; a light-cone argument bounds how far one fault reaches. These sites set the readable depth at n >= 40 and erased the parity at n = 40. A map read from the calibration could not have avoided them. All declarations, records and raw counts are public in TOQB.