Non-linear Sigma Model for the Surface Code with Coherent Errors

• URL: http://arxiv.org/abs/2603.25665v1
• Date: Thu, 26 Mar 2026 17:19:08 GMT
• Title: Non-linear Sigma Model for the Surface Code with Coherent Errors
• Abstract summary: We study maximum-likelihood decoding of the square-lattice surface code in the presence of single-qubit unitary rotations.<n>We microscopically derive a non-linear sigma model with target space $mathrmSO (2n)/mathrmU(n)$ as the effective long-distance theory of this decoding problem.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The surface code is a promising platform for a quantum memory, but its threshold under coherent errors remains incompletely understood. We study maximum-likelihood decoding of the square-lattice surface code in the presence of single-qubit unitary rotations that create electric anyon excitations. We microscopically derive a non-linear sigma model with target space $\mathrm{SO}(2n)/\mathrm{U}(n)$ as the effective long-distance theory of this decoding problem, with distinct replica limits: $n\to1$ for optimal decoding, which assumes knowledge of the coherent rotation angle, and $n\to0$ for suboptimal decoding with imperfect angle information. This exposes a sharp distinction between the two decoders. The suboptimal decoder supports a ``thermal-metal'' phase, a non-decodable regime that is qualitatively distinct from the conventional non-decodable phase of the surface code under incoherent Pauli errors. By contrast, the metal phase cannot arise in optimal decoding, since the metallic fixed-point becomes unstable in the $n\to 1$ replica limit. We argue that optimal decoding may be possible up to the maximally-coherent rotation angle. Within the sigma model description, we show that the decoding fidelity is related to twist defects of the order-parameter field, yielding quantitative predictions for its system-size dependence near the metallic fixed point for both decoders. We examine our analytic predictions for the decoding fidelity as well as other physical observables with extensive numerical simulations. We discuss how the symmetries and the target space for the sigma model rely on the lattice of the surface code, and how a stable thermal metal phase can arise in optimal decoding when the syndromes reside on a non-bipartite lattice.

Related papers

• Geometry Dependence of Error Thresholds in Two-Dimensional Toric Codes [0.0]
  We investigate how the lattice geometry influences the error thresholds of two-dimensional toric codes.<n>We compute these optimal error thresholds on the Nishimori line for the square, honeycomb, triangular, dice, and kagome lattices.
  arXiv  Detail & Related papers  (2026-09-07T14:53:08Z)
• Physics-Informed Graph-Neural Decoding of the Surface Code: the Logical Signal as an Exact Topological Pairing [0.0]
  We develop a physics-informed graph neural network (GNN) decoder for the surface code that solves a discrete Poisson equation on the syndrome graph.<n>We show that the solver's edge current is a pure gradient flow whose harmonic (circulating) part vanishes identically.<n>We prove that this pairing is evaluated exactly and in closed form, with no learned readout parameters, as the net current drained between the two boundary sinks.
  arXiv  Detail & Related papers  (2026-07-22T12:03:14Z)
• Nishimori Threshold Estimation for Bayesian Inference and $\mathbb{Z}_q$ Surface Code Decoding [0.4910937238451485]
  We introduce an analytical estimate of error thresholds falling into the Nishimori universality class via a Fourier--Walsh projection scheme.<n>We find that the threshold values not only accurately agree with recent decohered-$mathbb Z_q$-toric-code numerics, but are found to satisfy the Gilbert-Varshamov self-dual entropy relation.<n>Our approach thereby points to a deeper connection between the clean and Born-disordered models, while allowing for instant analytical estimates of error thresholds for a variety of stabilizer codes.
  arXiv  Detail & Related papers  (2026-07-20T18:00:00Z)
• Representational Capacity: Geometric Limits on Feature Representation in Transformer Language Models [51.56484100374058]
  We develop a framework for estimating how many near-orthogonal directions a model can support.<n>Applying this metric across dozens of open-source models reveals two classes: models with high $varepsilon$ whose embeddings lack near-orthogonal structure, and models with low $varepsilon$ that maintain it.
  arXiv  Detail & Related papers  (2026-06-01T18:28:56Z)
• Fitting Unknown Number of Hyperplanes with Manifold Optimization [57.48093263119306]
  Fitting unknown number of linearplanes to data is a fundamental yet challenging problem in machine learning.<n>Existing approaches often struggle with optimum optima or lack geometric consistency.
  arXiv  Detail & Related papers  (2026-05-27T14:02:20Z)
