Generalizing the matching decoder for the Chamon code

Abstract

Different choices of quantum error-correcting codes can reduce the demands on the physical hardware needed to build a quantum computer. To achieve the full potential of a code, we must develop practical decoding algorithms that can correct errors that have occurred with high likelihood. Matching decoders are very good at correcting local errors while also demonstrating fast run times that can keep pace with physical quantum devices. We implement variations of a matching decoder for a three-dimensional, non-CSS, low-density parity check code known as the Chamon code, which has a non-trivial structure that does not lend itself readily to this type of decoding. The non-trivial structure of the syndrome of this code means that we can supplement the decoder with additional steps to improve the threshold error rate, below which the logical failure rate decreases with increasing code distance. We find that a generalized matching decoder that is augmented by a belief-propagation step prior to matching gives a threshold of 10.5% for depolarizing noise.

arXiv comment9 pages, 7 figures

References in corpus (42)

• Fault-tolerant quantum computation by anyons
• Surface codes: Towards practical large-scale quantum computation
• Topological quantum memory
• Quantum error correction below the surface code threshold
• Quantum Glassiness
• High-threshold and low-overhead fault-tolerant quantum memory
• Quantum codes on a lattice with boundary
• Resilient Quantum Computation: Error Models and Thresholds
• Analytic and numerical demonstration of quantum self-correction in the 3D Cubic Code
• The XZZX Surface Code
• Fast Decoders for Topological Quantum Codes
• Topological order in an exactly solvable 3D spin model
• Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
• Decoding Across the Quantum LDPC Code Landscape
• Correcting coherent errors with surface codes
• Fault-tolerant thresholds for the surface code in excess of 5% under biased noise
• Sparse Blossom: correcting a million errors per core second with minimum-weight matching
• High threshold error correction for the surface code
• Matching and maximum likelihood decoding of a multi-round subsystem quantum error correction experiment
• Decoding color codes by projection onto surface codes
• Tensor-Network Simulations of the Surface Code under Realistic Noise
• Efficient Decoders for Qudit Topological Codes
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes
• Parallelized quantum error correction with fracton topological codes
• Analysing correlated noise on the surface code using adaptive decoding algorithms
• Decoding algorithms for surface codes
• Combining hard and soft decoders for hypergraph product codes
• Optimal complexity correction of correlated errors in the surface code
• A local pre-decoder to reduce the bandwidth and latency of quantum error correction
• Efficient color code decoders in $d\ge 2$ dimensions from toric code decoders
• The XYZ${}^2$ hexagonal stabilizer code
• Conservation laws and quantum error correction: towards a generalised matching decoder
• A decoding algorithm for CSS codes using the X/Z correlations
• Tailoring three-dimensional topological codes for biased noise
• A cellular automaton decoder for a noise-bias tailored color code
• Correcting spanning errors with a fractal code
• Quantum XYZ Product Codes
• Modeling error correction with Lindblad dynamics and approximate channels
• New circuits and an open source decoder for the color code
• Minimising surface-code failures using a color-code decoder
• Improved accuracy for decoding surface codes with matching synthesis
• Quantum memory error correction computation based on Chamon model