Comparison of 2D topological codes and their decoding performances

Abstract

Topological quantum codes are favored because they allow qubit layouts that are suitable for practical implementation. An $N$-qubit topological code can be decoded by minimum-weight perfect matching (MWPM) with complexity $O(\text{poly}(N))$ if it is of CSS-type. Recently it is shown that various quantum codes, including non-CSS codes, can be decoded by an adapted belief propagation with memory effects (denoted MBP) with complexity almost linear in $N$. In this paper, we show that various two-dimensional topological codes, CSS or non-CSS, regardless of the layout, can be decoded by MBP, including color codes and twisted XZZX codes. We will comprehensively compare these codes in terms of code efficiency and decoding performance, assuming perfect error syndromes.

References in corpus (6)

• Topological Quantum Distillation
• Topological Order with a Twist: Ising Anyons from an Abelian Model
• Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
• Log-domain decoding of quantum LDPC codes over binary finite fields
• Decoding of Quantum Data-Syndrome Codes via Belief Propagation
• Trellis Decoding For Qudit Stabilizer Codes And Its Application To Qubit Topological Codes

Cited by in corpus (6)

• Exploiting Degeneracy in Belief Propagation Decoding of Quantum Codes
• Conservation laws and quantum error correction: towards a generalised matching decoder
• Improved Belief Propagation Decoding Algorithms for Surface Codes
• On Belief Propagation Decoding of Quantum Codes with Quaternary Reliability Statistics
• Degenerate quantum erasure decoding
• Generalized quantum data-syndrome codes and belief propagation decoding for phenomenological noise