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

What Sets the Readable Depth of a Placed Ring, and How Far a Self-Checking Layer Pushes It: Scan, Register, Avoid and Repair on Three Heavy-Hex Devices Without the Calibration Map

TN.Holdings

Published Nov 2, 2026• 0 citations
Publisher

Abstract

A circuit placed on a superconducting device stays readable only to some depth. This preprint asks what sets that depth on a given day and device, and how much of it a user-side layer can recover from its own runs, without reading the calibration map.The layer scans the rings it would use with a mirror echo read per site, keeps a dated registry of the paths it found dead, places the next ring around them with the same formula, and, for mirror-type circuits only, applies a local frame flip. Every test was declared before its device data were fetched (SHA-256 and time in the paper's declaration table).Results on IBM's heavy-hex devices (ibm_kingston, ibm_fez, ibm_marrakesh, 30 October to 2 November 2026):- Width: on ibm_kingston, the 40-qubit ring placed around the registry kept 40 of 40 sites usable on three days, against 22 on the standard ring, where the same 18-qubit run was dead on every day (WIDER in 6 of 6 declared comparisons). Scan-then-avoid also widened the ring on ibm_fez and ibm_marrakesh.- Accuracy: on rings already fully usable, forward computations with known answers were slightly more right on the avoiding ring (+0.040 and +0.045 in mean site signal), with all of the gain on the replaced qubits.- A sentinel in the user's own job read the known dead run as DEAD and the avoiding ring as CLEAN, at job time and an hour after the scan. The cost of the same defect depended on the computation: small for a 12-layer forward identity, total for a weight-40 parity.- Limits are stated: three devices over a few days, one placement formula, repair only for mirror circuits; a lower bound for calibration-only placement is given in an appendix and called close to a tautology.

DOI
10.5281/zenodo.23883937

Related papers

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

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

Folding a Ring onto Heavy-Hex: Formula-Built Schedules with Provable Gate Counts, and What Their Signal Shows on Twins and Devices

TN.Holdings

A ring of n CZ gates per layer, the entangling pattern of many variational classifiers, doesnot fit IBM’s heavy-hex devices unless n is a cycle length of the lattice, and heavy-hex hascycles of 12,20,24,28,... qubits only. We compare three schedules that a compiler can buildby formula, with no layout search and without reading the day’s calibration: the zipper (thering folded onto a line; 5n/2 − 4 two-qubit gates per layer for even n, (5n − 7)/2 for odd n),holes (the ring on a longer cycle, its spare qubits moved as |0⟩; n + 2(m − n)), and pendants(the ring on a shorter cycle, its extra nodes hung off it; n + (n − m), on exactly n qubits). Weprove that the pendant schedule’s count is the least possible for layered schedules on the cycleand its leaves in a stated routing model (exhaustive search finds the same for interleaved onesin small cases), that the hole schedule’s count is least within its class but not in general, andrecall that no cheaper schedule than the zipper was found by exhaustive searches at n = 4–12and 14. A rule that takes the fewest extra gates picks pendants at n = 13–17 and holes atn = 8–11 and 18–19 on IBM’s Heron devices; the rule is in PSF-Zero’s AI front end a26. Onnoise models, in declared matches against the zipper at 16 layers over four random classifiers,the rule won at every n = 13–18 on two twins. Its lead was 1.5–8.2× the zipper’s kept signal onthe twin of a 13-day-old snapshot and only 1.07–1.28× (about even at n = 18) on the twin of areal day’s calibration, the kind that had predicted the zipper on hardware: the old snapshot waspessimistic for the zipper. On two devices (ibmkingston, ibmfez) the pendant schedule keptthe signal its day’s twin predicted (0.90±0.12 against 0.77; 0.50±0.10 against 0.59), in two jobsof 7s each; these are coarse tests and no device comparison with the zipper was made. AgainstQiskit’s search (level 2 on the same twin) the rule won on every classifier at every n simulated(n = 13–16, 18): Qiskit’s circuits kept −0.05–0.64 of the signal against 0.61–0.82. The bare ringkept 0.78–0.86 at n = 20 and 0.81–0.83 at n = 24. On one 20-qubit cycle, two pendants keptnearly what the bare ring kept (0.75–0.84 against 0.78–0.86) and clearly more than two holes(0.61–0.68); with the classifiers and qubits fixed and only the schedule changed, the bare ringkept 1.44–1.81 times the zipper’s signal and two holes 1.13–1.20 times. Error-product estimatesof the kept signal did not rank the schedules. We give the benchmark number and the deviceuser’s number side by side throughout

•Oct 26, 2026•1 citation

Exact answers, no map, no mitigation: user-written circuits through a placement-only OS on IBM Heron r2 devices

TN.Holdings

A user writes, in plain Qiskit, a circuit whose answer is known exactly. A small operating layer (psf-os) places it on an IBM Heron r2 device by translation, without reading any calibration-quality number, adds its own controls to the same job, and runs it with no error mitigation. We report how close the raw answers come and how that is shown. Two points of the report are of use beyond our own numbers. First, an absolute criterion |M - M_exact| <= c is biased in both directions: on 5 November a problem that DIFFERS under c = 0.05 kept 0.82-0.86 of its signal, as much as a problem that AGREES (0.73-0.85), and a small-answer problem AGREES while keeping only 0.73 of its signal. We therefore print the declared verdict first and the retention R = M/M_exact beside it on every row. Second, every number can be checked: answers are sealed by hash before each run, raw counts and job identifiers are committed, and one script re-scores all 13 device results of this paper from the raw counts and finds every number the same. The results: 22 practice circuits on two devices (all 22 READ on both; 19 and 18 AGREE), a daily record from 5 to 7 November (7 runs and one refusal), and IBM's dual-unitary kicked-Ising chain (arXiv:2411.00765) at N = 51 and N = 71 sites, where the raw decay rates agree with cos 2h at all three h (largest |k - cos 2h|: 0.0045 at N = 51, 0.0017 at N = 71) and every depth up to t = 24 (1,715 CZ) is readable. Local failure regions, not problem size, set several outcomes. A correction built from the job's own controls, declared in advance, reduced the error on both devices but did not make the answers agree across problems. No quantum advantage is claimed: every answer here is computed exactly on a classical machine. We acknowledge the use of IBM Quantum services for this work.

•Nov 8, 2026•0 citations

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

Bernd Westrick

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.

•Nov 13, 2026•0 citations

Pre-registration: a sidereal-modulation search in superconducting-qubit coherence (one qubit, one year)

Zachary Piech

This document fixes, before the data exist, the hypothesis, apparatus, observables, cadence, analysis, thresholds, controls, stopping rule and reporting commitment of a one-year search for a modulation of superconducting-qubit energy relaxation (T1) at the sidereal frequency, 1/(23 h 56 m 4.09 s), beyond what the solar day and its seasonal modulation can produce. Data collection began on 17 October 2026 at 16:42 UTC on qubit 9 of the IBM Heron processor ibm_fez: an eight-delay inversion-recovery T1 measurement every six hours (about 3 s of processor time each), with the device's calibration values polled hourly. The analysis is fixed in advance: a least-squares fit of a smooth drift plus sinusoids at the solar, sidereal, anti-sidereal and extended-sidereal frequencies, with the reported amplitude leakage-corrected as sqrt(A_sid^2 - A_anti^2) (Farley and Storey 1954). The pipeline was validated on synthetic data before the first measurement and recovers an injected 0.3% at 2.7-3.4 sigma while returning 0.5 sigma with nothing injected. Detection requires a leakage-corrected amplitude at or above 3 sigma, both control channels below 2 sigma, a phase stable between the two halves of the year, and survival when runs adjacent to calibrations are removed; otherwise the result is the 95% upper limit, expected near 0.3%. The search is declared inconclusive if fewer than 900 of 1460 scheduled runs succeed or the anti-sidereal control exceeds 3 sigma. An amplitude matching the known cosmic-ray anisotropy (~0.1%) is a calibration, not a discovery. Stopping rule: one year, with a six-month interim look at the controls only; a second year is pre-declared as the response to an inconclusive or 2-3 sigma outcome. The result will be reported whether it is a detection, a bound, or a failure of the apparatus. Standard physics predicts a null result at this sensitivity; the alternative hypothesis is from The Cosmic Page (doi:10.5281/zenodo.23287018, Ch. 13) and the research proposal doi:10.5281/zenodo.23201109. Included: the pre-registration (PDF and LaTeX source), the monitor script that runs on the device, the fixed analysis script, the synthetic-data validation script with its results and figure, and the README. First data point: job db9qap9gv2cc73e5tufg, 2026-10-17T16:42:19Z, T1 = 162.9 +/- 7.9 us.

•Oct 17, 2026•0 citations
A circuit placed on a superconducting device stays readable only to some depth. This preprint asks what sets that depth on a given day and device, and how much of it a user-side layer can recover from its own runs, without reading the calibration map.The layer scans the rings it would use with a mirror echo read per site, keeps a dated registry of the paths it found dead, places the next ring around them with the same formula, and, for mirror-type circuits only, applies a local frame flip. Every test was declared before its device data were fetched (SHA-256 and time in the paper's declaration table).Results on IBM's heavy-hex devices (ibm_kingston, ibm_fez, ibm_marrakesh, 30 October to 2 November 2026):- Width: on ibm_kingston, the 40-qubit ring placed around the registry kept 40 of 40 sites usable on three days, against 22 on the standard ring, where the same 18-qubit run was dead on every day (WIDER in 6 of 6 declared comparisons). Scan-then-avoid also widened the ring on ibm_fez and ibm_marrakesh.- Accuracy: on rings already fully usable, forward computations with known answers were slightly more right on the avoiding ring (+0.040 and +0.045 in mean site signal), with all of the gain on the replaced qubits.- A sentinel in the user's own job read the known dead run as DEAD and the avoiding ring as CLEAN, at job time and an hour after the scan. The cost of the same defect depended on the computation: small for a 12-layer forward identity, total for a weight-40 parity.- Limits are stated: three devices over a few days, one placement formula, repair only for mirror circuits; a lower bound for calibration-only placement is given in an appendix and called close to a tautology.
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.
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.
A ring of n CZ gates per layer, the entangling pattern of many variational classifiers, doesnot fit IBM’s heavy-hex devices unless n is a cycle length of the lattice, and heavy-hex hascycles of 12,20,24,28,... qubits only. We compare three schedules that a compiler can buildby formula, with no layout search and without reading the day’s calibration: the zipper (thering folded onto a line; 5n/2 − 4 two-qubit gates per layer for even n, (5n − 7)/2 for odd n),holes (the ring on a longer cycle, its spare qubits moved as |0⟩; n + 2(m − n)), and pendants(the ring on a shorter cycle, its extra nodes hung off it; n + (n − m), on exactly n qubits). Weprove that the pendant schedule’s count is the least possible for layered schedules on the cycleand its leaves in a stated routing model (exhaustive search finds the same for interleaved onesin small cases), that the hole schedule’s count is least within its class but not in general, andrecall that no cheaper schedule than the zipper was found by exhaustive searches at n = 4–12and 14. A rule that takes the fewest extra gates picks pendants at n = 13–17 and holes atn = 8–11 and 18–19 on IBM’s Heron devices; the rule is in PSF-Zero’s AI front end a26. Onnoise models, in declared matches against the zipper at 16 layers over four random classifiers,the rule won at every n = 13–18 on two twins. Its lead was 1.5–8.2× the zipper’s kept signal onthe twin of a 13-day-old snapshot and only 1.07–1.28× (about even at n = 18) on the twin of areal day’s calibration, the kind that had predicted the zipper on hardware: the old snapshot waspessimistic for the zipper. On two devices (ibmkingston, ibmfez) the pendant schedule keptthe signal its day’s twin predicted (0.90±0.12 against 0.77; 0.50±0.10 against 0.59), in two jobsof 7s each; these are coarse tests and no device comparison with the zipper was made. AgainstQiskit’s search (level 2 on the same twin) the rule won on every classifier at every n simulated(n = 13–16, 18): Qiskit’s circuits kept −0.05–0.64 of the signal against 0.61–0.82. The bare ringkept 0.78–0.86 at n = 20 and 0.81–0.83 at n = 24. On one 20-qubit cycle, two pendants keptnearly what the bare ring kept (0.75–0.84 against 0.78–0.86) and clearly more than two holes(0.61–0.68); with the classifiers and qubits fixed and only the schedule changed, the bare ringkept 1.44–1.81 times the zipper’s signal and two holes 1.13–1.20 times. Error-product estimatesof the kept signal did not rank the schedules. We give the benchmark number and the deviceuser’s number side by side throughout
A user writes, in plain Qiskit, a circuit whose answer is known exactly. A small operating layer (psf-os) places it on an IBM Heron r2 device by translation, without reading any calibration-quality number, adds its own controls to the same job, and runs it with no error mitigation. We report how close the raw answers come and how that is shown. Two points of the report are of use beyond our own numbers. First, an absolute criterion |M - M_exact| <= c is biased in both directions: on 5 November a problem that DIFFERS under c = 0.05 kept 0.82-0.86 of its signal, as much as a problem that AGREES (0.73-0.85), and a small-answer problem AGREES while keeping only 0.73 of its signal. We therefore print the declared verdict first and the retention R = M/M_exact beside it on every row. Second, every number can be checked: answers are sealed by hash before each run, raw counts and job identifiers are committed, and one script re-scores all 13 device results of this paper from the raw counts and finds every number the same. The results: 22 practice circuits on two devices (all 22 READ on both; 19 and 18 AGREE), a daily record from 5 to 7 November (7 runs and one refusal), and IBM's dual-unitary kicked-Ising chain (arXiv:2411.00765) at N = 51 and N = 71 sites, where the raw decay rates agree with cos 2h at all three h (largest |k - cos 2h|: 0.0045 at N = 51, 0.0017 at N = 71) and every depth up to t = 24 (1,715 CZ) is readable. Local failure regions, not problem size, set several outcomes. A correction built from the job's own controls, declared in advance, reduced the error on both devices but did not make the answers agree across problems. No quantum advantage is claimed: every answer here is computed exactly on a classical machine. We acknowledge the use of IBM Quantum services for this work.
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.
This document fixes, before the data exist, the hypothesis, apparatus, observables, cadence, analysis, thresholds, controls, stopping rule and reporting commitment of a one-year search for a modulation of superconducting-qubit energy relaxation (T1) at the sidereal frequency, 1/(23 h 56 m 4.09 s), beyond what the solar day and its seasonal modulation can produce. Data collection began on 17 October 2026 at 16:42 UTC on qubit 9 of the IBM Heron processor ibm_fez: an eight-delay inversion-recovery T1 measurement every six hours (about 3 s of processor time each), with the device's calibration values polled hourly. The analysis is fixed in advance: a least-squares fit of a smooth drift plus sinusoids at the solar, sidereal, anti-sidereal and extended-sidereal frequencies, with the reported amplitude leakage-corrected as sqrt(A_sid^2 - A_anti^2) (Farley and Storey 1954). The pipeline was validated on synthetic data before the first measurement and recovers an injected 0.3% at 2.7-3.4 sigma while returning 0.5 sigma with nothing injected. Detection requires a leakage-corrected amplitude at or above 3 sigma, both control channels below 2 sigma, a phase stable between the two halves of the year, and survival when runs adjacent to calibrations are removed; otherwise the result is the 95% upper limit, expected near 0.3%. The search is declared inconclusive if fewer than 900 of 1460 scheduled runs succeed or the anti-sidereal control exceeds 3 sigma. An amplitude matching the known cosmic-ray anisotropy (~0.1%) is a calibration, not a discovery. Stopping rule: one year, with a six-month interim look at the controls only; a second year is pre-declared as the response to an inconclusive or 2-3 sigma outcome. The result will be reported whether it is a detection, a bound, or a failure of the apparatus. Standard physics predicts a null result at this sensitivity; the alternative hypothesis is from The Cosmic Page (doi:10.5281/zenodo.23287018, Ch. 13) and the research proposal doi:10.5281/zenodo.23201109. Included: the pre-registration (PDF and LaTeX source), the monitor script that runs on the device, the fixed analysis script, the synthetic-data validation script with its results and figure, and the README. First data point: job db9qap9gv2cc73e5tufg, 2026-10-17T16:42:19Z, T1 = 162.9 +/- 7.9 us.