Simple, Efficient, and Generic Post-Selection Decoding for qLDPC codes

• URL: http://arxiv.org/abs/2601.17757v1
• Date: Sun, 25 Jan 2026 09:03:55 GMT
• Title: Simple, Efficient, and Generic Post-Selection Decoding for qLDPC codes
• Authors: Haipeng Xie, Nobuyuki Yoshioka, Kento Tsubouchi, Ying Li,
• Abstract summary: We introduce argument reweighting, a strategy that boosts the performance of maximum-likelihood-type decoders.<n>Circuit-level simulations across multiple decoders and qLDPC codes show that argument reweighting substantially suppresses logical errors.<n>These results establish argument reweighting as a practical and resource-efficient approach for enhancing quantum fault tolerance.
• Score: 3.513124118707534
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum error correction is indispensable for scalable quantum computation. Although encoding logical qubits substantially enhances noise resilience, achieving logical error rates low enough for practical algorithms remains challenging on existing hardware. Here we introduce argument reweighting, a simple and broadly applicable post-selection decoding strategy that boosts the performance of maximum-likelihood-type decoders, including minimum-weight perfect matching and belief-propagation families. The method suppresses logical errors by performing additional decoding rounds under reweighted error models, enabling acceptance of high-confidence syndrome outcomes. Circuit-level simulations across multiple decoders and qLDPC codes show that argument reweighting substantially suppresses logical errors, requiring a rejection rate of only $1.44\times10^{-5}$ to reduce the logical error rate by almost two orders of magnitude for the $[[144,12,12]]$ bivariate bicycle code. These results establish argument reweighting as a practical and resource-efficient approach for enhancing quantum fault tolerance.

Related papers

• Bayesian Optimization for Quantum Error-Correcting Code Discovery [3.0556222192221667]
  We propose a framework to discover quantum error-correcting codes that improves data efficiency and scalability.<n>Our main contribution is a multi-view chain-complex neural embedding that allows us to predict the logical error rate of quantum LDPC codes without performing expensive simulations.
  arXiv  Detail & Related papers  (2026-01-26T15:10:01Z)
• Fail fast: techniques to probe rare events in quantum error correction [0.9159338434295846]
  We develop three techniques to characterize the rare-event regime for general quantum low-density parity-check codes under circuit noise.<n>We observe strong low-error-rate performance with the recently proposed Relay decoder.
  arXiv  Detail & Related papers  (2025-11-19T06:57:29Z)
• Efficient Post-Selection for General Quantum LDPC Codes [0.0]
  Post-selection strategies that discard low-confidence computational results can significantly improve the effective fidelity of quantum error correction.<n>We develop post-selection strategies based on computationally efficient confidence metrics that leverage error cluster statistics.<n>Our approach provides a practical foundation for efficient post-selection in fault-tolerant quantum computing with QLDPC codes.
  arXiv  Detail & Related papers  (2025-10-07T11:11:50Z)
• Fast correlated decoding of transversal logical algorithms [67.01652927671279]
  Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead.<n>Recent advances have shown that by jointly decoding logical qubits in algorithms composed of logical gates, the number of syndrome extraction rounds can be reduced.<n>Here, we reform the problem of decoding circuits by directly decoding relevant logical operator products as they propagate through the circuit.
  arXiv  Detail & Related papers  (2025-05-19T18:00:00Z)
• 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)
• 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)
• Mitigating errors in logical qubits [1.6385815610837167]
  We develop new methods to quantify logical failure rates with exclusive decoders. We identify a regime at low error rates where the exclusion rate decays with code distance. Our work highlights the importance of post-selection as a powerful tool in quantum error correction.
  arXiv  Detail & Related papers  (2024-05-06T18:04:41Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Fault-Tolerant Computing with Single Qudit Encoding [49.89725935672549]
  We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit. These codes can be customized to the specific physical errors on the qudit, effectively suppressing them. We demonstrate a Fault-Tolerant implementation on molecular spin qudits, showcasing nearly exponential error suppression with only linear qudit size growth.
  arXiv  Detail & Related papers  (2023-07-20T10:51:23Z)
• 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)
• Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices [60.02503434201552]
  We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix. This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
  arXiv  Detail & Related papers  (2022-12-20T13:41:27Z)
• Suppressing quantum errors by scaling a surface code logical qubit [147.2624260358795]
  We report the measurement of logical qubit performance scaling across multiple code sizes. Our system of superconducting qubits has sufficient performance to overcome the additional errors from increasing qubit number. Results mark the first experimental demonstration where quantum error correction begins to improve performance with increasing qubit number.
  arXiv  Detail & Related papers  (2022-07-13T18:00:02Z)

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.