Machine Learning Optimal Quantum Error Correction Thresholds

• URL: http://arxiv.org/abs/2606.22194v1
• Date: Sat, 20 Jun 2026 19:04:49 GMT
• Title: Machine Learning Optimal Quantum Error Correction Thresholds
• Abstract summary: We develop a transformer-based neural network model based on maximum likelihood decoding.<n>We show that the network accurately predicts CI and yields threshold estimates that closely match known theoretical limits.<n>We also introduce a novel soft post-selection scheme that treats uncertainty in both logical operators and relies on confidence-based filtering of the network's output.
• Score: 0.8919684307774216
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: As quantum computers remain susceptible to noise, QEC is essential for preserving logical information during computations. However, the performance of QEC codes breaks down beyond certain noise thresholds, revealing fundamental limits on their ability to protect quantum information. These limits can be characterized using information-theoretic measures such as the coherent information, which quantifies the maximum rate at which logical information can be reliably transmitted through a noisy quantum channel. In this work, we establish a direct connection between the CI and the binary cross-entropy loss used when training neural network decoders. Specifically, we show that the CI constitutes a sharp lower bound on the achievable loss for decoders that track logical operators across noisy channels. To this end, we develop a transformer-based neural network model based on maximum likelihood decoding. We train this network to estimate the CI and evaluate its performance on the surface code under three noise models: code capacity, phenomenological, and circuit-level noise. Our results demonstrate that the network accurately predicts CI and yields threshold estimates that closely match known theoretical limits. When used as a decoder, the network significantly outperforms the minimum weight perfect matching decoder in terms of logical error rate. We also introduce a novel soft post-selection scheme that independently treats uncertainty in both logical operators and relies on confidence-based filtering of the network's output. We prove that such post-selection strategies, based on the MLD cosets, are optimal, and demonstrate their scalability in terms of both logical error rate and abort probability. These findings establish transformer-based architectures as powerful tools for QEC and provide the first numerical evidence supporting the optimality and scalability of MLD-based post-selection.

Related papers

• SCOPE: A Syndrome-Driven Control Plane for QEC-Enabled Quantum Networks [7.746657732894142]
  We present SCOPE, a network-layer architecture that enables joint routing and coding optimization using purely passive telemetry.<n>SCOPE reduces estimation error by more than 60% relative to a standard EM baseline.<n>In large-scale networks, this precision reduces logical error rates by 30-35% (up to 65%) against topology-aware baselines.
  arXiv  Detail & Related papers  (2026-06-07T23:00:09Z)
• Maximum Likelihood Decoding of Quantum Error Correction Codes [13.939243286249486]
  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.
  arXiv  Detail & Related papers  (2026-05-17T02:32:52Z)
• 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)
• Neural Decoders for Universal Quantum Algorithms [0.43553942673960666]
  We introduce a modular attention-based neural decoder that learns gate-induced correlations.<n>Our decoders achieve fast inference and logical error rates comparable to most-likely-error decoders.<n>These results establish neural decoders as practical, versatile, and high-performance tools for quantum computing.
  arXiv  Detail & Related papers  (2025-09-14T17:51:46Z)
• Fault-tolerant logical state construction based on cavity-QED network [0.196629787330046]
  We propose and evaluate a scalable and practical architecture with a cavity-quantum-electrodynamics (CQED) network.<n>Our architecture takes advantage of the stability of neutral atoms and the flexibility of a CQED network.
  arXiv  Detail & Related papers  (2025-03-14T15:26:29Z)
• 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)
• Problem-Dependent Power of Quantum Neural Networks on Multi-Class Classification [83.20479832949069]
  Quantum neural networks (QNNs) have become an important tool for understanding the physical world, but their advantages and limitations are not fully understood. Here we investigate the problem-dependent power of QCs on multi-class classification tasks. Our work sheds light on the problem-dependent power of QNNs and offers a practical tool for evaluating their potential merit.
  arXiv  Detail & Related papers  (2022-12-29T10:46:40Z)
• 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)
• SignalNet: A Low Resolution Sinusoid Decomposition and Estimation Network [79.04274563889548]
  We propose SignalNet, a neural network architecture that detects the number of sinusoids and estimates their parameters from quantized in-phase and quadrature samples. We introduce a worst-case learning threshold for comparing the results of our network relative to the underlying data distributions. In simulation, we find that our algorithm is always able to surpass the threshold for three-bit data but often cannot exceed the threshold for one-bit data.
  arXiv  Detail & Related papers  (2021-06-10T04:21:20Z)

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.