Improved HDRG decoders for qudit and non-Abelian quantum error correction

Abstract

Hard-decision renormalization group (HDRG) decoders are an important class of decoding algorithms for topological quantum error correction. Due to their versatility, they have been used to decode systems with fractal logical operators, color codes, qudit topological codes, and non-Abelian systems. In this work, we develop a method of performing HDRG decoding which combines strenghts of existing decoders and further improves upon them. In particular, we increase the minimal number of errors necessary for a logical error in a system of linear size $L$ from $\Theta (L^{2/3})$ to $\Omega (L^{1-\epsilon })$ for any $\epsilon >0$. We apply our algorithm to decoding $D({\mathbb{Z}}_d)$ quantum double models and a non-Abelian anyon model with Fibonacci-like fusion rules, and show that it indeed significantly outperforms previous HDRG decoders. Furthermore, we provide the first study of continuous error correction with imperfect syndrome measurements for the $D({\mathbb{Z}}_d)$ quantum double models. The parallelized runtime of our algorithm is $\text{poly}(\log L)$ for the perfect measurement case. In the continuous case with imperfect syndrome measurements, the averaged runtime is $O(1)$ for Abelian systems, while continuous error correction for non-Abelian anyons stays an open problem.

14 pages, 11 figures; v2: to appear in New J. Phys

References in corpus (17)

• Surface codes: Towards practical large-scale quantum computation
• Topological quantum memory
• Local stabilizer codes in three dimensions without string logical operators
• Analytic and numerical demonstration of quantum self-correction in the 3D Cubic Code
• Towards practical classical processing for the surface code
• Enhanced fault-tolerant quantum computing in $d$-level systems
• Magic state distillation in all prime dimensions using quantum Reed-Muller codes
• Qutrit Magic State Distillation
• Efficient Decoders for Qudit Topological Codes
• An efficient Markov chain Monte Carlo algorithm for the surface code
• Qudit surface codes and gauge theory with finite cyclic groups
• Kitaev's Z_d-Codes Threshold Estimates
• Efficient Decoding of Topological Color Codes
• Decoding non-Abelian topological quantum memories
• Thermalization, Error-Correction, and Memory Lifetime for Ising Anyon Systems
• Quantum memories and error correction
• Entropic Barriers for Two-Dimensional Quantum Memories

Cited by in corpus (27)

• Almost-linear time decoding algorithm for topological codes
• Fault-tolerant error correction with the gauge color code
• Pauli stabilizer models of twisted quantum doubles
• A fast fault-tolerant decoder for qubit and qudit surface codes
• Analysing correlated noise on the surface code using adaptive decoding algorithms
• Decoding algorithms for surface codes
• Transversal Clifford gates on folded surface codes
• Tomography of Majorana Fermions with STM Tips
• Multi-path Summation for Decoding 2D Topological Codes
• Qudit Colour Codes and Gauge Colour Codes in All Spatial Dimensions
• Error Thresholds for Abelian Quantum Double Models: Increasing the bit-flip Stability of Topological Quantum Memory
• Cellular automaton decoders of topological quantum memories in the fault tolerant setting
• A local pre-decoder to reduce the bandwidth and latency of quantum error correction
• A decoder for the triangular color code by matching on a Möbius strip
• Qudits for decomposing multiqubit gates and realizing quantum algorithms
• A simple decoder for topological codes
• Classical Simulation of Quantum Error Correction in a Fibonacci Anyon Code
• Parafermions in a Kagome lattice of qubits for topological quantum computation
• Topological quantum error correction in the Kitaev honeycomb model
• Active error correction for Abelian and non-Abelian anyons
• Universal quantum computation in the surface code using non-Abelian islands
• Lifting topological codes: Three-dimensional subsystem codes from two-dimensional anyon models
• Continuous error correction for Ising anyons
• Non-Pauli errors can be efficiently sampled in qudit surface codes
• Enhanced repetition codes for the cross-platform comparison of progress towards fault-tolerance
• Quantum computation with charge-and-color permuting twists in qudit color codes
• Intrinsic Heralding and Optimal Decoders for Non-Abelian Topological Order