High-performance cellular automaton decoders for quantum repetition and toric code

arXiv:2604.21866 · quant-ph, nlin.AO, nlin.CG · Submitted 2026-04-23 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Quantum Radio. Generated commentary on the latest quantum physics and condensed matter papers.

Kai: We're looking at the paper: "High-performance cellular automaton decoders for quantum repetition and toric code".

Mira: Here's the gist of the paper. High-performance cellular automaton (CA) decoders are proposed as a promising class of local decoders for quantum error correction, addressing the need for extremely low logical error rates in large-scale quantum computers by avoiding communication bottlenecks.

Kai: The work introduces SCALA (Signaling CA with Local Attraction), a novel non-hierarchical CA decoder designed for quantum repetition and toric codes.

Mira: This design is contrasted against the hierarchical CA decoder proposed by Harrington

1: , allowing a direct comparison between non-hierarchical and renormalization-group-style local decoding strategies across performance, scalability, and robustness metrics.

Kai: Performance analysis reveals that SCALA achieves a higher code-capacity threshold of approximately p c about 7.5% compared to Harrington's about 4.5%.

Paper summary: Kai: So, we're looking at this paper today, "High-performance cellular automaton decoders for quantum repetition and toric code." It seems like they're proposing a new type of local decoder called SCALA, which is designed for quantum repetition and toric codes. This whole area is about needing these extremely low logical error rates for big quantum computers.

Mira: Exactly. The main idea here is that they want to find a way to do this without the communication bottlenecks you get with global decoding strategies. They introduce SCALA, which they call Signaling CA with Local Attraction, and they compare it directly against a hierarchical CA decoder from Harrington’s work.

Lev: I'm interested in how much better this is for actual hardware. The paper claims SCALA outperforms Harrington's decoder in several ways, specifically regarding the code-capacity threshold and scaling of logical errors.

Kai: Right, so the performance analysis shows that SCALA hits a higher code-capacity threshold of approximately seven point five percent compared to Harrington’s four point five percent. That's a pretty big difference for how much error they can tolerate before it gets uncorrectable.

Mira: And they also look at scaling, which is crucial for when we move to bigger codes. SCALA shows better sub-threshold scaling for the toric code at a rate of p L proportional to p to d over four while the hierarchical structure limits logical error suppression to something sublinear like p L equals p raised to lambda of d with lambda of d being about d times log base three two.

Lev: That scaling difference is significant. The non-hierarchical design of SCALA lets them get a better effective distance scaling, which is about d over four consistent with big O of n, contrasting sharply with that sublinear scaling in the hierarchical designs.

Kai: Now, moving to scalability for hardware implementation itself. Harrington's decoder needs memory per CA cell to scale with the code distance d. SCALA keeps a constant memory requirement per cell, which means it could be modular and suitable for hardware, regardless of how big the system gets.

Mira: That modularity is key because global decoders like minimum-weight perfect matching require more complex global coordination. The simpler CA logic and strict local update rules in SCALA are what make it a prerequisite for scalable hardware realization.

Lev: From an engineering standpoint, that constant memory requirement is a huge plus for running this on real hardware where overhead really lands. But we have to consider the trade-offs with how much computational complexity the local attraction part adds to the update rule itself.

Kai: The paper also looks at robustness when things go wrong, and they show SCALA has stronger robustness against qubit measurement errors than Harrington's design. That’s important because in real-time decoding, speed often beats just checking if the syndrome is correct.

Paper summary: Mira: And it's not just about measurement errors; SCALA remains functional even when you allow noise within the CA dynamics, whereas Harrington’s decoder breaks down under those conditions. That suggests a more resilient system overall.

Lev: So, what does this mean for someone who only listens to the show? It means that if you're building hardware that needs fast decoding and can't afford global communication delays, SCALA looks like a more practical choice because it handles both performance and noise better than the hierarchical approach they compared it to.

Kai: I agree. But there are still caveats. The paper mentions a finite-size effect in their SCALA one dimensional model, specifically for d equals seven, related to signal wrap around on small lattices that gets suppressed when the code distance is larger than seven.

Mira: So, while the asymptotic minimum-weight scaling holds for d greater than seven, they are still pointing out that for very small codes or lattices, you have to be mindful of those wrap around issues. That's a limitation you have to account for in your design choices.

Lev: I also saw some discussion about measurement error processes in Harrington’s decoder; the authors concluded that the dominant failure mechanism under pure measurement noise isn't actually captured by its accumulation scheme, which means their understanding of how errors build up might be incomplete.

Kai: It really puts things into perspective when you look at the architectural trade-offs between hierarchical and non-hierarchical designs. The paper shows that while hierarchical CA decoders impose a recursive structure similar to renormalization group decoders, SCALA is structurally unbound and can achieve scaling consistent with big O of n.

