Nishimori Threshold Estimation for Bayesian Inference and $\mathbb{Z}_q$ Surface Code Decoding

• URL: http://arxiv.org/abs/2607.18374v1
• Date: Mon, 20 Jul 2026 18:00:00 GMT
• Title: Nishimori Threshold Estimation for Bayesian Inference and $\mathbb{Z}_q$ Surface Code Decoding
• Abstract summary: 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.
• Score: 0.4910937238451485
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In quantum error correction, the error threshold provides essential quantitative guidance for the ability to bring about fault-tolerance through decoding the effects of incoherent noise, weak measurement or inference. However, the numerical value of an error threshold is typically only accessible through large-scale numerical simulations of the underlying noise model. Here we introduce an analytical estimate of error thresholds falling into the Nishimori universality class via a Fourier--Walsh projection scheme that maps the critical point of the underlying disorder-free statistical-mechanics model to the Born-disordered Nishimori critical point. Using a minimal replica theory approach, this closed-form estimate is obtained from a projection of the exact replicated single-bond weight which we find to reproduce (within a percentage point) the known numerical thresholds of random-bond and random-plaquette Ising models / $\mathbb Z_2$ stabilizer codes in spatial dimensions $d=2-5$, and extends to Potts variables with $q\le4$. The main application of our projection scheme is to $\mathbb Z_q$ surface codes, whose decoding problem maps to the disordered $q$-state clock model. For $q\ge5$ the clean clock model has \textit{two} Berezinskii--Kosterlitz--Thouless transitions, which the projection maps to two Nishimori temperatures that bound an intermediate information-critical phase. The resulting 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 $\ln q \simeq H_q(T_1^\ast)+H_q(T_2^\ast),$ although no duality condition is imposed in the construction. 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.

Related papers

• Scalable Lindblad Noise Learning via Stochastic Tensor-Network Simulation [48.887627688666974]
  Learning dissipation rates in large-scale open quantum systems is a major obstacle for near-term quantum technologies.<n>Here, we propose a scalable noise-learning framework for Lindblad dissipation rates that combines a simulation method, the Jump Method (TJM)<n>We demonstrate the approach on two noise models in the Ising model, in which independent dissipation rates are learned for each site up to $N_mathrmsite=16$.<n>This combination of scalable numerics and rigorous theoretical guarantees positions TJM-based noise learning as a practical foundation for characterizing dissipation in large quantum devices.
  arXiv  Detail & Related papers  (2026-08-25T15:07:11Z)
• How Neural Reward Models Learn Features for Policy Optimization: A Single-Index Analysis [53.063298916923976]
  We study the feedback in a Gaussian single-index model with $r*(x) = *(langle *, xrangle)$ and $x sim N(0, I_d)$.<n>We analyze a two-stage neural reward model that first learns the hidden direction $*$ from reward-weighted samples and then fits the readout layer by weighted ridge regression.
  arXiv  Detail & Related papers  (2026-05-23T22:00:38Z)
• Provably Adaptive Linear Approximation for the Shapley Value and Beyond [73.0940890296463]
  A fundamental and long-standing challenge is their efficient approximation.<n>We develop a linear-space algorithm that requires $P(|hatboldsymbol-boldsymbol|_2geq)leq $ for all commonly used semi-values.<n>Our algorithm allows explicit minimization of the mean square error for each specific utility function.
  arXiv  Detail & Related papers  (2026-04-09T16:38:14Z)
• Non-linear Sigma Model for the Surface Code with Coherent Errors [0.0]
  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.
  arXiv  Detail & Related papers  (2026-03-26T17:19:08Z)
• 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)
• The random coupled-plaquette gauge model and the surface code under circuit-level noise [1.351813974961217]
  We optimally account for genuine Y-errors in the surface code in a setting with noisy measurements.<n>We tackle the circuit-level noise scenario, where we use a reduction technique to find effective asymmetric depolarizing and syndrome noise rates.
  arXiv  Detail & Related papers  (2024-12-18T16:20:14Z)
• 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)
• Towards Optimal Statistical Watermarking [95.46650092476372]
  We study statistical watermarking by formulating it as a hypothesis testing problem. Key to our formulation is a coupling of the output tokens and the rejection region. We characterize the Uniformly Most Powerful (UMP) watermark in the general hypothesis testing setting.
  arXiv  Detail & Related papers  (2023-12-13T06:57:00Z)
• Understanding the Under-Coverage Bias in Uncertainty Estimation [58.03725169462616]
  quantile regression tends to emphunder-cover than the desired coverage level in reality. We prove that quantile regression suffers from an inherent under-coverage bias. Our theory reveals that this under-coverage bias stems from a certain high-dimensional parameter estimation error.
  arXiv  Detail & Related papers  (2021-06-10T06:11:55Z)
• The Generalized Lasso with Nonlinear Observations and Generative Priors [63.541900026673055]
  We make the assumption of sub-Gaussian measurements, which is satisfied by a wide range of measurement models. We show that our result can be extended to the uniform recovery guarantee under the assumption of a so-called local embedding property.
  arXiv  Detail & Related papers  (2020-06-22T16:43:35Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

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.