Coherent noise calls for a reusable physical model, but Pauli twirling erases it and full process tomography scales exponentially. We turn measurement-free quantum error correction into a probe: bit-flip and phase-flip codes polarize few-qubit coherent noise into single-logical-qubit channels, and the resulting fingerprint identifies an 11-parameter three-qubit family. An exact rational-arithmetic rank certificate, evaluated at a rational point in the interior of the parameter domain, proves local injectivity on a dense open subset of that domain. The map is nevertheless not globally injective: a compensating rotation combined with a site exchange yields exact collisions, which we classify and then remove by adding one two-qubit marginal channel. The site exchange is the only nontrivial permutation symmetry of the $n$-qubit chain generator at any $n$, so the classification is structural rather than a three-qubit accident. A Cramér--Rao analysis, checked at the level of individual measurement settings, reaches $0.01$~rad per parameter at a representative point, and decoder priors rebuilt from such an estimate retain most of their correlation gain. Propagating the generator into a distance-three surface code gives a $14.8$-fold encoding gain when the generator is known exactly, and $1.21$-fold of the correlation gain survives when the prior is rebuilt from an estimate at the stated precision, closing the loop from characterization to decoding.
AI Summary
Can logical channels produced by error-correction circuits identify a coherent physical-noise generator, rather than only its Pauli statistics? This paper studies three-qubit noise comprising arbitrary local rotations and nearest-neighbor $ZZ$ couplings: eleven parameters in $\Theta=[-0.1,0.1]^9\times[-0.05,0.05]^2$. Its probe combines a single-qubit reference channel with logical channels from measurement-free bit-flip and phase-flip correction.
An exact rational-arithmetic Jacobian certificate establishes generic local identifiability from the resulting 48-component Pauli-transfer-matrix fingerprint. Across 500 sampled points, the full seven-channel Jacobian has smallest singular value between $3.56\times10^{-3}$ and $0.130$. Global uniqueness fails: reflection of the chain, combined with compensating local rotations, produces exact collisions between physically distinct regular points. The reflection-generated collision locus is classified, and one additional two-qubit marginal channel provably distinguishes these pairs. Four concatenated second-level channels add statistical information but no identifying equations; their precision benefit depends on gate and measurement costs.
An ideal measurement-level Fisher calculation gives a representative budget of approximately $1.3\times10^7$ measurement events for $0.01$ rad per-parameter precision. Calibration bias and conditioning can impose substantially stricter requirements. A single-round, ideal-syndrome distance-three surface-code simulation gives a $1.239$-fold improvement from correlated versus factorized decoder priors, falling to a median $1.209$ with estimated parameters.
The guarantees concern the specified three-qubit unitary family. Accidental non-reflection collisions remain unexcluded; general-size identifiability, nonunitary noise, noisy syndrome extraction, and multiround validation are not established.
Some signs of AI-generated textAI use disclosedStrong assumptionsPossible errorIncremental
Language editing, drafting of some analysis scripts, and cross-checks of quoted numbers against the archived outputs were assisted by a large language model.
Central claim may not hold: The exact rank certificate supporting generic local identifiability specifies a Jacobian minor containing identically zero trace-preservation rows, making its claimed nonzero determinant impossible and leaving the central theorem without its advertised exact proof.
The precision discussion reports mutually incompatible Cramér–Rao coefficients, with the larger values also inconsistent with the stated smallest singular value and implying a substantially larger shot requirement.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
Coherent noise calls for a reusable physical model, but Pauli twirling erases it and full process tomography scales exponentially. We turn measurement-free quantum error correction into a probe: bit-flip and phase-flip codes polarize few-qubit coherent noise into single-logical-qubit channels, and the resulting fingerprint identifies an 11-parameter three-qubit family. An exact rational-arithmetic rank certificate, evaluated at a rational point in the interior of the parameter domain, proves local injectivity on a dense open subset of that domain. The map is nevertheless not globally injective: a compensating rotation combined with a site exchange yields exact collisions, which we classify and then remove by adding one two-qubit marginal channel. The site exchange is the only nontrivial permutation symmetry of the n-qubit chain generator at any n, so the classification is structural rather than a three-qubit accident. A Cramér--Rao analysis, checked at the level of individual measurement settings, reaches 0.01~rad per parameter at a representative point, and decoder priors rebuilt from such an estimate retain most of their correlation gain. Propagating the generator into a distance-three surface code gives a 14.8-fold encoding gain when the generator is known exactly, and 1.21-fold of the correlation gain survives when the prior is rebuilt from an estimate at the stated precision, closing the loop from characterization to decoding.
Can logical channels produced by error-correction circuits identify a coherent physical-noise generator, rather than only its Pauli statistics? This paper studies three-qubit noise comprising arbitrary local rotations and nearest-neighbor ZZ couplings: eleven parameters in Θ=[−0.1,0.1]9×[−0.05,0.05]2. Its probe combines a single-qubit reference channel with logical channels from measurement-free bit-flip and phase-flip correction.
An exact rational-arithmetic Jacobian certificate establishes generic local identifiability from the resulting 48-component Pauli-transfer-matrix fingerprint. Across 500 sampled points, the full seven-channel Jacobian has smallest singular value between 3.56×10−3 and 0.130. Global uniqueness fails: reflection of the chain, combined with compensating local rotations, produces exact collisions between physically distinct regular points. The reflection-generated collision locus is classified, and one additional two-qubit marginal channel provably distinguishes these pairs. Four concatenated second-level channels add statistical information but no identifying equations; their precision benefit depends on gate and measurement costs.
An ideal measurement-level Fisher calculation gives a representative budget of approximately 1.3×107 measurement events for 0.01 rad per-parameter precision. Calibration bias and conditioning can impose substantially stricter requirements. A single-round, ideal-syndrome distance-three surface-code simulation gives a 1.239-fold improvement from correlated versus factorized decoder priors, falling to a median 1.209 with estimated parameters.
The guarantees concern the specified three-qubit unitary family. Accidental non-reflection collisions remain unexcluded; general-size identifiability, nonunitary noise, noisy syndrome extraction, and multiround validation are not established.
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.
Accurate noise classification is essential for operating near-term quantum processors, yet existing approaches, such as quantum process tomography, scale exponentially with system size, limiting their practicality for routine calibration. We propose a measurement-efficient noise fingerprinting pipeline that combines structured classical shadow tomography with physics-informed feature engineering to identify noise channels from a fixed set of 3-qubit probe circuits. Each sample is represented by a feature vector constructed from randomized Pauli measurements and derived observables designed to resolve physically similar noise channels that produce overlapping signatures under generic measurement sets. We evaluate random forest, extra trees, and a multilayer perceptron on 10,000 labeled samples spanning ten noise models. The three classifiers achieve comparable performance. In the reported runs, random forest and extra trees perform similarly, achieving approximately 0.736 test accuracy and 0.729-0.730 macro F1, compared with 0.715 accuracy and 0.699 macro F1 for the multilayer perceptron. We further analyze the effect of the noise-strength sampling range and conduct a limited sensitivity check using analogous 2- and 4-qubit probes. Confusion analysis shows that readout error, phase flip, thermal relaxation, and bit flip are classified with high reliability, while most remaining errors occur among channels with similar physical effects.
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.
Coherent Hamiltonian drifts and systematic errors can pass through quantum error correction differently than stochastic Pauli noise: they generate phase components of the logical channel that are lost under full Pauli twirling. We consider the Lindbladian dynamics of n physical qubits propagated through an effective logical channel of a fixed encoding, recovery, and decoding scheme. The work is methodological in character: standard ideas of observability and minimal realization from linear systems theory are applied to the channel \[
ω
\mapsto
Φ_t(ω)
=
\cD e^{t\cL}\cE(ω), \] where \(\cE\) encodes the logical state and \(\cD\) is the chosen recovery map with final decoding. The minimal code-visible space \(\cK_{\rm code}\) is defined as the Krylov closure of the decodable logical observables with respect to \(\cL^\dagger\); its observable factorization yields a minimal realization of the logical channel. In this form, the Knill--Laflamme conditions serve as a short-time consistency check, Pauli noise on stabilizer codes reduces to a chain on syndrome-logical classes, and the choice of recovery map acts as a spectral filter on the visible modes. For quantum memory, the same language yields an estimate of the storage time in terms of the dominant visible eigenvalues of the logical channel of the correction cycle. Particular attention is paid to the spectral signatures of coherent noise and to how these signatures depend on the chosen decoder.
What must a quantum error-correction decoder know about temporally correlated noise, and what does it cost to learn? We study this question for fixed stabilizer memory experiments with known system-environment interactions. We formulate calibration in terms of the fidelity differences that select a Pauli recovery and relate missing information to the resulting fidelity loss. Our main example uses weak coherent X rotations in a class of CSS codes including Shor, Steane, and odd-distance rotated surface codes. All physical qubits share a sign either fixed throughout a run or independently redrawn each interval. The two models have identical syndrome statistics and the same spatiotemporal Pauli process (SPP), obtained by Pauli-twirling every noise interval. Yet at suitable storage times, they require different logical corrections. In the weak-noise limit, each model is almost perfectly correctable when known. Without model information, even the best final recovery has a worst-case fidelity loss approaching 1/2 relative to the noise-aware optimum, despite access to the full syndrome record. For this pair of models, at fixed code and fixed positive target loss below 1/2, we prove matching calibration bounds. With logical preparation and final readout, complete QEC cycles require a number of noise intervals scaling as the inverse rotation angle raised to the code's X distance. Allowing two uninterrupted intervals before one extraction reduces the optimal cost to inverse-square scaling. Physical Pauli twirling of every noise interval changes both recovery performance and its information requirements. Discarding the record of applied random Pauli operations makes the SPP sufficient for optimal recovery. Keeping this record can improve the attainable fidelity, but reaching that optimum may require additional noise information.
This Zenodo record is the Supplemental Material for the manuscript "Probing Coherent Noise with Stabilizer Codes: Identifiability, Ambiguity, and Decoder Priors" (Long Huang, Sichuan Normal University). It is the operating manual for the probe on a target device: the device and gate parameters the protocol is written for, the seven stabilizer-code channels with their prepare–encode–expose–decode–recover–tomograph sequence, the twelve tomography settings per channel, readout correction and null-channel deconvolution of state-preparation-and-measurement error, the interleaved acquisition schedule and its drift tolerance, the shot budget together with the saturation point set by a non-unitary component, and the acceptance criteria for a session.This record describes the protocol and the hardware parameters it assumes; no experimental data enter it or the manuscript. The model-space scan and the non-unitary error budget are Appendices F and G of the main article. The scripts and tabulated data behind them, and behind Figs. 1–3 and Tables I–IX of the manuscript, are archived separately under DOI 10.5281/zenodo.23794746 (concept DOI 10.5281/zenodo.23794180, which always resolves to the newest version). Popular_Summary.pdf is a non-technical summary of the same work.