Related papers: A Decoder for the Color Code with Boundaries

A Decoder for the Color Code with Boundaries

URL: http://arxiv.org/abs/2003.11602v3
Date: Fri, 12 Mar 2021 21:25:06 GMT
Title: A Decoder for the Color Code with Boundaries
Authors: Skylar Turner, Josey Hanish, Eion Blanchard, Noah Davis, Brian La Cour
Abstract summary: We introduce a decoder for the 3D color code with boundaries. We numerically estimate a threshold of $4% - 8%$ for Pauli $X$ errors.
Score: 0.0
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: We introduce a decoder for the 3D color code with boundaries, which is a variation of the restriction decoder introduced by Kubicka and Delfosse. Specifically, we adapt the lift procedure to efficiently find a correction on qubits adjacent to a boundary. We numerically estimate a threshold of $4\% - 8\%$ for Pauli $X$ errors and a threshold of $0.7\% - 0.8\%$ for Pauli $Z$ errors. Our work is a first step towards characterizing the performance of Bomb\'{i}n's recently proposed "colorful quantum computing."

Related papers

Quantum error correction below the surface code threshold [107.92016014248976]
Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit. We present two surface code memories operating below a critical threshold: a distance-7 code and a distance-5 code integrated with a real-time decoder. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.
arXiv Detail & Related papers (2024-08-24T23:08:50Z)
Scalable 3D Registration via Truncated Entry-wise Absolute Residuals [65.04922801371363]
A $3$D registration approach can process more than ten million ($107$) point pairs with over $99%$ random outliers. We call our method TEAR, as it involves minimizing an outlier-robust loss that computes Truncated Entry-wise Absolute Residuals.
arXiv Detail & Related papers (2024-04-01T04:43:39Z)
Exact results on finite size corrections for surface codes tailored to biased noise [0.0]
We study the XY and XZZX surface codes under phase-biased noise. We find exact solutions at a special disordered point. We show that calculating thresholds based not only on the total logical failure rate, but also independently on the phase- and bit-flip logical failure rates, gives a more confident estimate.
arXiv Detail & Related papers (2024-01-08T16:38:56Z)
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)
Communication-Constrained Bandits under Additive Gaussian Noise [111.06688156723018]
We study a distributed multi-armed bandit where a client supplies the learner with communication-constrained feedback. We propose a multi-phase bandit algorithm, $mathttUEtext-UCB++$, which matches this lower bound to a minor additive factor.
arXiv Detail & Related papers (2023-04-25T09:31:20Z)
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)
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)
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)
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.