Related papers: Rescaling decoder for 2D topological quantum color codes on 4.8.8 lattices

Rescaling decoder for 2D topological quantum color codes on 4.8.8 lattices

URL: http://arxiv.org/abs/2112.09584v1
Date: Fri, 17 Dec 2021 15:56:22 GMT
Title: Rescaling decoder for 2D topological quantum color codes on 4.8.8 lattices
Authors: Pedro Parrado-Rodr\'iguez and Manuel Rispler and Markus M\"uller
Abstract summary: 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.
Score: 0.0
License: http://creativecommons.org/licenses/by/4.0/
Abstract: Fault-tolerant quantum computation relies on scaling up quantum error correcting codes in order to suppress the error rate on the encoded quantum states. Topological codes, such as the surface code or color codes are leading candidates for practical scalable quantum error correction and require efficient and scalable decoders. In this work, we propose and study the efficiency of a decoder for 2D topological color codes on the 4.8.8 lattice, by building on the work of [1] for color codes on hexagonal lattices. The decoder is based on a rescaling approach, in which syndrome information on a part of the qubit lattice is processed locally, and then the lattice is rescaled iteratively to smaller sizes. We find a threshold of 6.0% for code capacity noise.

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)
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)
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)
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)
Decoding quantum color codes with MaxSAT [4.29377170477633]
We propose a novel decoder for quantum color codes using a formulation as a MaxSAT problem based on the LightsOut puzzle. We show that the decoding performance of the proposed decoder achieves state-of-the-art decoding performance on color codes.
arXiv Detail & Related papers (2023-03-24T19:00:02Z)
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)
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)
Quantum computation on a 19-qubit wide 2d nearest neighbour qubit array [59.24209911146749]
This paper explores the relationship between the width of a qubit lattice constrained in one dimension and physical thresholds. We engineer an error bias at the lowest level of encoding using the surface code. We then address this bias at a higher level of encoding using a lattice-surgery surface code bus.
arXiv Detail & Related papers (2022-12-03T06:16:07Z)
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)
Efficient color code decoders in $d\geq 2$ dimensions from toric code decoders [77.34726150561087]
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.
arXiv Detail & Related papers (2019-05-17T17:41:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.