Machine Learning Decoding of Circuit-Level Noise for Bivariate Bicycle Codes

• URL: http://arxiv.org/abs/2504.13043v1
• Date: Thu, 17 Apr 2025 15:57:16 GMT
• Title: Machine Learning Decoding of Circuit-Level Noise for Bivariate Bicycle Codes
• Authors: John Blue, Harshil Avlani, Zhiyang He, Liu Ziyin, Isaac L. Chuang,
• Abstract summary: We present a recurrent, transformer-based neural network designed to decode circuit-level noise on Bi Bicycle (BB) codes.<n>For the $[[72,12,6]]$ BB code, at a physical error rate of $p=0.1%$, our model achieves a logical error rate almost $5$ times lower than belief propagation.<n>These results demonstrate that machine learning decoders can out-perform conventional decoders on QLDPC codes.
• Score: 0.42542143904778074
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Fault-tolerant quantum computers will depend crucially on the performance of the classical decoding algorithm which takes in the results of measurements and outputs corrections to the errors inferred to have occurred. Machine learning models have shown great promise as decoders for the surface code; however, this promise has not yet been substantiated for the more challenging task of decoding quantum low-density parity-check (QLDPC) codes. In this paper, we present a recurrent, transformer-based neural network designed to decode circuit-level noise on Bivariate Bicycle (BB) codes, introduced recently by Bravyi et al (Nature 627, 778-782, 2024). For the $[[72,12,6]]$ BB code, at a physical error rate of $p=0.1\%$, our model achieves a logical error rate almost $5$ times lower than belief propagation with ordered statistics decoding (BP-OSD). Moreover, while BP-OSD has a wide distribution of runtimes with significant outliers, our model has a consistent runtime and is an order-of-magnitude faster than the worst-case times from a benchmark BP-OSD implementation. On the $[[144,12,12]]$ BB code, our model obtains worse logical error rates but maintains the speed advantage. These results demonstrate that machine learning decoders can out-perform conventional decoders on QLDPC codes, in regimes of current interest.

Related papers

• Automorphism Ensemble Decoding of Quantum LDPC Codes [2.9248916859490173]
  We introduce AutDEC, a fast and accurate decoder for quantum error-correcting codes with large automorphism groups. For quantum codes, the accuracy of BP decoders is limited because short cycles occur in the Tanner graph. We demonstrate decoding accuracy comparable to BP-OSD-0 with a lower time overhead.
  arXiv  Detail & Related papers  (2025-03-03T16:58:24Z)
• Efficient and Universal Neural-Network Decoder for Stabilizer-Based Quantum Error Correction [44.698141103370546]
  We introduce a universal decoder based on linear attention sequence modeling and graph neural network.<n>Our experiments demonstrate that this decoder outperforms specialized algorithms in both accuracy and speed.
  arXiv  Detail & Related papers  (2025-02-27T10:56:53Z)
• Threshold Selection for Iterative Decoding of $(v,w)$-regular Binary Codes [84.0257274213152]
  Iterative bit flipping decoders are an efficient choice for sparse $(v,w)$-regular codes. We propose concrete criteria for threshold determination, backed by a closed form model.
  arXiv  Detail & Related papers  (2025-01-23T17:38:22Z)
• SymBreak: Mitigating Quantum Degeneracy Issues in QLDPC Code Decoders by Breaking Symmetry [13.97553415798807]
  Quantum low-density parity check (qLDPC) codes have emerged as a promising alternative, requiring fewer qubits.<n>SymBreak is a novel decoder for qLDPC codes that adaptively modifies the decoding graph to improve the performance of state-of-the-art belief propagation decoders.<n>Our results demonstrate that SymBreak outperforms BP and BP+OSD-a more complex variant of BP-with a $16.17times$ reduction in logical error rate compared to BP and $3.23times$ compared to BP+OSD across various qLDPC code families.
  arXiv  Detail & Related papers  (2024-12-03T22:45:43Z)
• Quantum error correction below the surface code threshold [107.92016014248976]
  Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit. We present two surface code memories operating below a critical threshold: a distance-7 code and a distance-5 code integrated with a real-time decoder. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.
  arXiv  Detail & Related papers  (2024-08-24T23:08:50Z)
• Ambiguity Clustering: an accurate and efficient decoder for qLDPC codes [0.0]
  We introduce the Ambiguity Clustering decoder (AC) which divides measurement data into clusters that can be decoded independently.<n>With 0.3% circuit-level depolarising noise, AC is up to 27x faster than BP-OSD with matched accuracy.<n>Our implementation decodes the 144-qubit Gross code in 135us per round of syndrome extraction on an M2 CPU.
  arXiv  Detail & Related papers  (2024-06-20T17:39:31Z)
• Estimating the Decoding Failure Rate of Binary Regular Codes Using Iterative Decoding [84.0257274213152]
  We propose a new technique to provide accurate estimates of the DFR of a two-iterations (parallel) bit flipping decoder.<n>We validate our results, providing comparisons of the modeled and simulated weight of the syndrome, incorrectly-guessed error bit distribution at the end of the first iteration, and two-itcrypteration Decoding Failure Rates (DFR)
  arXiv  Detail & Related papers  (2024-01-30T11:40:24Z)
• Neural network decoder for near-term surface-code experiments [0.7100520098029438]
  Neural-network decoders can achieve a lower logical error rate compared to conventional decoders. These decoders require no prior information about the physical error rates, making them highly adaptable.
  arXiv  Detail & Related papers  (2023-07-06T20:31:25Z)
• 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)
• 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)
• 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)

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.