Local decoder for the toric code with a high pseudo-threshold

• URL: http://arxiv.org/abs/2603.02328v1
• Date: Mon, 02 Mar 2026 19:00:24 GMT
• Title: Local decoder for the toric code with a high pseudo-threshold
• Authors: Louis Paletta,
• Abstract summary: Local decoders provide a promising approach to real-time quantum error-correction.<n>We propose a new local decoder for Kitaev's toric code: the 2D signal-rule.<n>We present numerical evidence of exponential logical error suppression with system size below some critical error rate.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Local decoders provide a promising approach to real-time quantum error-correction by replacing centralized classical processing, with significant hardware constraints, by a fully distributed architecture based on a simple, local update rule. We propose a new local decoder for Kitaev's toric code: the 2D signal-rule, that interprets odd parity stabilizer measurements as defects, attracted to each other via the exchange of binary signals. We present numerical evidence of exponential logical error suppression with system size below some critical error rate, under a phenomenological noise model, with data and measurement errors between each iteration. Compared to previously known local decoders, which exhibit suboptimal thresholds and scaling, our construction halves (in log scale) the threshold gap with state-of-the-art decoders, and achieves optimal scaling for experimentally relevant system sizes, enabling the practical realization of a two-dimensional local quantum memory.

Related papers

• A Mixture of Experts Vision Transformer for High-Fidelity Surface Code Decoding [12.998419492098462]
  Topological stabilizer codes are particularly appealing due to their geometric locality and practical relevance.<n>We propose QuantumSMoE, a quantum vision transformer based decoder that incorporates code structure through plus shaped embeddings.<n> Experiments on the toric code demonstrate that QuantumSMoE outperforms state-of-the-art machine learning decoders.
  arXiv  Detail & Related papers  (2026-01-18T16:49:59Z)
• High-performance local decoders for defect matching in 1D [2.5899040911480182]
  We propose two new types of local decoders for the quantum repetition code in one dimension.<n>The signal-rule decoders interpret odd parities between neighboring qubits as defects, attracted to each other via the exchange of classical point-like excitations.<n>We prove the existence of a threshold in the code-capacity model and present numerical evidence of exponential logical error suppression.
  arXiv  Detail & Related papers  (2025-05-15T10:43:08Z)
• Toward a 2D Local Implementation of Quantum LDPC Codes [1.1936126505067601]
  Geometric locality is an important theoretical and practical factor for quantum low-density parity-check (qLDPC) codes.<n>We present an error correction protocol built on a bilayer architecture that aims to reduce operational overheads when restricted to 2D local gates.
  arXiv  Detail & Related papers  (2024-04-26T19:48:07Z)
• 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)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Denoising Diffusion Error Correction Codes [92.10654749898927]
  Recently, neural decoders have demonstrated their advantage over classical decoding techniques. Recent state-of-the-art neural decoders suffer from high complexity and lack the important iterative scheme characteristic of many legacy decoders. We propose to employ denoising diffusion models for the soft decoding of linear codes at arbitrary block lengths.
  arXiv  Detail & Related papers  (2022-09-16T11:00:50Z)
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes [61.411482146110984]
  We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes. Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC. We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
  arXiv  Detail & Related papers  (2022-03-09T18:48:54Z)
• Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements [58.720142291102135]
  We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit. We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
  arXiv  Detail & Related papers  (2021-08-02T16:12:13Z)
• Scalable Neural Decoder for Topological Surface Codes [0.0]
  We present a neural network based decoder for a family of stabilizer codes subject to noise and syndrome measurement errors. The key innovation is to autodecode error syndromes on small scales by shifting a preprocessing window over the underlying code. We show that such a preprocessing step allows to effectively reduce the error rate by up to two orders of magnitude in practical applications.
  arXiv  Detail & Related papers  (2021-01-18T19:02:09Z)
• Cellular automaton decoders for topological quantum codes with noisy measurements and beyond [68.8204255655161]
  We propose an error correction procedure based on a cellular automaton, the sweep rule, which is applicable to a broad range of codes beyond topological quantum codes. For simplicity, we focus on the three-dimensional (3D) toric code on the rhombic dodecahedral lattice with boundaries and prove that the resulting local decoder has a non-zero error threshold. We find that this error correction procedure is remarkably robust against measurement errors and is also essentially insensitive to the details of the lattice and noise model.
  arXiv  Detail & Related papers  (2020-04-15T18:00:01Z)

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.