This is the authors' abstract. We don't add key points for this paper.
Maximum likelihood decoding (MLD) achieves optimal accuracy but is computationally infeasible for large-distance codes. Tensor-network-based MLD (TN-MLD) improves efficiency but has so far only been shown to work for small-distance surface codes. We introduce a hypergraph-based approximate MLD (HAMLD) that enables more efficient decoding of more general codes under circuit-level noise. Unlike TN-MLD, our HAMLD employs syndrome-guided hyperedge selection and probability-based truncation to reduce redundant computation. We benchmarked our approach on surface codes, color codes, and bivariate-bicycle (BB) codes under a circuit-level noise model. Numerical results demonstrate that HAMLD can decode BB codes with hundreds of qubits, which MLD and TN-MLD cannot handle. For a surface code with distance and repetition rounds both equal to 3, HAMLD achieves optimal decoding accuracy while being about <a:math xmlns:a="http://www.w3.org/1998/Math/MathML"> <a:mrow> <a:mn>323</a:mn> <a:mo>×</a:mo> </a:mrow> </a:math> faster than MLD and about <b:math xmlns:b="http://www.w3.org/1998/Math/MathML"> <b:mrow> <b:mn>551</b:mn> <b:mo>×</b:mo> </b:mrow> </b:math> faster than TN-MLD. HAMLD also achieves higher accuracy than common decoders—minimum-weight perfect matching, Chromobius, and <c:math xmlns:c="http://www.w3.org/1998/Math/MathML"> <c:mrow> <c:mi>BP</c:mi> <c:mo>+</c:mo> <c:mi>OSD</c:mi> </c:mrow> </c:math> —in the two smallest parameter settings we considered, reducing logical error rates by an average of 27.8% for surface codes, 58.5% for color codes, and 74.4% for BB codes through degeneracy-aware and precise hypergraph selection.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Chen et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: