Correlated Coherent Errors in Stabilizer Codes: A General Cumulant Framework and Interference-Based Error Suppression

• URL: http://arxiv.org/abs/2607.22503v1
• Date: Fri, 24 Jul 2026 17:16:19 GMT
• Title: Correlated Coherent Errors in Stabilizer Codes: A General Cumulant Framework and Interference-Based Error Suppression
• Abstract summary: Coherent errors in stabilizer codes are often correlated across qubits and QEC cycles.<n>We derive the exact logical channel induced by repeated QEC cycles under correlated coherent $Z$ noise.<n>We also show that noise correlations, usually assumed to be harmful to QEC, can instead be a resource.
• Score: 0.15393457051344298
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Probabilistic Error Cancellation for Single-Mode Gottesman-Kitaev-Preskill Codes [45.91504150103373]
  We study a quantum error mitigation method known as probabilistic error cancellation in the context of the Gottesman-Kitaev-Preskill code.<n>We employ the stabilizer subsystem decomposition for GKP codes to obtain an effective logical channel for noisy operations.
  arXiv  Detail & Related papers  (2026-09-15T12:29:45Z)
• Tailoring Strictly Proper Scoring Rules for Downstream Tasks: An Application to Causal Inference [48.78219918881965]
  We propose a principled framework for deriving task-specific strictly proper scoring rules by matching the local curvature of the downstream error metric.<n>We apply this to the Average Treatment Effect (ATE) estimation, deriving a closed-form loss and its corresponding canonical probability mapping.
  arXiv  Detail & Related papers  (2026-06-02T08:41:25Z)
• Constrained Code Generation with Discrete Diffusion [40.46661913038948]
  Constrained Diffusion for Code (CDC) is a training-free neurosymbolic inference framework for code generation.<n>CDC integrates constraint satisfaction directly into the reverse denoising process.<n>CDC consistently improves constraint satisfaction in functional correctness, security, and even syntax.
  arXiv  Detail & Related papers  (2026-05-16T06:15:47Z)
• FTPrimitiveBench: A Benchmark Suite For Logical Computation Under Hardware-Motivated and Biased Noise Models [2.3094992090533246]
  We introduce FTPrimitiveBench, a systematic benchmarking approach for studying how logical primitives interact with hardware-motivated noise.<n>Results extend memory benchmarks to active logical computation, where the interaction between noise structure and primitive implementation matters.
  arXiv  Detail & Related papers  (2026-05-05T17:59:59Z)
• Variational Kernel Design for Internal Noise: Gaussian Chaos Noise, Representation Compatibility, and Reliable Deep Learning [0.0]
  Internal noise in deep networks is usually inherited from perturbations such as dropout, hard masking, or additive perturbations.<n>We ask two questions: what correlation geometry should internal noise have, and is the implemented perturbation compatible with the representations it acts on?<n>We answer these questions through Variational Kernel Design (VKD), a framework in which a noise mechanism is specified by a law family, a correlation kernel, and an injection operator, and is derived from learning desiderata.
  arXiv  Detail & Related papers  (2026-03-18T05:12:56Z)
• Correcting coherent quantum errors by going with the flow [0.0]
  We show that the logical qubit performance beyond distance 3 for correlated single-qubit Hamiltonian noise models (i.e., global errant qubit rotations) matches the performance of Pauli noise model with the same process fidelity (fidelity after one application)<n>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.
  arXiv  Detail & Related papers  (2026-02-24T16:39:14Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Spacetime Spins: Statistical mechanics for error correction with stabilizer circuits [0.0]
  Recent progress in quantum error correction has prompted new paradigms where codes emerge from stabilizer circuits in spacetime.<n>We show how to construct statistical mechanical models for stabilizer circuits subject to independent Pauli errors.<n>Our framework offers a universal prescription to analyze, simulate, and compare the decoding properties of any stabilizer circuit.
  arXiv  Detail & Related papers  (2025-12-26T11:25:02Z)
• Constructing an approximate logical Markovian model of consecutive QEC cycles of a stabilizer code [0.0]
  One difficulty is the lack of a clear connection between logical performance and the low-level error models.<n>We prove that consecutive noisy QEC cycles can be modeled by a memoryless error process acting only on the logical subsystem.<n>We expect that the approximate logical Markovian model will be both a useful tool for logical characterization and an aid for designing stabilizer-code implementations with guarantees of logical performance.
  arXiv  Detail & Related papers  (2025-09-21T02:43:16Z)
• Overcoming the Zero-Rate Hashing Bound with Holographic Quantum Error Correction [40.671162828621426]
  Finding an optimal quantum code under biased noise is a challenging problem.<n> benchmark for this capacity is given by the hashing bound.<n>We show that zero-rate holographic codes, built from hyperbolic tensor networks, fulfill both conditions.
  arXiv  Detail & Related papers  (2024-08-12T15:35:03Z)
• Scalable noisy quantum circuits for biased-noise qubits [37.69303106863453]
  We consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits. For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to $106$ gates.
  arXiv  Detail & Related papers  (2023-05-03T11:27:50Z)
• Principal Bit Analysis: Autoencoding with Schur-Concave Loss [45.420030784128166]
  We consider a linear autocoder in which the variables are latent or corrupted by noise. As a second application, we consider a prototypical prototypical fixed-rate compressor.
  arXiv  Detail & Related papers  (2021-06-05T04:45:30Z)
• Noisy Recurrent Neural Networks [45.94390701863504]
  We study recurrent neural networks (RNNs) trained by injecting noise into hidden states as discretizations of differential equations driven by input data. We find that, under reasonable assumptions, this implicit regularization promotes flatter minima; it biases towards models with more stable dynamics; and, in classification tasks, it favors models with larger classification margin. Our theory is supported by empirical results which demonstrate improved robustness with respect to various input perturbations, while maintaining state-of-the-art performance.
  arXiv  Detail & Related papers  (2021-02-09T15:20:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.