High-performance cellular automaton decoders for quantum repetition and toric code
Don Winter, Thiago L. M. Guedes, Markus M\"uller

TL;DR
This paper introduces SCALA, a novel cellular automaton decoder for quantum codes, demonstrating high performance, scalability, and robustness suitable for real-time quantum error correction.
Contribution
SCALA is a new non-hierarchical cellular automaton decoder that outperforms previous strategies in performance, scalability, and robustness for quantum error correction.
Findings
Achieves a code-capacity threshold of approximately 7.5%.
Provides strong sub-threshold scaling of p_L∝ p^{d/4}.
Ensures local computational resources are independent of system size.
Abstract
Execution of quantum algorithms on large-scale quantum computers will require extremely low logical error rates, which necessitates the development of scalable decoding architectures. Local decoders are promising candidates for this task, as they avoid the communication and data processing bottlenecks inherent in global decoding strategies. Cellular automaton (CA) decoders represent a distinct class of local decoders, offering a path toward the low-latency, real-time decoding required for practical applications. In this work, we present SCALA (Signaling CA with Local Attraction), a novel non-hierarchical cellular automaton decoder for quantum repetition and toric codes. By evaluating SCALA alongside the hierarchical CA decoder proposed by Harrington, we provide a direct comparison between non-hierarchical and renormalization-group-style local decoding strategies. We characterize SCALA…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
