Fault-Tolerant Weighted Union-Find Decoding on the Toric Code
- URL: http://arxiv.org/abs/2004.04693v1
- Date: Thu, 9 Apr 2020 17:24:30 GMT
- Title: Fault-Tolerant Weighted Union-Find Decoding on the Toric Code
- Authors: Shilin Huang, Michael Newman, Kenneth R. Brown
- Abstract summary: We benchmark a weighted variant of the union-find decoder on the toric code under circuit-level depolarizing noise.
This variant preserves the almost-linear time complexity of the original while significantly increasing the performance in the fault-tolerance setting.
- Score: 2.492300648514129
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum error correction requires decoders that are both accurate and
efficient. To this end, union-find decoding has emerged as a promising
candidate for error correction on the surface code. In this work, we benchmark
a weighted variant of the union-find decoder on the toric code under
circuit-level depolarizing noise. This variant preserves the almost-linear time
complexity of the original while significantly increasing the performance in
the fault-tolerance setting. In this noise model, weighting the union-find
decoder increases the threshold from 0.38% to 0.62%, compared to an increase
from 0.65% to 0.72% when weighting a matching decoder. Further assuming quantum
non-demolition measurements, weighted union-find decoding achieves a threshold
of 0.76% compared to the 0.90% threshold when matching. We additionally provide
comparisons of timing as well as low error rate behavior.
Related papers
- Towards Effective and Efficient Non-autoregressive Decoding Using Block-based Attention Mask [73.5088336210358]
AMD performs parallel NAR inference within contiguous blocks of output labels concealed using attention masks.
A beam search algorithm is designed to leverage a dynamic fusion of CTC, AR Decoder, and AMD probabilities.
Experiments on the LibriSpeech-100hr corpus suggest the tripartite Decoder incorporating the AMD module produces a maximum decoding speed-up ratio of 1.73x.
arXiv Detail & Related papers (2024-06-14T13:42:38Z) - Color code decoder with improved scaling for correcting circuit-level noise [2.440316110613964]
Two-dimensional color codes are a promising candidate for fault-tolerant quantum computing.
We introduce an efficient color-code decoder that combines two matching decoders for each color.
Our simulations reveal that this decoding strategy nearly reaches the best possible scaling of logical failure.
arXiv Detail & Related papers (2024-04-11T05:31:39Z) - Bit-flipping Decoder Failure Rate Estimation for (v,w)-regular Codes [84.0257274213152]
We propose a new technique to provide accurate estimates of the DFR of a two-iterations (parallel) bit flipping decoder.
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) - 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) - Belief propagation as a partial decoder [0.0]
We present a new two-stage decoder that accelerates the decoding cycle and boosts accuracy.
In the first stage, a partial decoder based on belief propagation is used to correct errors that occurred with high probability.
In the second stage, a conventional decoder corrects any remaining errors.
arXiv Detail & Related papers (2023-06-29T17:44:20Z) - 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) - 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) - 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) - Combining hard and soft decoders for hypergraph product codes [0.3326320568999944]
Hypergraph product codes are constant-rate quantum low-density parity-check (LDPC) codes equipped with a linear-time decoder called small-set-flip (SSF)
This decoder displays sub-optimal performance in practice and requires very large error correcting codes to be effective.
We present new hybrid decoders that combine the belief propagation (BP) algorithm with the SSF decoder.
arXiv Detail & Related papers (2020-04-23T14:48:05Z)
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.