Maximum Likelihood Decoding of Quantum Error Correction Codes

• URL: http://arxiv.org/abs/2605.17230v1
• Date: Sun, 17 May 2026 02:32:52 GMT
• Title: Maximum Likelihood Decoding of Quantum Error Correction Codes
• Abstract summary: Quantum error correction (QEC) is indispensable for realizing fault-tolerant quantum computation, yet its effectiveness hinges critically on the classical decoding algorithm.<n>Max likelihood decoding (MLD) is provably optimal, since it identifies the logical group with largest likelihood by summing over all possible errors within logical class.<n>Despite its optimality, MLD is computationally intractable in general (#P-hard), motivating a rich landscape of exact and approximate algorithms.
• Score: 13.939243286249486
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: Quantum error correction (QEC) is indispensable for realizing fault-tolerant quantum computation, yet its effectiveness hinges critically on the classical decoding algorithm that interprets noisy syndrome measurements. Among all possible decoding strategies, maximum likelihood decoding (MLD) is provably optimal, since it identifies the logical group with largest likelihood by summing over all possible errors within logical class consistent with the observed syndrome. Despite its optimality, MLD is computationally intractable in general (#P-hard), motivating a rich landscape of exact and approximate algorithms. In this topical review, we provide a unified perspective on MLD by surveying recent advances through three complementary lenses: statistical mechanics, tensor networks, and artificial intelligence. From the statistical mechanics viewpoint, the MLD problem maps onto evaluating partition functions of disordered spin models, enabling exact solutions for certain codes and noise models as well as threshold estimation via phase-transition analysis. From the tensor network perspective, approximate contraction of tensor networks on the code's factor graph yields decoders that closely approach MLD accuracy with polynomial computational cost. From the artificial intelligence perspective, neural-network-based decoders, including autoregressive generative models and recurrent transformers, learn to approximate the MLD distribution from data, achieving high accuracy with the parallelism afforded by modern hardware accelerators. We discuss the connections among these three approaches, review their application to both simulated and experimental quantum hardware, and outline open challenges including real-time decoding, scalability to large code distances, and generalization to high-rate quantum low-density parity-check codes.

Related papers

• Syndrome resampling enhances quantum error correction thresholds [0.9744114320491685]
  We introduce syndrome resampling, a method that increases QEC thresholds of any decoder.<n>We show that syndrome resampling substantially increases thresholds for both optimal and suboptimal decoders.<n>Applying the method to existing experimental QEC data yields up to two orders of magnitude reduction in logical error rates.
  arXiv  Detail & Related papers  (2026-05-07T12:16:39Z)
• How LLMs Fail and Generalize in RTL Coding for Hardware Design? [56.361436215029045]
  We introduce a new error taxonomy grounded in problem solvability, inspired by cognitive theory.<n>Our taxonomy categorizes failures into syntactic, semantic, solvable functional, and unsolvable functional types.
  arXiv  Detail & Related papers  (2026-04-26T14:34:49Z)
• Neural Minimum Weight Perfect Matching for Quantum Error Codes [7.525883733645578]
  We propose a data-driven decoder named Neural Minimum Weight Perfect Matching (NMWPM)<n>Our findings demonstrate significant performance reduction in the Logical Error Rate (LER) over standard baselines.
  arXiv  Detail & Related papers  (2026-01-01T07:25:51Z)
• SAQ: Stabilizer-Aware Quantum Error Correction Decoder [8.458339111154585]
  Quantum Error Correction (QEC) decoding faces a fundamental accuracy-efficiency tradeoff.<n>Recent neural decoders reduce complexity but lack the accuracy needed to compete with computationally expensive classical methods.<n>We introduce SAQ-Decoder, a framework combining transformer-based learning with constraint post-processing.
  arXiv  Detail & Related papers  (2025-12-09T18:51:35Z)
• An Efficient Quantum Classifier Based on Hamiltonian Representations [50.467930253994155]
  Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks.<n>We propose an efficient approach that circumvents the costs associated with data encoding by mapping inputs to a finite set of Pauli strings.<n>We evaluate our approach on text and image classification tasks, against well-established classical and quantum models.
  arXiv  Detail & Related papers  (2025-04-13T11:49:53Z)
• Generative Decoding for Quantum Error-correcting Codes [6.964959672843989]
  We propose a decoding algorithm utilizing generative modeling in machine learning.<n>We employ autoregressive neural networks to learn the joint probability of logical operators and syndromes in an unsupervised manner.<n>Our approach highlights generative artificial intelligence as a potential solution for the real-time decoding of realistic and high-rate quantum error correction codes.
  arXiv  Detail & Related papers  (2025-03-27T11:08:03Z)
• Low-Overhead Transversal Fault Tolerance for Universal Quantum Computation [36.3664581543528]
  We show that logical operations can be performed fault-tolerantly with only a constant number of extraction rounds.<n>Our work sheds new light on the theory of quantum fault tolerance and has the potential to reduce the space-time cost of practical fault-tolerant quantum computation by over an order of magnitude.
  arXiv  Detail & Related papers  (2024-06-25T15:43:25Z)
• Transformer-QEC: Quantum Error Correction Code Decoding with Transferable Transformers [18.116657629047253]
  We introduce a transformer-based Quantum Error Correction (QEC) decoder. It employs self-attention to achieve a global receptive field across all input syndromes. It incorporates a mixed loss training approach, combining both local physical error and global parity label losses.
  arXiv  Detail & Related papers  (2023-11-27T18:52:25Z)
• Testing the Accuracy of Surface Code Decoders [55.616364225463066]
  Large-scale, fault-tolerant quantum computations will be enabled by quantum error-correcting codes (QECC) This work presents the first systematic technique to test the accuracy and effectiveness of different QECC decoding schemes.
  arXiv  Detail & Related papers  (2023-11-21T10:22:08Z)
• 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)
• Mixed Precision Low-bit Quantization of Neural Network Language Models for Speech Recognition [67.95996816744251]
  State-of-the-art language models (LMs) represented by long-short term memory recurrent neural networks (LSTM-RNNs) and Transformers are becoming increasingly complex and expensive for practical applications. Current quantization methods are based on uniform precision and fail to account for the varying performance sensitivity at different parts of LMs to quantization errors. Novel mixed precision neural network LM quantization methods are proposed in this paper.
  arXiv  Detail & Related papers  (2021-11-29T12:24:02Z)
• AQD: Towards Accurate Fully-Quantized Object Detection [94.06347866374927]
  We propose an Accurate Quantized object Detection solution, termed AQD, to get rid of floating-point computation. Our AQD achieves comparable or even better performance compared with the full-precision counterpart under extremely low-bit schemes.
  arXiv  Detail & Related papers  (2020-07-14T09:07:29Z)

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.