Mira: So the main difference boils down to structure: one is bound by recursion, the other isn't, which allows for better distance scaling. The authors are pointing out that non-hierarchical designs are not structurally limited in this way.

Lev: This distinction matters when you think about what it takes to run this on real hardware. A recursive structure can sometimes be easier to implement in certain ways, but SCALA's simpler logic might translate into lower overhead for the actual decoding process under real conditions.

Kai: Overall, this paper, "High-performance cellular automaton decoders for quantum repetition and toric code," presents SCALA2D as a more attractive CA decoder because it shows superior performance metrics alongside modularity and robustness.

Mira: The implication is that for building scalable quantum error correction systems, focusing on non-hierarchical local decoders like SCALA might give you better asymptotic scaling without sacrificing the ability to handle noise gracefully.

Lev: So, for the listener who is trying to decide which path to take in this research area, the paper suggests that moving away from strictly hierarchical structures toward these non-hierarchical CA models could lead to better performance and a more practical architecture for future quantum hardware.

Conclusion: Kai: So we've been looking at this paper about cellular automaton decoders for quantum repetition and toric codes.

Mira: Yeah, it's about these local decoders that they call SCALA, and how it stacks up against older hierarchical methods.

Lev: The main thing is that they are trying to get very low logical error rates without needing massive communication between all the parts of the quantum computer.

Kai: Exactly. They show how this non-hierarchical structure works better than the old ways they were looking at, like Harrington's design.

Mira: They found that SCALA can handle a higher code capacity threshold, which is about seven point five percent compared to four point five percent for the other approach.

Lev: That difference in capacity is significant because it tells you how much more noise your system can tolerate before it breaks down.

Kai: And they also show better scaling for the logical error suppression when you go to bigger codes, like toric codes, with SCALA scaling at p L proportional to p to d over four.

Mira: That scaling difference is what really matters because it shows a better way to handle those larger systems in terms of how the error distance grows with the code size.

Lev: For real hardware running this stuff, they found that SCALA keeps memory per cell constant, which means it's much more modular and easier to build than those global decoders that need to scale with the code distance itself.

Kai: That modularity is huge for implementation because it lets you make a design once and adapt it for different system sizes easily.

Mira: And they also showed SCALA is more robust against measurement errors, which means it's better at handling the kind of noise you actually see in real quantum hardware when you are trying to decode things fast.

Lev: It’s about being faster and more reliable simultaneously, which is a tough balance to strike in quantum error correction.

Kai: So what does this mean for the future of building these machines?

Peter Grünberg Institute · Institute for Quantum Information RWTH Aachen University · International Institute of Physics Federal University of Rio Grande do Norte

quant-ph, nlin.AO, nlin.CG

Submitted: 2026-04-23

Updated: 2026-11-05

Comments: 39 pages, 37 figures

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 92/100

The gist: High-performance cellular automaton (CA) decoders are proposed as a promising class of local decoders for quantum error correction…

Key concepts

Cellular Automaton (CA) Decoder
A CA decoder uses a grid of local rules to process quantum error syndromes. Instead of complex global calculations, each cell updates based only on its immediate neighbors. This local approach is designed for high-performance, low-latency decoding in quantum error correction.
SCALA (Signaling CA with Local Attraction)
This is the novel non-hierarchical CA decoder introduced. It uses local attraction rules to guide the decoding process. Unlike hierarchical methods, SCALA maintains a constant memory requirement per cell, making it highly modular and suitable for scalable hardware architectures.
Hierarchical vs. Non-Hierarchical Decoding
Hierarchical decoders impose a recursive structure similar to renormalization group methods, which limits logical error suppression scaling. SCALA's non-hierarchical design avoids this restriction, allowing it to achieve superior scaling of the effective distance ($O(d)$) and better performance metrics.
Code Capacity Threshold ($p_c$)
This metric indicates the maximum physical error rate (noise level) at which a quantum code can still reliably correct errors. SCALA achieves a higher threshold ($\approx 7.5\%$) than other methods, meaning it can handle noisier environments before failing to maintain low logical error rates.

Terminology

Summary

High-performance cellular automaton (CA) decoders are proposed as a promising class of local decoders for quantum error correction, addressing the need for extremely low logical error rates in large-scale quantum computers by avoiding communication bottlenecks. p. 0

Where the paper says it

M¨uller1, 2 1Peter Gr¨unberg Institute, Theoretical Nanoelectronics, Forschungszentrum J¨ulich, D-52425 J¨ulich, Germany 2 Institute for Quantum Information, RWTH Aachen University, D-52056 Aachen, Germany 3 International Institute of Physics, Federal University of Rio Grande do Norte, Natal 59078-970, Brazil 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.

