Related papers: Efficient color code decoders in $d\geq 2$ dimensions from toric code decoders

Efficient color code decoders in $d\geq 2$ dimensions from toric code decoders

URL: http://arxiv.org/abs/1905.07393v3
Date: Thu, 16 Feb 2023 16:10:29 GMT
Title: Efficient color code decoders in $d\geq 2$ dimensions from toric code decoders
Authors: Aleksander Kubica and Nicolas Delfosse
Abstract summary: We prove that the Restriction Decoder successfully corrects errors in the color code if and only if the corresponding toric code decoding succeeds. We numerically estimate the Restriction Decoder threshold for the color code in two and three dimensions against the bit-flip and phase-flip noise.
Score: 77.34726150561087
License: http://creativecommons.org/licenses/by-nc-nd/4.0/
Abstract: We introduce an efficient decoder of the color code in $d\geq 2$ dimensions, the Restriction Decoder, which uses any $d$-dimensional toric code decoder combined with a local lifting procedure to find a recovery operation. We prove that the Restriction Decoder successfully corrects errors in the color code if and only if the corresponding toric code decoding succeeds. We also numerically estimate the Restriction Decoder threshold for the color code in two and three dimensions against the bit-flip and phase-flip noise with perfect syndrome extraction. We report that the 2D color code threshold $p_{\textrm{2D}} \approx 10.2\%$ on the square-octagon lattice is on a par with the toric code threshold on the square lattice.

Related papers

Learning Linear Block Error Correction Codes [62.25533750469467]
We propose for the first time a unified encoder-decoder training of binary linear block codes. We also propose a novel Transformer model in which the self-attention masking is performed in a differentiable fashion for the efficient backpropagation of the code gradient.
arXiv Detail & Related papers (2024-05-07T06:47:12Z)
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)
Minimising surface-code failures using a color-code decoder [2.5499055723658097]
We propose a decoder for the surface code that finds low-weight correction operators for errors produced by the depolarising noise model. The decoder is obtained by mapping the syndrome of the surface code onto that of the color code.
arXiv Detail & Related papers (2023-06-28T18:04:49Z)
Quantum error correction with the color-Gottesman-Kitaev-Preskill code [5.780815306252637]
The Gottesman-Kitaev-Preskill (GKP) code is an important type of bosonic quantum error-correcting code. In this paper, we consider the concatenation of the single-mode GKP code with the two-dimension (2D) color code.
arXiv Detail & Related papers (2021-12-29T08:19:36Z)
Rescaling decoder for 2D topological quantum color codes on 4.8.8 lattices [0.0]
Topological codes, such as the surface code or color codes, are leading candidates for practical scalable quantum error correction. We study the efficiency of a decoder for 2D topological color codes on the 4.8.8 lattice.
arXiv Detail & Related papers (2021-12-17T15:56:22Z)
Morphing quantum codes [77.34726150561087]
We morph the 15-qubit Reed-Muller code to obtain the smallest known stabilizer code with a fault-tolerant logical $T$ gate. We construct a family of hybrid color-toric codes by morphing the color code.
arXiv Detail & Related papers (2021-12-02T17:43:00Z)
A decoder for the triangular color code by matching on a M\"obius strip [3.8073142980733]
The color code is remarkable for its ability to perform fault-tolerant logic gates. This motivates the design of practical decoders that minimise the resource cost of color-code quantum computation. Our decoder is derived using relations among the stabilizers that preserve global conservation laws at the lattice boundary.
arXiv Detail & Related papers (2021-08-25T18:00:03Z)
Trellis Decoding For Qudit Stabilizer Codes And Its Application To Qubit Topological Codes [3.9962751777898955]
We show that trellis decoders have strong structure, extend the results using classical coding theory as a guide, and demonstrate a canonical form from which the structural properties of the decoding graph may be computed. The modified decoder works for any stabilizer code $S$ and separates into two parts: a one-time, offline which builds a compact, graphical representation of the normalizer of the code, $Sperp$, and a quick, parallel, online computation using the Viterbi algorithm.
arXiv Detail & Related papers (2021-06-15T16:01:42Z)
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.