Proof of a finite threshold for the union-find decoder

TL;DR

This paper rigorously proves a finite error threshold for the union-find decoder in surface codes, establishing its fault-tolerance capabilities under realistic error models, and analyzes its runtime complexity.

Contribution

It provides the first rigorous proof of a finite threshold for the union-find decoder, extending error-clustering techniques and analyzing runtime bounds.

Findings

Proves a finite threshold for the UF decoder under circuit-level errors.

Develops a refined error-clustering framework for analysis.

Establishes a quasi-polylogarithmic upper bound on decoder runtime.

Abstract

Fast decoders that achieve strong error suppression are essential for fault-tolerant quantum computation (FTQC) from both practical and theoretical perspectives. The union-find (UF) decoder for the surface code is widely regarded as a promising candidate, offering almost-linear time complexity and favorable empirical error suppression supported by numerical evidence. However, the lack of a rigorous threshold theorem has left open whether the UF decoder can achieve fault tolerance beyond the error models and parameter regimes tested in numerical simulations. Here, we provide a rigorous proof of a finite threshold for the UF decoder on the surface code under the circuit-level local stochastic error model. To this end, we develop a refined error-clustering framework that extends techniques previously used to analyze cellular-automaton and renormalization-group decoders, by showing that error clusters can be separated by substantially larger buffers, thereby enabling analytical control over the behavior of the UF decoder. Using this guarantee, we further prove a quasi-polylogarithmic upper bound on the average runtime of a parallel UF decoder in terms of the code size. We also show that this framework yields a finite threshold for the greedy decoder, a simpler decoder with lower complexity but weaker empirical error suppression. These results provide a solid theoretical foundation for the practical use of UF-based decoders in the development of fault-tolerant quantum computers, while offering a unified framework for studying fault tolerance across these practical decoders.