Self-attention U-Net decoder for toric codes
- URL: http://arxiv.org/abs/2506.02734v1
- Date: Tue, 03 Jun 2025 10:50:47 GMT
- Title: Self-attention U-Net decoder for toric codes
- Authors: Wei-Wei Zhang, Zhuo Xia, Wei Zhao, Wei Pan, Haobin Shi,
- Abstract summary: A scalable efficient decoder is most desired for the application of the quantum error correction codes.<n>In this work, we propose a self-attention U-Net quantum decoder (SU-NetQD) for toric code.<n>We achieve lower logical error rates compared with MWPM and discover an increased trend of code threshold as the increase of noise bias.
- Score: 7.564303967741644
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In the NISQ era, one of the most important bottlenecks for the realization of universal quantum computation is error correction. Stabiliser code is the most recognizable type of quantum error correction code. A scalable efficient decoder is most desired for the application of the quantum error correction codes. In this work, we propose a self-attention U-Net quantum decoder (SU-NetQD) for toric code, which outperforms the minimum weight perfect matching decoder, especially in the circuit level noise environments. Specifically, with our SU-NetQD, we achieve lower logical error rates compared with MWPM and discover an increased trend of code threshold as the increase of noise bias. We obtain a high threshold of 0.231 for the extremely biased noise environment. The combination of low-level decoder and high-level decoder is the key innovation for the high accuracy of our decoder. With transfer learning mechanics, our decoder is scalable for cases with different code distances. Our decoder provides a practical tool for quantum noise analysis and promotes the practicality of quantum error correction codes and quantum computing.
Related papers
- 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) - Advantage of Quantum Neural Networks as Quantum Information Decoders [1.1842028647407803]
We study the problem of decoding quantum information encoded in the groundspaces of topological stabilizer Hamiltonians.
We first prove that the standard stabilizer-based error correction and decoding schemes work adequately perturbed well in such quantum codes.
We then prove that Quantum Neural Network (QNN) decoders provide an almost quadratic improvement on the readout error.
arXiv Detail & Related papers (2024-01-11T23:56:29Z) - 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) - A Practical and Scalable Decoder for Topological Quantum Error
Correction with Digital Annealer [0.5658123802733283]
We propose an efficient and scalable decoder for quantum error correction using Fujitsu Digital Annealer (DA)
In particular, we implement the proposed DA decoder for the surface code and perform detailed numerical experiments for various code to see its performance and scalability.
It is also shown that the DA decoder has advantages over the Union-Find (UF) decoder from a variety of perspectives including hardware implementation.
arXiv Detail & Related papers (2022-03-29T07:48:51Z) - 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) - Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs.
Super-Quantum Encoders [67.12391801199688]
We investigate dense coding by imposing various locality restrictions to our decoder.
In this task, the sender Alice and the receiver Bob share an entangled state.
arXiv Detail & Related papers (2021-09-26T07:29:54Z) - Efficient Concatenated Bosonic Code for Additive Gaussian Noise [0.0]
Bosonic codes offer noise resilience for quantum information processing.
We propose using a Gottesman-Kitaev-Preskill code to detect discard error-prone qubits and a quantum parity code to handle residual errors.
Our work may have applications in a wide range of quantum computation and communication scenarios.
arXiv Detail & Related papers (2021-02-02T08:01:30Z) - Cellular automaton decoders for topological quantum codes with noisy
measurements and beyond [68.8204255655161]
We propose an error correction procedure based on a cellular automaton, the sweep rule, which is applicable to a broad range of codes beyond topological quantum codes.
For simplicity, we focus on the three-dimensional (3D) toric code on the rhombic dodecahedral lattice with boundaries and prove that the resulting local decoder has a non-zero error threshold.
We find that this error correction procedure is remarkably robust against measurement errors and is also essentially insensitive to the details of the lattice and noise model.
arXiv Detail & Related papers (2020-04-15T18:00:01Z)
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.