Testing the Accuracy of Surface Code Decoders
- URL: http://arxiv.org/abs/2311.12503v1
- Date: Tue, 21 Nov 2023 10:22:08 GMT
- Title: Testing the Accuracy of Surface Code Decoders
- Authors: Arshpreet Singh Maan, Alexandru Paler
- Abstract summary: 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.
- Score: 55.616364225463066
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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 by comparing a look-up table decoder to solutions generated using
algorithmic decoders. Specifically, we examine the results of
minimum-weight-perfect-matching and belief-propagation decoders against
exhaustive look-up tables for surface codes up to distance seven and categorise
where errors are accurately corrected in both decoding schemes. While our
results are preliminary, we show that significant quantitative results can be
generated, comparing how actual error channels are successfully or
unsuccessfully decoded. We show that different decoding schemes perform very
differently under the same QECC scheme and error model, and detail how decoders
can be tested and classified with respect to errors that are successfully
decodable. This work paves the way to the data driven tuning of decoder
ensembles and will enable tailored design of hybrid decoding schemes that allow
for real-time decoding, while maintaining the high theoretical thresholds
allowed by specific quantum error correction codes.
Related papers
- A High-Performance List Decoding Algorithm for Surface Codes with Erroneous Syndrome [9.191400697168389]
We propose a high-performance list decoding algorithm for surface codes with erroneous syndromes.
To cope with erroneous syndrome information, we incorporate syndrome soft information, allowing the syndrome to be listed as well.
Numerical results demonstrate that our proposed algorithm significantly improves the decoding performance of surface codes with erroneous syndromes.
arXiv Detail & Related papers (2024-09-11T03:12:18Z) - Breadth-first graph traversal union-find decoder [0.0]
We develop variants of the union-find decoder that simplify its implementation and provide potential decoding speed advantages.
We show how these methods can be adapted to decode non-topological quantum low-density-parity-check codes.
arXiv Detail & Related papers (2024-07-22T18:54:45Z) - 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) - 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) - 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.