Related papers: Color code decoder with improved scaling for correcting circuit-level noise

Color code decoder with improved scaling for correcting circuit-level noise

URL: http://arxiv.org/abs/2404.07482v1
Date: Thu, 11 Apr 2024 05:31:39 GMT
Title: Color code decoder with improved scaling for correcting circuit-level noise
Authors: Seok-Hyung Lee, Andrew Li, Stephen D. Bartlett,
Abstract summary: 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.
Score: 2.440316110613964
License: http://creativecommons.org/licenses/by/4.0/
Abstract: Two-dimensional color codes are a promising candidate for fault-tolerant quantum computing, as they have high encoding rates, transversal implementation of logical Clifford gates, and high feasibility of magic state constructions. However, decoding color codes presents a significant challenge due to their structure, where elementary errors violate three checks instead of just two (a key feature in surface code decoding), and the complexity in extracting syndrome is greater. We introduce an efficient color-code decoder that tackles these issues by combining two matching decoders for each color, generalized to handle circuit-level noise by employing detector error models. We provide comprehensive analyses of the decoder, covering its threshold and sub-threshold scaling both for bit-flip noise with ideal measurements and for circuit-level noise. Our simulations reveal that this decoding strategy nearly reaches the best possible scaling of logical failure ($p_\mathrm{fail} \sim p^{d/2}$) for both noise models, where $p$ is the noise strength, in the regime of interest for fault-tolerant quantum computing. While its noise thresholds are comparable with other matching-based decoders for color codes (8.2% for bit-flip noise and 0.46% for circuit-level noise), the scaling of logical failure rates below threshold significantly outperforms the best matching-based decoders.

Related papers

Near-optimal decoding algorithm for color codes using Population Annealing [44.99833362998488]
We implement a decoder that finds the recovery operation with the highest success probability. We study the decoder performance on a 4.8.8 color code lattice under different noise models.
arXiv Detail & Related papers (2024-05-06T18:17:42Z)
Improving threshold for fault-tolerant color code quantum computing by flagged weight optimization [0.9002260638342727]
thresholds of color codes under circuit-level noise are relatively low because of their high-weight stabilizer generators. We propose a method to suppress the impact of such errors using conditional error probabilities conditioned on the measurement outcomes of flag qubits. This method can also be applied to other weight-based decoders, making the color codes more promising for the candidate of experimental implementation of QEC.
arXiv Detail & Related papers (2024-02-21T17:40:51Z)
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)
Facilitating Practical Fault-tolerant Quantum Computing Based on Color Codes [0.6963971634605797]
In this work, we address several key issues to facilitate practical fault-tolerant quantum computing based on color codes. First, by introducing decoding graphs with error-rate-related weights, we obtained the threshold of $0.57%$ of the triangular color code. Second, our work firstly investigates the circuit-level decoding of color code lattice surgery, and gives an efficient decoding algorithm. Third, a new state injection protocol of the triangular color code is proposed, reducing the output magic state error rate in one round of 15 to 1 distillation by two orders of magnitude compared to a previous rough protocol.
arXiv Detail & Related papers (2023-09-11T03:56:18Z)
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)
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)
Ising model formulation for highly accurate topological color codes decoding [0.9002260638342727]
Topological color codes, one of the quantum error correction codes, have an advantage against the surface codes in that all Clifford gates can be implemented transversely. Here we propose an Ising model formulation that enables highly accurate decoding of the color codes.
arXiv Detail & Related papers (2023-03-02T15:28:08Z)
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)
The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes [63.62764375279861]
We compare two leading FT implementations of the T gate in 2D color codes under circuit noise. We find a circuit noise threshold of 0.07(1)% for the T gate via code switching, almost an order of magnitude below that achievable by state distillation in the same setting.
arXiv Detail & Related papers (2021-01-06T19:00:01Z)
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.