Union-find decoder for surface code achieves finite threshold under circuit-level stochastic errors with quasi-polylog parallel runtime bound.
Toward a union- find decoder for quantum ldpc codes
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
DART-Q shows that cached state organization, overload policies, and service capacity determine whether real-time QLDPC decoders can meet deadlines under finite memory and varying load.
citing papers explorer
-
Proof of a finite threshold for the union-find decoder
Union-find decoder for surface code achieves finite threshold under circuit-level stochastic errors with quasi-polylog parallel runtime bound.
-
DART-Q : A Deadline-Driven Framework for Real-Time QLDPC Decoding
DART-Q shows that cached state organization, overload policies, and service capacity determine whether real-time QLDPC decoders can meet deadlines under finite memory and varying load.