Efficient foundation decoders for fault-tolerant quantum computing

• URL: http://arxiv.org/abs/2606.27119v1
• Date: Thu, 25 Jun 2026 14:58:33 GMT
• Title: Efficient foundation decoders for fault-tolerant quantum computing
• Abstract summary: We propose a unified framework for efficient foundation decoders.<n>A central feature of NTU is its ability to align decoding tasks across code distances.<n>We instantiate NTU-Transformer as a transformer-based neural decoder.
• Score: 11.676261938547562
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Foundation decoders, a class of high-capacity neural decoders, are leading candidates for fault-tolerant quantum computing, with accurate and efficient decoding at large code distances. However, their construction often faces a steep scaling barrier, as larger code distances rapidly amplify the cost of syndrome generation and neural optimization. To address this bottleneck, here we devise neural transfer unification (NTU), a unified framework for efficient foundation decoders. A central feature of NTU is its ability to align decoding tasks across code distances via algebraic structures shared by scalable code families, which enables knowledge learned on smaller codes to accelerate large-scale decoder training. We instantiate NTU as NTU-Transformer, a transformer-based neural decoder tailored for planar surface codes and bivariate bicycle codes. For planar surface codes under circuit-level noise, NTU-Transformer outperforms correlation-aware matching on the $[\![361,1,19]\!]$ code and further scales to the $[\![625,1,25]\!]$ code, where it exceeds standard matching through transfer adaptation. For the bivariate bicycle code with $[\![72,12,6]\!]$, it surpasses Relay-BP in the low-physical-error regime. These results establish our proposal as a scalable route to amortized cross-distance training of foundation decoders for fault-tolerant quantum processors.

Related papers

• Learning to Decode Concatenated Quantum Codes with Hierarchical Message Passing [6.26319455798863]
  We introduce a neural message-passing framework for decoding generald stabilizer codes.<n>For many hypercube codes, a decoder fine-tuned on circuit-level errors in Knill's teleportation-based error correction can achieve lower logical failure rates.
  arXiv  Detail & Related papers  (2026-08-28T17:48:04Z)
• Neural Belief-Matching Decoding for Topological Quantum Error Correction Codes [2.9506547907696006]
  Topological codes, such as the toric code, offer hardware-efficient architectures.<n>We propose two key improvements for the decoding of toric code.<n>The first is replacing the BP decoder by a neural BP decoder, giving rise to the neural belief-matching decoder.
  arXiv  Detail & Related papers  (2026-03-23T09:15:48Z)
• 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)
• Efficient and Universal Neural-Network Decoder for Stabilizer-Based Quantum Error Correction [44.698141103370546]
  GraphQEC is a code-agnostic decoder leveraging machine-learning on the graph structure of stabilizer codes with linear time complexity.<n>Our approach represents the first universal solution for real-time quantum error correction across arbitrary stabilizer codes.
  arXiv  Detail & Related papers  (2025-02-27T10:56:53Z)
• Accelerating Error Correction Code Transformers [56.75773430667148]
  We introduce a novel acceleration method for transformer-based decoders. We achieve a 90% compression ratio and reduce arithmetic operation energy consumption by at least 224 times on modern hardware.
  arXiv  Detail & Related papers  (2024-10-08T11:07:55Z)
• Unified Error Correction Code Transformer with Low Complexity [41.04310848437611]
  Traditional decoders require dedicated hardware for each code, leading to high hardware costs.<n>We propose a unified Transformer-based decoder that handles multiple linear block codes within a single framework.
  arXiv  Detail & Related papers  (2024-10-04T12:30:42Z)
• Learning Linear Block Error Correction Codes [62.25533750469467]
  We propose for the first time a unified encoder-decoder training of binary linear block codes. We also propose a novel Transformer model in which the self-attention masking is performed in a differentiable fashion for the efficient backpropagation of the code gradient.
  arXiv  Detail & Related papers  (2024-05-07T06:47:12Z)
• 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)
• Graph Neural Networks for Channel Decoding [71.15576353630667]
  We showcase competitive decoding performance for various coding schemes, such as low-density parity-check (LDPC) and BCH codes. The idea is to let a neural network (NN) learn a generalized message passing algorithm over a given graph. We benchmark our proposed decoder against state-of-the-art in conventional channel decoding as well as against recent deep learning-based results.
  arXiv  Detail & Related papers  (2022-07-29T15:29:18Z)
• Error Correction Code Transformer [92.10654749898927]
  We propose to extend for the first time the Transformer architecture to the soft decoding of linear codes at arbitrary block lengths. We encode each channel's output dimension to high dimension for better representation of the bits information to be processed separately. The proposed approach demonstrates the extreme power and flexibility of Transformers and outperforms existing state-of-the-art neural decoders by large margins at a fraction of their time complexity.
  arXiv  Detail & Related papers  (2022-03-27T15:25:58Z)
• ProductAE: Towards Training Larger Channel Codes based on Neural Product Codes [9.118706387430885]
  It is prohibitively complex to design and train relatively large neural channel codes via deep learning techniques. In this paper, we construct ProductAEs, a computationally efficient family of deep-learning driven (encoder, decoder) pairs. We show significant gains, over all ranges of signal-to-noise ratio (SNR), for a code of parameters $(100,225)$ and a moderate-length code of parameters $(196,441)$.
  arXiv  Detail & Related papers  (2021-10-09T06:00:40Z)

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.