Geometry Dependence of Error Thresholds in Two-Dimensional Toric Codes

• URL: http://arxiv.org/abs/2609.07579v1
• Date: Mon, 07 Sep 2026 14:53:08 GMT
• Title: Geometry Dependence of Error Thresholds in Two-Dimensional Toric Codes
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We investigate how the lattice geometry influences the error thresholds of two-dimensional toric codes. In the presence of bit- or phase-flip errors, the toric code maps onto the two-dimensional random-bond Ising model (RBIM). We determine the critical behaviour of the RBIM using replica-exchange Monte Carlo simulations. While previous studies have explored thresholds for general lattice geometries under suboptimal decoders such as minimum-weight perfect matching, the rapid development of near-optimal decoders makes resolving the ultimate, maximum-likelihood code capacity relevant. We compute these optimal error thresholds on the Nishimori line for the square, honeycomb, triangular, dice, and kagome lattices. Owing to lattice duality, the phase-flip threshold on a given lattice is equivalent to the bit-flip threshold on its dual. We find that the optimal thresholds of dual-lattice pairs display a characteristic duality-driven splitting around the self-dual square-lattice, mirroring the qualitative behaviour observed for suboptimal decoders. While the average coordination number has the strongest impact on the error threshold, our results demonstrate that the detailed arrangement of vertices and plaquettes also plays a significant role in determining its precise value.

Related papers

• Theory of approximate quantum error correction and the error-set model [53.73800998389749]
  We develop a theory of approximate quantum error correction based on the error-set model.<n>Code correcting a given error set automatically protects against every channel whose Kraus operators lie in their linear span.<n>This linearity gives rise to code distance, the equivalence between erasures and general errors, and a theory ofally good codes.
  arXiv  Detail & Related papers  (2026-07-25T02:15:33Z)
• 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)
• 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)
• Regularized Online RLHF with Generalized Bilinear Preferences [68.44113000390544]
  We consider the problem of contextual online RLHF with general preferences.<n>We adopt the Generalized Bilinear Preference Model to capture preferences via low-rank, skew-symmetric matrices.<n>We prove that the dual gap of the greedy policy is bounded by the square of the estimation error.
  arXiv  Detail & Related papers  (2026-02-26T15:27:53Z)
• 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)
• Phenomenological Noise Models and Optimal Thresholds of the 3D Toric Code [3.1189678982805216]
  Three-dimensional (3D) topological codes offer the advantage of supporting fault-tolerant implementations of non-Clifford gates.<n>We show that the 3D toric code exhibits optimal thresholds of $pX,M_th approx 11%$ and $pZ,M_th approx 2%$ against bit-flip and phase-flip errors.
  arXiv  Detail & Related papers  (2025-10-23T12:30:55Z)
• 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)
• 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)
• Canny-VO: Visual Odometry with RGB-D Cameras based on Geometric 3D-2D Edge Alignment [85.32080531133799]
  This paper reviews the classical problem of free-form curve registration and applies it to an efficient RGBD visual odometry system called Canny-VO. Two replacements for the distance transformation commonly used in edge registration are proposed: Approximate Nearest Neighbour Fields and Oriented Nearest Neighbour Fields. 3D2D edge alignment benefits from these alternative formulations in terms of both efficiency and accuracy.
  arXiv  Detail & Related papers  (2020-12-15T11:42:17Z)
• Convex Geometry and Duality of Over-parameterized Neural Networks [70.15611146583068]
  We develop a convex analytic approach to analyze finite width two-layer ReLU networks. We show that an optimal solution to the regularized training problem can be characterized as extreme points of a convex set. In higher dimensions, we show that the training problem can be cast as a finite dimensional convex problem with infinitely many constraints.
  arXiv  Detail & Related papers  (2020-02-25T23:05:33Z)

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.