Generative Decoding for Quantum Error-correcting Codes

• URL: http://arxiv.org/abs/2503.21374v1
• Date: Thu, 27 Mar 2025 11:08:03 GMT
• Title: Generative Decoding for Quantum Error-correcting Codes
• Authors: Hanyan Cao, Feng Pan, Dongyang Feng, Yijia Wang, Pan Zhang,
• Abstract summary: 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.
• Score: 6.964959672843989
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Efficient and accurate decoding of quantum error-correcting codes is essential for fault-tolerant quantum computation, however, it is challenging due to the degeneracy of errors, the complex code topology, and the large space for logical operators in high-rate codes. In this work, we propose a decoding algorithm utilizing generative modeling in machine learning. We employ autoregressive neural networks to learn the joint probability of logical operators and syndromes in an unsupervised manner, eliminating the need for labeled training data. The learned model can approximately perform maximum likelihood decoding by directly generating the most likely logical operators for $k$ logical qubits with $\mathcal O(2k)$ computational complexity. Thus, it is particularly efficient for decoding high-rate codes with many logical qubits. The proposed approach is general and applies to a wide spectrum of quantum error-correcting codes including surface codes and quantum low-density parity-check codes (qLDPC), under noise models ranging from code capacity noise to circuit level noise. We conducted extensive numerical experiments to demonstrate that our approach achieves significantly higher decoding accuracy compared to the minimum weight perfect matching and belief propagation with ordered statistics on the surface codes and high-rate quantum low-density parity-check codes. Our approach highlights generative artificial intelligence as a potential solution for the real-time decoding of realistic and high-rate quantum error correction codes.

Related papers

• Algorithmic Fault Tolerance for Fast Quantum Computing [37.448838730002905]
  We show that fault-tolerant logical operations can be performed with constant time overhead for a broad class of quantum codes. We prove that the deviation from the ideal measurement result distribution can be made exponentially small in the code distance. Our work sheds new light on the theory of fault tolerance, potentially reducing the space-time cost of practical fault-tolerant quantum computation by orders of magnitude.
  arXiv  Detail & Related papers  (2024-06-25T15:43: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)
• qecGPT: decoding Quantum Error-correcting Codes with Generative Pre-trained Transformers [5.392298820599664]
  We propose a framework for decoding quantum error-correcting codes with generative modeling. We use autoregressive neural networks, specifically Transformers, to learn the joint probability of logical operators and syndromes. Our framework is general and can be applied to any error model and quantum codes with different topologies.
  arXiv  Detail & Related papers  (2023-07-18T07:34:02Z)
• 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)
• 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)
• Quantum Error Correction via Noise Guessing Decoding [0.0]
  Quantum error correction codes (QECCs) play a central role in both quantum communications and quantum computation. This paper shows that it is possible to both construct and decode QECCs that can attain the maximum performance of the finite blocklength regime.
  arXiv  Detail & Related papers  (2022-08-04T16:18:20Z)
• 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)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)
• Efficiently computing logical noise in quantum error correcting codes [0.0]
  We show that measurement errors on readout qubits manifest as a renormalization on the effective logical noise. We derive general methods for reducing the computational complexity of the exact effective logical noise by many orders of magnitude.
  arXiv  Detail & Related papers  (2020-03-23T19:40:56Z)

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.