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 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
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.
PSF-Zero places a quantum classifier's entangling ring on hardware by formula, without a layout search and without reading the day's calibration; Qiskit's preset pass manager searches, using the calibration. We ask which of the two gives the better trained classifier, and report what it took to answer that question honestly. The model is a 10-qubit, 16-layer data re-uploading classifier trained by a finite-difference optimiser on a noise model of ibm_marrakesh (the twin) and tested on an independently perturbed noise model (the stand-in); one day of hardware runs is included. Four effects can each produce a winner without any difference in learning: (i) the task's answer sat at the untrained starting point: on the device day's task the untrained model is already 0.934 accurate (noiseless), and training lowered both compilers' models to 0.762 (PSF-Zero) and 0.730 (Qiskit); (ii) a readout offset makes a circuit answer one class on 84-94 % of balanced test points, which moves accuracy while leaving the model unchanged; (iii) arms with different output scales lose different amounts to a fixed shot count; (iv) the twin's scale was off by up to 2.3x on hardware. With the task moved far from the start and the rules fixed before each run, PSF-Zero's newest ring schedule (the zipper, 336 CZ and 11.7 us at 16 layers) and Qiskit (506 CZ, 48.2 us, 14 active qubits) gave classifiers that the declared tests could not tell apart: on stand-in accuracy the zipper won on one of three teachers at each budget, below the declared two of three, and on the trained model itself neither arm won on any teacher. Formula placement could not be told apart from the search while using a third fewer entangling gates and a quarter of the duration; it did not beat it. We give the vanity and the essential number side by side throughout, mark what was declared before the data and what was found after, and close with a checklist for compiler comparisons through trained quantum models. In one preliminary hardware job on ibm_kingston, the zipper's circuits followed a twin built from that day'scalibration (scale 1.00, correlation 0.98), while Qiskit's lost most of their signal and came out inverted on theread-out qubit; the cause is not known. Code and records: https://github.com/TN-Holdings-LLC/psf-zero (paper and figure script) and https://github.com/TN-Holdings-LLC/TOQB (runs, records, declarations).
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.
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.
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.
Qubit layout selection determining which physical qubits a logical circuit occupies on a superconducting processor is fundamentally a noise-field sampling problem. On IBM Heron r1 and Heron r2 devices, two-qubit gate error varies by nearly one order of magnitude (7– $9\times $ ) across qubit pairs on the same chip, causing measured fidelity differences up to 0.903 from layout choice alone. We introduce the Gate Noise Sensitivity Index (GNSI), a calibration-weighted linear combination of per-qubit readout error and per-edge two-qubit gate error, derived analytically as a first-order approximation of circuit fidelity under independent, heterogeneous noise channels. For 12 backend–circuit combinations on three IBM processors (133-qubit Heron r1 and 156-qubit Heron r2), GNSI scores are computed for the full pool of 1,320 computationally enumerated candidate layouts; the top-ranked (GNSI-BEST) and bottom-ranked (GNSI-WORST) layouts are then executed on hardware. GNSI-BEST ranks first by score in all 12 instances (Hit@1 = 100% within the enumerated candidate pool) and consistently achieves higher measured fidelity than GNSI-WORST, with Spearman rank correlation ρ=0.926±0.016 and statistically significant fidelity separation in 9 of 12 paired tests. Initial hardware comparisons on ibm_fez ( n=5 ) show GNSI-BEST matching or exceeding SABRE-selected fidelity. We further identify a depth-dependent regime transition: gate-error heterogeneity appears to govern ranking in shallow circuits (depth ≤15 ), while qubit-specific T1 variation may dominate for deeper circuits (depth ≥20 ). The analytic regime boundary d∗(b) , computable from calibration data alone, shows agreement within ±2 depth layers across all three backends in initial comparisons; GNSI-Extended incorporating the decoherence term receives an initial hardware comparison on two circuits, with full validation left to future work. These results suggest that layout-dependent fidelity variation may be governed by a calibration-predictable noise field, with direct implications for compiler design and noise-adaptive quantum circuit execution.