Supplementary note to arXiv:2611.08310 and arXiv:2610.19779. A fingerprint of coherent noise built from a stabilizer code is only as informative as the recovery gates that produce it, and every fixed choice of those gates is blind somewhere. This note isolates what can nevertheless be guaranteed, and states it as a worst-case floor rather than an average improvement. Two elementary facts about Fisher information make the guarantee exact. Because information matrices add, the identifiable set of a collection of designs is the union of theirs, so running several designs in parallel can never cost a direction that any member sees. Because the inverse of a sum is Loewner-dominated by the inverse of any summand, splitting a fixed shot budget over S designs can never cost more than sqrt(S) in standard deviation, that is, S in shots. The premium is therefore fixed in advance and independent of the working point, while the gain is not. Both statements are certified over the 64-design space of the three-qubit repetition code, under the 48- and 112-component fingerprints: the Loewner inequality is evaluated rather than assumed at every point tested, the worst case over 300 working points is 1.25 against the certified sqrt(2) = 1.4142, the bound is attained to five figures at one structured point, and at the worst points of the individual designs the parallel pair sits below the better single design by factors of 2.6 to 9.5 under the 48-component fingerprint and 4.3 to 17 under the 112-component one. Two three-gate placements suffice; a third adds 3.5 to 11.5 per cent. The floor buys recoverability and worst-case precision, and it buys nothing else: it does not buy accuracy under common-mode calibration bias, and it does not repair a model degeneracy that no design can see. Converting the floor into a shot count: at a unit per-component error the pair brings the worst parameter to a 10 mrad target in a median of 7.5e4 shots under the 112-component fingerprint and 5.5e5 under the 48-component one, with 95th percentiles of 4.6e5 and 2.9e6. These are sample statistics and are labelled as such, because the parameter box contains a degenerate locus at which all 64 designs fall to rank 5: no design has a finite worst-case count over the whole box. A directed search from the worst sampled point raises the sample maximum by factors of 4.7e3 and 1.1e4 while leaving all three Jacobians at full rank, which is the honest size of that tail; over the whole domain the only statement that survives is the sqrt(2) inequality itself. Contents: the two propositions with proofs, the cost corollary, the numerical certification (six tables, one figure), the relation to the two companion papers, and a reproduction map. The archive repro_v1.0.zip in this record contains the eight scripts, five data files, the figure and a self-test that re-derives every quoted number; run python scripts/selftest.py from the archive root and compare against MANIFEST.sha256. Companion papers: arXiv:2611.08310 (recovery gates as a resource) and arXiv:2610.19779 (coherent-noise identifiability).
Supplementary note to arXiv:2611.08310 and arXiv:2610.19779. A fingerprint of coherent noise built from a stabilizer code is only as informative as the recovery gates that produce it, and every fixed choice of those gates is blind somewhere. This note isolates what can nevertheless be guaranteed, and states it as a worst-case floor rather than an average improvement. Two elementary facts about Fisher information make the guarantee exact. Because information matrices add, the identifiable set of a collection of designs is the union of theirs, so running several designs in parallel can never cost a direction that any member sees. Because the inverse of a sum is Loewner-dominated by the inverse of any summand, splitting a fixed shot budget over S designs can never cost more than sqrt(S) in standard deviation, that is, S in shots. The premium is therefore fixed in advance and independent of the working point, while the gain is not. Both statements are certified over the 64-design space of the three-qubit repetition code, under the 48- and 112-component fingerprints: the Loewner inequality is evaluated rather than assumed at every point tested, the worst case over 300 working points is 1.25 against the certified sqrt(2) = 1.4142, the bound is attained to five figures at one structured point, and at the worst points of the individual designs the parallel pair sits below the better single design by factors of 2.6 to 9.5 under the 48-component fingerprint and 4.3 to 17 under the 112-component one. Two three-gate placements suffice; a third adds 3.5 to 11.5 per cent. The floor buys recoverability and worst-case precision, and it buys nothing else: it does not buy accuracy under common-mode calibration bias, and it does not repair a model degeneracy that no design can see. Converting the floor into a shot count: at a unit per-component error the pair brings the worst parameter to a 10 mrad target in a median of 7.5e4 shots under the 112-component fingerprint and 5.5e5 under the 48-component one, with 95th percentiles of 4.6e5 and 2.9e6. These are sample statistics and are labelled as such, because the parameter box contains a degenerate locus at which all 64 designs fall to rank 5: no design has a finite worst-case count over the whole box. A directed search from the worst sampled point raises the sample maximum by factors of 4.7e3 and 1.1e4 while leaving all three Jacobians at full rank, which is the honest size of that tail; over the whole domain the only statement that survives is the sqrt(2) inequality itself. Contents: the two propositions with proofs, the cost corollary, the numerical certification (six tables, one figure), the relation to the two companion papers, and a reproduction map. The archive repro_v1.0.zip in this record contains the eight scripts, five data files, the figure and a self-test that re-derives every quoted number; run python scripts/selftest.py from the archive root and compare against MANIFEST.sha256. Companion papers: arXiv:2611.08310 (recovery gates as a resource) and arXiv:2610.19779 (coherent-noise identifiability).
Experimental supplement to arXiv:2611.08310, a companion manuscript on gate-optimal recovery designs (2026). This supplement specifies a concrete experiment for measuring the eleven-parameter small-angle coherent noise of a three-qubit register with three single-qubit Pauli gates, using a distance-three repetition code in both orientations. It gives the branch structure, the syndrome-to-Pauli look-up table for the three-gate design, the fixed sixteen-setting measurement table, shot and wall-clock budgets for three platform classes, a calibration and systematics checklist, an analysis pipeline, and a symptom-to-cause table. Two sections price the alternatives: a fixed recovery that does not resolve the syndrome saves a factor three in circuits and loses a factor five in precision floor, and a coherent unitary recovery keeps the circuit saving but replaces each single-qubit Pauli by a multi-controlled gate that every branch must compile. At three qubits no design in the scanned budget loses rank, so identifiability does not separate the gate counts; what depends on the working point is which three gates to use, not how many. The organising point is that the recovery gate count is a resource: three gates attain the lowest precision floor, the standard six-gate decoder is 22 times worse at a small-angle operating point and 2.3 times worse at the well-conditioned point of arXiv:2610.19779, and the ordering is stable over forty sampled working points while the size of the factor is not. The ordering survives when the look-up is compiled rather than measured, and the margin then widens from 5.6 to 7.7 in wall clock, because a compiled table charges every entry in every branch. A section added in version 1.5 asks whether that answer depends on the platform. A second device archetype -- a tunable coupler or iSWAP-style gate, whose always-on term is the exchange J(XX+YY)/2 -- carries one more parameter per bond, thirteen in all, and the two clusters are not nested: XX and YY commute, and ZZ is orthogonal to their plane. Enumerating all 64 design pairs at n=3 and all 3969 at n=5 gives the same gate budget for both archetypes, zero gates to reach full rank at n=3 and one at n=5; that count is a lower bound on the budget, not a recommended design, since the precision optimum is the three gates of the main text, where zero gates is 18 times worse at the median and 379 times worse at the certified point. At matched per-layer coherent infidelity the thirteen-parameter cluster is not worse (101.0 against 88.9 mrad on the local angles at 10^5 shots), and at the three-gate optimum the comparison widens (41.7 against 32.2 mrad). Choosing the wrong cluster is a bias, not a variance: the correct family leaves a residual of exactly zero, the wrong one leaves 0.4-0.6% in the fingerprint and moves the nine local angles by a quarter to a half, while its Cramer-Rao bound looks better. The decoded logical error cannot arbitrate at that bias level -- 200 random perturbations of the same total variation spread it over a factor 43 -- so the model family must be chosen by the residual. The same section closes with a composition law: a per-gate composition of Pauli probabilities is elementwise in the Walsh eigenvalues and therefore under-counts the coherent part of the depth-L noise by exactly L (measured slopes 1.98 for the generator against 0.99 for the per-gate rule). A closing section fixes the size of the gain and asks how far it extends. An exact prior removes 19.3% of the logical error at d=3, which is 4.3e-5 errors per code cycle; a three-gate fit captures 83, 96.5 and 99.5% of that share on the three platform classes. That share, not the accuracy of the estimate, is where every prior-based protocol stops, because 94% of the residual is weight-two aliasing. It is not a limit set by using Pauli probabilities: the same prior decodes both the coherent channel and its twirled version, so the drop from 19.3% to 11.6% under twirling prices the device rather than the estimate, and composing per-gate twirls changes at most two of the 256 decoder decisions. A generator rather than a channel is what additionally allows the coherent part to be inverted and the prior to be extrapolated to unmeasured working points. Carrying the same three-qubit fit to d=5 or d=7 obeys a closed form, G_d = G_3^((d+1)/4), so no extra precision is needed at larger distance: a 6.4 mrad rms on the eleven parameters moves the d=7 gain by 8.5%. What does not transport is the truncated part of the model---the 2(d-1)^2 three-body positions a d x d patch adds, none of which a chain fit covers---which costs 5% of the gain at d=5 and 10% at d=7; site-to-site spread costs another 3%. The law itself is a property of the decoder and applies to any prior, so this is a bound on what a three-qubit run can claim, not an advantage over Pauli-statistics protocols. Measuring at the target size instead of transporting avoids the truncation count but pays conditioning: a factor 68 from three to seven qubits. All numbers are model-level: no device data are reported, and the floors assume a calibration residual of 1e-3. Contents (v1.5): 1 What the experiment measures · 2 The three branches · 3 Syndrome decoding · 4 Settings and shot arithmetic · 5 Budget on three platforms · 6 Why the syndromes must be resolved · 7 What does and does not depend on the gate count · 8 Does the platform change the answer? · 9 How large the gain is, and how far it extends · 10 Calibration and systematics · 11 Analysis pipeline · 12 Diagnostics · 13 Checklist.
Family selection in generator-model noise tomography, usually quoted as a hardware property, is a hypothesis test whose shot floor is closed form under a purely coherent noise model, N∗=λreq/(rbS)2, controlled by the absolute bias rbS rather than by the relative residual rb, hence computable for any device from a calibration, before a single shot. The same computation prices the recovery gates: the fingerprint that fixes a family's residual and the Fisher information that ranks designs come from the same map, so there is no design-independent verdict and no family-independent design optimum. Whether a design can move that price is structural: a bias confined to the block every design measures identically is design-blind, while one that reaches the code blocks can be repriced by a factor of sixty-eight; the two platforms are its extremes, at 98.1% and 48.0%. At the reference point the floor is 1.1×107 and 6.7×106 shots per component, and that point is the easy corner: the median of its own direction over the sampled points is 8.9×108, 83 times dearer. At the 105 shots a run spends the test has power 0.053 at a level of 0.05. Rebuilding the fingerprint under each of the sixty-four designs moves the floor by 68 on one platform and 1.7 on the other, and the most precise design costs ten times more shots for the verdict than the cheapest to test. All sixty-four placements are full rank: at three gates the rms varies by factors of 2.7 and 3.9 with placement alone, while the optimum over counts is flat. At five qubits the same rule moves the floor by 21 while the verdict costs 109 shots; against a real three-qubit calibration the floor is a requirement on systematic control before it is a shot count, and where that control is missing no budget supplies it.
Process tomography built on stabilizer codes compares the logical channel of a repetition code with a reference channel, and the decoder that produces it is almost always fixed to the standard minimum-weight one. Under a fixed measurement basis, where the gate count is a resource rather than a bookkeeping artefact, we enumerate every recovery design for three, five and seven qubits and decide the rank of each exactly. The minimal counts are 0, 1 and 5 single-qubit Pauli gates, against 6, 50 and 308 for full decoding, and the count depends on how many sites are corrected, never on which. Correcting more sites is not monotonically better: at seven qubits full decoding has rank 24 of 27, proved in rational arithmetic. At the median of 40 working points the three-gate design is 9.0 times more precise than the six-gate decoder, and the ordering holds at every one.
We formulate stabilizer-code error correction as a code- and recovery-dependent transformation of the noise channel. For a fixed recovery map, syndrome projection produces a block-diagonal logical channel whose diagonal Pauli weights follow from code-induced error classes, with no physical Pauli twirl; concatenation is then iterated redistribution, with the dominant logical error guiding the next code. The bit-flip and phase-flip three-qubit codes with standard recoveries supply a closed-form benchmark, and logically inequivalent recoveries appear as a design degree of freedom for shaping the channel presented to the next decoder. For amplitude damping, the three-qubit rules select C2(σ^y)C1(σ^x) and give fl=1−O(γ2), with an ideal-gate crossover at γc≈0.30 (f=1−1.72755γ2) and a favorable gate-count comparison with the five-qubit code under the same assumptions. Correlated noise requires joint class statistics, whereas coherent noise retains intra-class coherences that make the same transformation usable in reverse as a tomographic fingerprint; there the companion work proves local identifiability from a rank certificate evaluated inside the parameter domain, classifies the sole permutation-symmetry ambiguity as structural at any chain length, and closes it with one two-qubit marginal channel. The construction remains an analytic benchmark, not a universal prescription for an inner code beneath a surface code.
SUPERSEDED DUPLICATE — do not cite this record. Cite 10.5281/zenodo.21698294 instead. Both records were deposited on 2026-07-30 and contain the same paper. This one carries an earlier, superseded NOTE.md whose resource-scaling section still claimed L≈6–7 (d=36–49); the surviving record carries the corrected text (measured L=4, [[1536,6,16]]) and the toric4d_lowp.py stratified estimator behind it. The independent cross-validation scripts that were unique to this record (magic_state4-7.py) have been added to the surviving record. Flagged 2026-07-31. We simulate a 15-to-1 magic-state factory under full circuit-level depolarizing noise and ask whether a 4D toric code — which corrects errors single-shot, without repeated syndrome rounds — relieves the factory's dominant cost. It does not. Distillation output error is confirmed at 35p³ by exact enumeration and by stim, but the factory's circuit-level error floor is first order in the gate error rate and schedule-dependent, measured at 12–15·p_gate for the real [[15,1,3]] quantum Reed–Muller code with all 14 stabilizers. This is 3.5× larger than a previously reported 4.18·p_gate, which we trace to a circuit that omitted the code's 10 Z-type checks; that figure is withdrawn here. The floor originates in the final syndrome sweep: faults deposited on data qubits by the last round of gates are never checked by anything after them. Whichever check type is measured last, that sector's faults escape, so rescheduling shifts the floor between sectors and interleaving shaves roughly 20%, but cannot remove it. Reordering, redundant checks and flag qubits leave it first order; decoding weight-1 errors instead of discarding them makes it 5× worse. We construct the 4D toric code on an L⁴ torus from its cubical chain complex and verify [[486,6,9]] at L=3 (k=6 exactly, explicit weight-9 logicals in both sectors, d=4 exact at L=2 by exhaustive search), and measure a code-capacity threshold between 5% and 7% under BP+OSD. Single-shot repair using the 80 independent metachecks recovers near-perfect-syndrome performance, but only while syndrome noise stays roughly 10–30× below the data error rate: it improves logical error by 195× at q=10⁻³ and by only 4.5× at q=10⁻². Crucially, metachecks constrain the syndrome, not the data, and cannot see faults deposited directly on data qubits by the final sweep — which is precisely where the factory floor originates. Single-shot therefore buys latency, not factory fidelity. Because the factory's Cliffords act on encoded blocks, p_gate is the logical error rate of the hosting code. The correction moves the surface-code requirement from d=15 to d=17 (578 physical qubits per patch); on the 4D toric side, the smallest sufficient block is L=4, [[1536,6,16]], with [[486,6,9]] missing the fidelity demand by four to five orders of magnitude. We situate the result against Xu et al. (arXiv:2407.18490), whose parallel distillation across qLDPC patches reduces space–time cost but leaves the per-factory floor untouched. A corrections log records eight claims withdrawn or corrected during this work, including our own earlier 4.18·p_gate figure and a d=15 requirement that rested on a single error event. Section 6 states what is not established: these are code-capacity numbers for the 4D code, the distance requirement is quoted at p=3–5% rather than 10⁻³, d=L² is verified exactly only at L=2, the Λ extrapolations are long, and no end-to-end injection simulation was run. Correction, 2026-07-31. The files deposited with this record on 2026-07-30 predate a low-p re-measurement of the resource-scaling section. The originally deposited text stated that hosting the factory requires L≈6–7 (d=36–49, n≈7800–14400); that figure came from fitting a single suppression factor Λ to near-threshold points at p=3–5%. The single-Λ ansatz does not hold for this code: the measured suppression per two units of distance runs from 10.9 (d=4→9 at p=0.02) to 793 (d=9→16 at p=0.01). Re-measuring at the factory's actual operating regime with a weight-stratified estimator gives d ≥ 14.5 at p=0.02 and d ≥ 9.7 at p=0.01, so the smallest sufficient 4D block is L=4, [[1536,6,16]], not L=6–7. The L≈6–7 figure is withdrawn. These are point estimates whose upper confidence bands remain wide at the smallest p, and should be read as order-of-magnitude. The corrected text and the estimator script (toric4d_lowp.py) are not in this record's file set; replacing files requires a new version, which will carry the corrected note. Nothing in Sections 1–4 — the 35p³ distillation result, the 12–15·p_gate factory floor, the last-sweep mechanism, or the d=17 surface-code requirement — is affected.
Companion to the preprint “A Qubit–Qutrit Equivalence for Centrally Symmetric Two-Query Quantum Correlations” (doi:10.5281/zenodo.24093433), which proved that for two fixed binary measurements without shared randomness, a qutrit is never better than a qubit at reproducing centrally symmetric target tables. This note settles two questions left open there. Approximately symmetric targets (two queries). If a qutrit fits a table with worst-cell error ε₃, a sharp qubit pair fits it with error at most ε₃ + δ/2, where δ measures the asymmetry of the table. The constant is proved to be best possible. Three queries. The equivalence fails. Every qubit triple of binary measurements satisfies a simple inequality I ≤ 9, which follows from an identity on 3×3 correlation matrices. A triple of projective qutrit measurements reproduces an eight-point centrally symmetric table exactly with I ≥ 9.0505, so every qubit needs worst-cell error larger than 9.7×10⁻⁴ on it. This is a computer-assisted proof based on exact rational certificates, checked by two independent programs. The qutrit advantage is small: about 10⁻³ in worst-cell error. Numerically, the best qutrit value found is I* = 9.0507284088558548…. A candidate minimal polynomial of degree 13 is reported, confirmed to 3000 digits. Its symbolic derivation and the global optimality of I* remain open, and are labelled as numerical findings. Files: the preprint (PDF), and a reproducibility archive (ZIP) with all exact certificates, the original scripts, an independent audit, the full research record including failed and superseded runs, and a SHA-256 manifest. Quick check after unpacking: python3 -I audit/verify_certificates.py . (pure Python, about 1 s). Not peer reviewed. A large language model assisted with derivations, computations, certificate scripts and drafting; the author takes full responsibility for the content.