• Charge-Informed Quantum Error Correction [0.0]
  We investigate the statistical physics of quantum error correction in $rm U(1)$-enriched topological quantum memories.<n>The error threshold of the optimal decoder corresponds to a continuous phase transition in a disordered two-dimensional integer loop model on the Nishimori line.<n>We show that the optimal decoding transition exhibits Berezinskii-Kosterlitz-Thouless with a modified universal jump in winding number variance.
  arXiv  Detail & Related papers  (2025-12-26T18:59:21Z)
• A Lindblad-Pauli Framework for Coarse-Grained Chaotic Binary-State Dynamics [0.0]
  We develop a two-state framework that embeds coarse-grained left/right statistics of the driven Duffing oscillator into a $2times2$ density-matrix representation.<n>For diagonal states the GKSL dynamics reduces to the classical two-state equation.<n>We derive closed-form solutions, an explicit Kraus representation, and practical diagnostics for the time-geneous first-order Markov assumption.
  arXiv  Detail & Related papers  (2025-12-19T03:27:05Z)
• Dendrograms of Mixing Measures for Softmax-Gated Gaussian Mixture of Experts: Consistency without Model Sweeps [41.371172458797524]
  Non-identifiability of gating parameters up to common translations, intrinsic gate-expert interactions, and tight numerator-denominator coupling are addressed.<n>For model selection, we adapt dendrogram-guided SGMoE, yielding a consistent, sweep-free selector of the number of experts that attains optimal parameter rates.<n>On a dataset of drought-identifiable maize traits, our dendrogram-guided SGMoE selects two experts, exposes a clear mixing hierarchy, stabilizes the likelihood early, and yields interpretable genotype-phenotype maps.
  arXiv  Detail & Related papers  (2025-10-14T17:23:44Z)
• Statistical mechanical mapping and maximum-likelihood thresholds for the surface code under generic single-qubit coherent errors [0.0]
  We consider single-qubit coherent errors in the surface code, i.e., rotations by angle $alpha$ about an axis that can be chosen arbitrarily.<n>We chart in a subspace of rotation axes to estimate the corresponding maximum-likelihood thresholds $alpha_mathrmth$.<n>The error correcting phase, $alphaalpha_mathrmth$, is shown to correspond in transfer matrix space to a gapped one-dimensional quantum Hamiltonian.
  arXiv  Detail & Related papers  (2024-10-29T18:23:23Z)
• Complexity Matters: Rethinking the Latent Space for Generative Modeling [65.64763873078114]
  In generative modeling, numerous successful approaches leverage a low-dimensional latent space, e.g., Stable Diffusion. In this study, we aim to shed light on this under-explored topic by rethinking the latent space from the perspective of model complexity.
  arXiv  Detail & Related papers  (2023-07-17T07:12:29Z)
• The END: An Equivariant Neural Decoder for Quantum Error Correction [73.4384623973809]
  We introduce a data efficient neural decoder that exploits the symmetries of the problem. We propose a novel equivariant architecture that achieves state of the art accuracy compared to previous neural decoders.
  arXiv  Detail & Related papers  (2023-04-14T19:46:39Z)
• Gradient-Free Methods for Deterministic and Stochastic Nonsmooth Nonconvex Optimization [94.19177623349947]
  Non-smooth non optimization problems emerge in machine learning and business making. Two core challenges impede the development of efficient methods with finitetime convergence guarantee. Two-phase versions of GFM and SGFM are also proposed and proven to achieve improved large-deviation results.
  arXiv  Detail & Related papers  (2022-09-12T06:53:24Z)
• A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
  We propose a hybrid quantum-classical algorithm for robust fitting. Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs. We present results obtained using an actual quantum computer.
  arXiv  Detail & Related papers  (2022-01-25T05:59:24Z)
• Optimal Thresholds for Fracton Codes and Random Spin Models with Subsystem Symmetry [10.029027477019984]
  We calculate optimal error thresholds for quantum error correcting codes based on fracton models. By mapping the error-correction process for bit-flip and phase-flip noises into novel statistical models, we obtain models that exhibit an unconventional subsystem symmetry.
  arXiv  Detail & Related papers  (2021-12-09T18:56:42Z)

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.