The work introduces SCALA (Signaling CA with Local Attraction), a novel non-hierarchical CA decoder designed for quantum repetition and toric codes. p. 0
Where the paper says it

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.

This design is contrasted against the hierarchical CA decoder proposed by Harrington [1], allowing a direct comparison between non-hierarchical and renormalization-group-style local decoding strategies across performance, scalability, and robustness metrics. p. 0
Where the paper says it

By evaluating SCALA alongside the hierarchical CA decoder proposed by Harrington [1], we provide a direct comparison between non-hierarchical and renormalization-group-style local decoding strategies. We characterize SCALA across three key metrics: Performance, scalability, and robustness.

Performance analysis reveals that SCALA achieves a higher code-capacity threshold of approximately p c about 7. p. 0

Where the paper says it

We characterize SCALA across three key metrics: Performance, scalability, and robustness. Our results show that SCALA achieves a code-capacity threshold of approximately pc ≈ 7.

5% compared to Harrington's about 4.5%. Furthermore, SCALA exhibits superior sub-threshold scaling for the toric code at p L proportional to p d/4, whereas the hierarchical structure limits logical error suppression to a sublinear scaling of p L = p lambda(d) with lambda(d) about d 3 2. p. 1
Where the paper says it

As a representative of renormalization-group decoders, the Harrington CA exhibits an effective code distance λ(d) = d log3 2 and a code-capacity threshold of pc ≈ 4. This sublinear scaling is common to hierarchical structures, where error propagation between levels limits logical error suppression.

The non-hierarchical design of SCALA allows for a superior scaling of the effective distance, lambda(d) about d/4, consistent with O(d), contrasting with the sublinear scaling in hierarchical designs. p. 1
Where the paper says it

To address these limitations, we develop and benchmark SCALA, a non-hierarchical CA decoder that treats all error sizes within a single, decentralized computational layer. We demonstrate that SCALA achieves an effective code distance consistent with λ(d) ≈ d/4, exhibiting the linear scaling typically inaccessible to hierarchical designs.

Scalability is another key advantage of SCALA. p. 0

Where the paper says it

By evaluating SCALA alongside the hierarchical CA decoder proposed by Harrington [1], we provide a direct comparison between non-hierarchical and renormalization-group-style local decoding strategies. We characterize SCALA across three key metrics: Performance, scalability, and robustness.

While Harrington's decoder requires memory per CA cell to scale with the code distance d, SCALA maintains a constant memory requirement per cell, ensuring a modular local architecture suitable for hardware implementation, independent of system size. This contrasts sharply with global decoders like minimum-weight perfect matching. p. 0
Where the paper says it

Realizing scalable decoding, however, presents a major challenge. Conventional decoders like Minimum-Weight Perfect Matching (MWPM) [14–16] exhibit a computational complexity that scales polynomially with system size.

The non-hierarchical nature of SCALA is also linked to its simpler CA logic and strict local update rules, which are prerequisites for scalable hardware realization. p. 1
Where the paper says it

We propose that this property, combined with the overall simpler CA logic of SCALA, is a prerequisite for a potential realization in scalable hardware. In contrast to global decoders such as minimum-weight perfect matching, this performance is achieved using strictly local update rules.

Robustness against noise is significantly improved in SCALA. p. 1

Where the paper says it

We demonstrate that SCALA achieves an effective code distance consistent with λ(d) ≈ d/4, exhibiting the linear scaling typically inaccessible to hierarchical designs. Crucially, SCALA’s local, attractive dynamics exhibit significantly stronger resilience against signaling noise, which, combined with a locally modular architecture where local resources are independent of system size, offers a scalable path for high-throughput decoding.

It demonstrates stronger robustness against qubit measurement errors than Harrington's design, a critical feature for real-time decoding where speed often supersedes syndrome verification. Moreover, SCALA remains functional even when allowing noise within the CA dynamics, whereas Harrington’s decoder breaks down under such conditions. p. 1
Where the paper says it

SCALA shows that despite imperfect syndrome measurements, data qubit errors are the dominant logical error source that determines the scaling behavior. Moreover, we show that our non-hierarchical design remains functional even when we allow for noise inside the CA dynamics, whereas Harrington’s decoder breaks down in this scenario.

The paper also explores the architectural trade-offs between hierarchical and non-hierarchical designs. p. 1

Where the paper says it

These constraints motivate the exploration of alternative paradigms, such as local decoders, which are designed to maintain high throughput as the number of physical qubits increases. To evaluate the potential of different CA strategies, we compare the architectural trade-offs between hierarchical and non-hierarchical designs.

