Curator's Take
This article tackles one of quantum computing's biggest challenges by cleverly combining two different error correction approaches to get the best of both worlds. The researchers show how to use high-rate quantum LDPC codes as a foundation layer, then stack algebraic codes on top to handle the complex correlated errors that emerge when you pack many logical qubits into single code blocks. What makes this particularly exciting is their demonstration that the concatenated system can reach the "teraquop" regime - a threshold where quantum computers become genuinely useful for practical applications - something the individual codes couldn't achieve alone. The work also reveals an intriguing insight that fault tolerance behaves very differently for high-dimensional quantum systems compared to traditional qubits, potentially opening new pathways for building more efficient quantum error correction schemes.
— Mark Eatherly
Summary
Different quantum error correction schemes trade off overhead, error suppression, and hardware connectivity. Code concatenation can relax these tradeoffs by using an outer code whose non-local connectivity is supplied by logical operations of an inner code rather than directly by hardware. Prior works showed that this can reduce memory overhead for local low-rate inner codes such as the surface code. Here, we study concatenation over non-local, high-rate inner codes. Such inner codes experience correlated errors among the many logical qubits in a single codeblock. We handle this by treating each block as a single logical Galois qudit, enabling concatenation with algebraic outer codes with excellent parameters and, crucially, list decoders. In particular, we consider a memory system formed by concatenating quantum Reed-Solomon outer codes over the gross code. For fault-tolerant syndrome extraction, we develop a Galois qudit Shor scheme using "time-like" Reed-Solomon protection against measurement errors. Interestingly, a lightweight fault tolerance scheme, that would fail for qubits, works well for large-alphabet qudits, suggesting a very different theory of fault tolerance for such qudits. The whole protocol is optimised via improved bicycle instruction logical error rates, novel compilation strategies, and recent decoder post-selection rules. At uniform $10^{-3}$ physical noise, the concatenated gross code reaches the teraquop regime, which it previously could not access, with a lower space overhead than the $288$-qubit two-gross code, while offering several advantages from the engineering standpoint. Beyond our main case study, we believe the core ideas of Galois qudits, quantum Reed-Solomon outer codes, and list decoding, will prove generically powerful and highly transferable ideas across high-rate quantum architectures.