Coherent errors in stabilizer codes are often correlated across qubits and QEC cycles. Having a general analytical treatment of such noise would thus be extremely valuable. We derive here the exact logical channel induced by repeated QEC cycles under correlated coherent $Z$ noise, and develop a broadly general cumulant-expansion framework that yields a tractable expression for the noise-averaged logical infidelity. Crucially, this expression is non-perturbative in the noise, and applies to arbitrary stabilizer codes and correlation structures. It reveals a feature with no analogue in standard stochastic Pauli error models: the induced channel depends on which stabilizer eigenspace is chosen as the codespace. Exploiting this, we introduce protected stabilizer eigenspace (PROSE) encoding, an error-suppression strategy that selects the optimal codespace. We show that this eigenspace can be efficiently identified in many relevant situations. Further, when combined with logical Pauli twirling, PROSE matches or outperforms standard error suppression techniques (dynamical decoupling, Pauli twirling of physical qubits). We also show that noise correlations, usually assumed to be harmful to QEC, can instead be a resource: with the right encoding, even positive correlations reduce the logical infidelity below the uncorrelated baseline. Our results offer a new, broadly applicable lens on correlated coherent noise in stabilizer codes.
Coherent errors in stabilizer codes are often correlated across qubits and QEC cycles. Having a general analytical treatment of such noise would thus be extremely valuable. We derive here the exact logical channel induced by repeated QEC cycles under correlated coherent Z noise, and develop a broadly general cumulant-expansion framework that yields a tractable expression for the noise-averaged logical infidelity. Crucially, this expression is non-perturbative in the noise, and applies to arbitrary stabilizer codes and correlation structures. It reveals a feature with no analogue in standard stochastic Pauli error models: the induced channel depends on which stabilizer eigenspace is chosen as the codespace. Exploiting this, we introduce protected stabilizer eigenspace (PROSE) encoding, an error-suppression strategy that selects the optimal codespace. We show that this eigenspace can be efficiently identified in many relevant situations. Further, when combined with logical Pauli twirling, PROSE matches or outperforms standard error suppression techniques (dynamical decoupling, Pauli twirling of physical qubits). We also show that noise correlations, usually assumed to be harmful to QEC, can instead be a resource: with the right encoding, even positive correlations reduce the logical infidelity below the uncorrelated baseline. Our results offer a new, broadly applicable lens on correlated coherent noise in stabilizer codes.
The performance of a given quantum error correction (QEC) code depends upon the noise model that is assumed. Independent Pauli noise, applied after each quantum operation, is a simplistic noise model that is easy to simulate and understand in the context of stabilizer codes. Although such a noise model is artificial, it is equivalent to independent, random, unbiased qubit rotations. What about spatially or temporally correlated qubit rotations? Such a noise model is applicable to global operations (e.g., NMR or ESR), common control sources (e.g., lasers), or slow drift (e.g., charge or magnetic noise) in various qubit technologies. In the worst case, such errors can combine constructively and result in a post-correction failure rate that increases with the number of error correction cycles. However, we show that this worst case does not generally arise unless taking active corrective actions while performing QEC. That is, by employing virtual Pauli frame updates ("passive" error correction) rather than physical corrections ("active" error correction), coherent errors do not compound appreciably. Starting in a random Pauli frame is also advantageous. In fact, through perturbation theory arguments and supporting numerical simulations, we show that the logical qubit performance beyond distance 3 for correlated single-qubit Hamiltonian noise models (i.e., global errant qubit rotations), when employing these "lazy" strategies, essentially matches the performance of Pauli noise model with the same process fidelity (fidelity after one application). In a more general circuit model of noise, correlations may add constructively within syndrome extraction rounds but Pauli frame randomization from passive error correction mitigates this effect across multiple rounds.
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.
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.
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.
Correlated noise is a critical failure mode in quantum error correction (QEC), yet a gap remains between the stochastic Pauli models used for scalable QEC analyses and the microscopic, non-Markovian descriptions of noise in physical devices. We bridge this gap by introducing Spatiotemporal Pauli Processes (SPPs): the natural multi-time generalization of Pauli channels, joint probability distributions over Pauli faults across space and time, obtained exactly from any noise process, however non-Markovian, under standard Pauli-frame randomization. SPPs thereby provide a single language in which correlated noise can be recast, compared, and extended, compatible with both microscopic open systems modeling and the stabilizer workflow of QEC design and analysis. Our central result is constructive: the multi-time Pauli twirl acts by local contractions on a process tensor network, yielding an explicit classical tensor network whose virtual bonds encode memory, bounded by the environment's Liouville-space dimension. Transfer operator diagnostics link memory spectra to correlation decay, and hidden Markov representations enable efficient sampling of correlated Pauli fault trajectories, mapping microscopically derived noise directly into circuit-level QEC simulation. We demonstrate this with surface code memory and stability benchmarks up to distance 19. A temporal "storm" model with tunable correlation time shows that memory alone, at strictly fixed marginal error rates, systematically erodes the exponential error suppression expected from code distance. A genuinely spatiotemporal quantum cellular automaton bath maps exactly, under system twirling, to a nonlinear probabilistic cellular automaton; tuning its coherent interactions drives the noise into a pseudo-critical regime with critical slowing down and macroscopic error avalanches that reverse surface code distance scaling.
Quantum error correction/detection (QEC/QED) and dynamical decoupling (DD) are tools for protecting quantum information. A natural goal is to combine them to outperform either approach alone. Such a benefit is not automatic: physical DD can conflict with encoded subspace, and QEC performance is governed by the errors that survive decoding, not just those DD suppresses. We analyze a hybrid memory cycle where DD is implemented logically (LDD) using normalizer elements of an [[n,k,d]] stabilizer code, followed by a round of syndrome measurement and recovery (or, in the detection setting, postselection on a trivial syndrome). In an effective Pauli model with physical error probability p, LDD suppression factor pDD, and recovery imperfection rate pQEC (or pQED), we derive closed-form entanglement-fidelity expressions for QEC-only, QED-only, LDD-only, physical DD, and the hybrid LDD+QEC protocol. The formulas are expressed via a small set of code-dependent weight enumerator polynomials, making the role of the decoder and the LDD group explicit. For ideal recovery LDD+QEC outperforms QEC-only iff the conditional fraction of uncorrectable Pauli errors is larger in the LDD-suppressed sector than in the unsuppressed sector. In the low-noise regime, a sufficient design rule guaranteeing hybrid advantage is that LDD suppresses at least one minimum-weight uncorrectable Pauli error for the chosen recovery map. We show how stabilizer-equivalent choices of LDD generators can enforce this condition. We supplement our analysis with numerical results for the [[7,1,3]] Steane code and a [[13,1,3]] code, mapping regions of hybrid-protocol advantage in parameter space beyond the small-p regime. Our work illustrates the need for co-design of the code, decoder, and logical decoupling group, and clarifies the conditions under which the hybrid LDD+QEC protocol is advantageous.