Hierarchical CA decoders impose a recursive structure similar to renormalization group decoders, restricting logical error rates. p. 3
Where the paper says it

Construction Harrington’s automaton features a hierarchical design. Similar to renormalization group [42, 43] and concatenated decoders, error chains of increasing length are corrected at increasing levels of a hierarchy by coarsegraining the syndrome with increasing granularity.

In contrast, non-hierarchical designs are not structurally bound and can achieve superior scaling consistent with O(d). p. 1
Where the paper says it

To address these limitations, we develop and benchmark SCALA, a non-hierarchical CA decoder that treats all error sizes within a single, decentralized computational layer. We demonstrate that SCALA achieves an effective code distance consistent with λ(d) ≈ d/4, exhibiting the linear scaling typically inaccessible to hierarchical designs.

The study further details the specific mechanisms leading to logical failure in SCALA1D (for d=7), identifying a finite-size effect related to signal wrap-around on small lattices, which is suppressed for larger code distances, confirming that the asymptotic minimum-weight scaling holds for d > 7. Finally, Appendix D analyzes measurement error processes in Harrington's decoder and concludes that the dominant failure mechanism under pure measurement noise is not captured by its accumulation scheme. Overall, SCALA2D is presented as a more attractive CA decoder due to its superior performance, modularity, simplicity, and robustness. p. 2
Where the paper says it

V, we extend these dynamics to two dimensions and obtain the SCALA2D decoder for the toric code. We provide numerical simulations and analyze the minimal-weight logical failure events and signal noise processes, demonstrating improved performance and robustness compared to Harrington’s decoder.

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Non-hierarchical Cellular Automaton Decoder (SCALA) can achieve a code-capacity threshold of approximately pc ≈ 7.5% and provide strong sub-threshold scaling of about pL proportional to p to the power of d/4 on the toric code, outperforming hierarchical decoders like Harrington's.

  2. The SCALA design ensures that local computational resources remain independent of system size, yielding a modular local architecture suitable for hardware implementation, which is a prerequisite for realizing scalable quantum error correction.

  3. SCALA demonstrates strong robustness to qubit measurement errors and noise within the decoder itself, which is critical for real-time decoding on noisy hardware.

  4. The SCALA1D variant can be used as a maximum-likelihood decoder under code-capacity noise, possessing a QEC threshold of pc = 1/2 and sub-threshold scaling of pL proportional to p to the power of (d+1)/2 for the repetition code.

  5. SCALA2D corrects errors on the toric code by applying two independent instances of the decoder on X- and Z-error syndrome, exploiting its CSS nature while mitigating inter-decoder communication issues through a signal reflection subrule.

  6. The SCALA2D decoder shows superior performance compared to Harrington's two-dimensional decoder in both the code-capacity setting and phenomenological noise, exhibiting earlier pairwise crossings and improved scaling for p to 0.

  7. SCALA2D is more robust against measurement errors than Harrington’s decoder, which is beneficial for real-time decoding where decoding speed is often preferred over syndrome verification.

  8. SCALA1D can be used to model the logical lifetime of the repetition code under phenomenological noise, showing that the minimum error-weight for logical failure scales linearly with d as w0(d) ≥ (1 + sqrt(d))(2/4).

  9. The SCALA2D decoder's performance scaling in pL for toric codes matches the scaling in the average logical lifetime of SCALA1D under phenomenological noise, suggesting that both decoders share the same minimum-error weight.

  10. The SCALA2D design is more robust to signal noise than Harrington's decoder, and its simpler logic and constant memory requirements make it more amenable to implementation in noisy hardware or as a quantum cellular automaton (QCA).

Abstract

Execution of quantum algorithms on large-scale quantum computers will require extremely low logical error rates and scalable decoding architectures. Local decoders are promising candidates for this task because they avoid the communication and data-processing bottlenecks inherent in global decoding strategies. Here, we present SCALA (Signaling CA with Local Attraction), a non-hierarchical cellular automaton decoder for quantum repetition and toric codes, and compare it with the hierarchical CA decoder proposed by Harrington. SCALA combines constant local memory and simple nearest-neighbor signaling with a system-size-dependent global reset schedule. We find a code-capacity threshold estimate of p c 7.40(5)% and sub-threshold scaling approaching p L proportional to p d/4 for the toric code. For the finite system sizes accessible numerically, and despite numerical evidence for the absence of a finite critical threshold, SCALA also provides strong logical-error suppression under phenomenological noise while retaining its low local computational overhead. SCALA furthermore remains robust when its internal signals are themselves noisy. Together with its simple local dynamics, this makes SCALA particularly interesting for low-overhead real-time decoding and motivates its exploration as a quantum cellular automaton for measurement-free quantum error correction.

Sources

Related papers