Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays
Chen Zhao, Casey Duckering, Andi Gu, Nishad Maskara, Hengyun Zhou
Abstract
Quantum error correction is widely believed to be essential for large-scale quantum computation, but the required qubit overhead remains a central challenge. Quantum low-density parity-check codes can substantially reduce this overhead through high-rate encodings, yet finite-size instances with practical logical error rates often achieve encoding rates only around or below . Here, building on a recent ultra-high-rate construction by Kasai, we identify new structural conditions on the underlying affine permutation matrices that make encoding rates exceeding compatible with efficient implementation on reconfigurable neutral atom arrays. These conditions define a co-designed family of ultra-high-rate quantum codes that supports efficient syndrome extraction and atom rearrangement under realistic parallel control constraints. Using a hierarchical decoder with high accuracy and good throughput, we study the performance under a circuit-level noise model with , achieving per-logical-per-round error rates of with a code and with a code. These results approach the teraquop regime, highlighting the promise of this code family for practical ultra-high-rate quantum error correction.
AI Impact Assessments
(3 models)Scientific Impact Assessment
Core Contribution
This paper addresses a critical bottleneck in fault-tolerant quantum computation: the qubit overhead required for quantum error correction. Building on Kasai's recent affine permutation matrix (APM) construction for ultra-high-rate quantum LDPC codes, the authors identify new structural conditions—specifically, commutation constraints on transition APMs relative to a reference APM—that enable efficient implementation on reconfigurable neutral atom arrays. The key codes are a [[1152, 580, ≤12]] code (rate ~0.503) and a [[2304, 1156, ≤14]] code (rate ~0.502), both achieving encoding rates exceeding 1/2, which is remarkable for quantum codes at these block lengths. This is substantially higher than existing practical qLDPC codes, which typically operate at rates of ~1/10 or below at finite sizes relevant to near-term experiments.
The paper makes three intertwined contributions: (1) hardware-aware code co-design ensuring efficient syndrome extraction via structured atom rearrangement, (2) a hierarchical decoding pipeline combining belief propagation with integer programming fallback, and (3) circuit-level noise simulations demonstrating per-logical-per-round error rates approaching 10⁻¹³.
Methodological Rigor
The approach is technically sound across several dimensions. The code construction leverages the orbit decomposition of affine permutations and CRT-based 2D layouts, with formal proofs (Lemma 1, Lemma 3, Proposition 2) establishing that commuting transitions reduce to cyclic shifts plus small inter-orbit permutations. The structural analysis across P = 96, 192, 384, 768 is thorough.
The simulation methodology deserves scrutiny. The circuit-level noise model at p = 0.1% neglects idling errors entirely, which the authors justify by citing long coherence times of neutral atoms. While this is a reasonable idealization, it is also optimistic—real syndrome extraction cycles of 8-17 ms (or even the improved 2-4 ms estimates) are long enough that decoherence and atom loss could matter significantly. The coloration-based sequential X/Z extraction with depth 24 is also not the most efficient option; the authors note that depth could be reduced by 2-4× through various methods but do not simulate these improvements.
The statistical treatment of very low error rates is appropriate—using Clopper-Pearson confidence intervals and massive sample sizes (392M shots for the larger code). However, observing only 1 error in 392M shots, while yielding an impressively low error rate, leaves considerable statistical uncertainty (the confidence interval spans roughly an order of magnitude). The claim of "approaching the teraquop regime" is reasonable but should be understood with these wide error bars.
The hierarchical decoder is well-motivated: BP handles ~98.6% of shots, relay-BP captures most of the remainder, and only ~0.07% require the expensive integer-programming fallback. The concern is whether the T₃ decoder's accuracy is truly optimal—the authors note that all observed errors in the [[1152,580]] code were converged errors from earlier stages that T₃ could have corrected, suggesting the performance is somewhat limited by T₁/T₂ accuracy rather than fundamental code properties.
Potential Impact
The practical implications are significant. Encoding rates >1/2 mean that more than half of all physical qubits carry logical information, dramatically reducing the overhead for fault-tolerant computation. For "utility-scale" quantum computing requiring hundreds to thousands of logical qubits, this translates to needing roughly 2× the logical qubit count in physical qubits (plus ancillas), versus 10× or more for existing constructions.
The hardware co-design aspect is particularly valuable for the neutral atom community, where several groups are actively scaling systems. The detailed movement schedules, timing estimates, and layout specifications (Appendix D) provide a concrete blueprint for experimental implementation.
However, the paper focuses exclusively on quantum memory—no logical gates are demonstrated. The authors acknowledge this gap and discuss surgery-based approaches for computation, but the challenge of performing logical operations at these high rates could significantly erode the overhead advantage. The weight of logical operators in these codes is not characterized, which is a notable omission given that surgery overhead scales with logical operator weight.
Timeliness & Relevance
The paper is highly timely. Neutral atom platforms are rapidly scaling (6100-atom arrays demonstrated), and the question of which codes to implement is becoming pressing. The gap between classical LDPC rates (>1/2, used in 5G/WiFi) and quantum LDPC rates (~1/10) has been a well-known frustration; this work significantly narrows that gap. The concurrent independent work noted in the paper (achieving rates ≲0.3 at ~2600 qubits) further validates the timeliness of pursuing high-rate quantum codes.
Strengths
1. Rate breakthrough at practical sizes: Achieving rate >1/2 at ~1000-2300 qubits with meaningful distances is a genuine advance over prior art.
2. Holistic co-design: The integration of code construction, hardware layout, movement compilation, and decoding is exemplary.
3. Direct simulation at low error rates: Rather than extrapolating from higher error rates, the massive Monte Carlo campaigns provide direct evidence of performance.
4. Practical decoder architecture: The hierarchical approach balances accuracy and throughput, with realistic FPGA timing estimates.
5. Detailed hardware analysis: Movement schedules, timing estimates, and AOD compilation are worked out concretely.
Limitations
1. No idling noise: The absence of idling errors is a significant simplification given the 8-17 ms cycle times.
2. Memory only: No logical operations are demonstrated; the computational overhead advantage remains unquantified.
3. Distance bounds are upper bounds only: The reported distances (≤12, ≤14) are not exact, and the actual distances could be lower.
4. Limited code search: Only "a few hundred seeds" were searched per parameter set; more extensive searches might yield better instances.
5. Girth relaxation from 8 to 6: While empirically justified at moderate error rates, this could limit performance scaling to lower noise regimes.
6. Atom loss not modeled: A significant error channel in neutral atom experiments is entirely absent.
Overall Assessment
This paper represents a meaningful advance in practical quantum error correction, demonstrating that ultra-high encoding rates are compatible with realistic hardware constraints and competitive logical error rates. The co-design methodology is well-executed and the results are compelling, though the idealized noise model and memory-only focus leave important questions for future work. The paper will likely stimulate significant follow-up research in both code construction and neutral atom fault tolerance.
Generated Apr 20, 2026
Comparison History (43)
Paper 2 demonstrates exponential speedups in processing data from physical experiments using fault-tolerant quantum algorithms, bridging quantum computing with quantum sensing and experimental physics. This introduces a novel, broadly applicable framework ('quantum uploading') with high potential impact across diverse fields like astronomy. While Paper 1 makes significant strides in practical quantum error correction for atom arrays, Paper 2's theoretical breakthrough and interdisciplinary applications suggest a broader and more transformative scientific impact.
Paper 2 addresses one of the most critical bottlenecks in practical quantum computing: the massive qubit overhead required for quantum error correction. By presenting a co-designed family of ultra-high-rate quantum codes tailored for neutral atom arrays and demonstrating excellent performance under realistic circuit-level noise, it offers highly timely, concrete, and impactful advancements for scalable quantum technologies. While Paper 1 provides valuable foundational insights into causal principles, Paper 2 has a much clearer and more immediate path to transformative real-world applications in the quantum computing industry.
Paper 1 likely has higher impact: it delivers a concrete, implementation-aware advance in quantum error correction with striking finite-size performance (rates >1/2, near-teraquop logical error rates) under a circuit-level noise model, tightly aligned with a leading hardware platform (reconfigurable neutral-atom arrays). This combination of novelty, methodological rigor (explicit codes, decoding, noise modeling), and near-term applicability to scalable quantum computing gives broad and timely relevance. Paper 2 is conceptually innovative (mapping to an exactly solvable model) with potential cross-field relevance, but its impact depends more on experimental validation and the generality of assumptions.
Paper 1 addresses a critical bottleneck in quantum computing—qubit overhead for error correction—by demonstrating ultra-high-rate quantum codes (>1/2 encoding rate) compatible with neutral atom hardware, achieving near-teraquop logical error rates. This has immediate practical implications for scalable quantum computation. Paper 2 presents elegant theoretical work mapping cavity-mediated correlations to the SK model, but its impact is more niche. Paper 1's combination of theoretical innovation with hardware co-design, practical noise modeling, and relevance to the rapidly growing quantum computing field gives it broader and more timely impact.
Paper 2 addresses quantum error correction, one of the most critical bottlenecks for practical quantum computing. Achieving encoding rates exceeding 1/2 while maintaining very low logical error rates (~10^-13) on realistic hardware (neutral atom arrays) represents a major practical advance toward the teraquop regime. The co-design of codes with specific hardware constraints and circuit-level noise analysis makes this highly actionable. While Paper 1 introduces an elegant theoretical framework (quantum Gaussian processes) with nice applications, Paper 2's direct impact on enabling fault-tolerant quantum computing—the central challenge of the field—gives it broader and more immediate scientific impact.
Paper 2 targets a central bottleneck for scalable quantum computing—reducing error-correction overhead—by co-designing ultra-high-rate LDPC quantum codes with concrete constraints from reconfigurable neutral-atom hardware. It reports strong circuit-level performance (near teraquop logical error rates) at realistic noise, with an efficient decoder and implementation-aware syndrome extraction, making the path to real-world deployment clearer. While Paper 1 is novel and theoretically elegant (quantum Gaussian-process framework with provable matchgate scalability), its applications are more exploratory and likely narrower/longer-horizon than near-term, broadly enabling advances in fault-tolerant quantum computation.
Paper 1 addresses the critical bottleneck of qubit overhead in quantum error correction, demonstrating ultra-high-rate codes (>1/2 encoding rate) achieving near-teraquop logical error rates on realistic hardware. This directly advances practical fault-tolerant quantum computing—a central challenge in the field. While Paper 2 makes solid theoretical contributions to universality of constrained subspace circuits, its impact is more incremental. Paper 1's co-design of high-rate qLDPC codes with neutral atom architectures, achieving orders-of-magnitude improvements in logical error rates at practical code sizes, has transformative potential for the entire quantum computing roadmap.
Paper 2 has higher expected impact: it introduces broadly applicable theoretical results overturning a prevailing belief about Hamiltonian sparsifiability, covering multiple important Hamiltonian classes and yielding algorithmic consequences (e.g., improved semi-/streaming for quantum Max-Cut). This spans quantum complexity, algorithms, and simulation/optimization, so the cross-field reach is wide. Paper 1 is strong and timely for neutral-atom fault tolerance, but its impact is more platform- and code-family-specific, and hinges on performance under assumed noise/control models. Paper 2’s generality and foundational implications suggest wider downstream influence.
Paper 2 likely has higher scientific impact due to its direct relevance to a major bottleneck in scalable quantum computing (qubit overhead) and its strong real-world applicability via co-design with reconfigurable neutral-atom hardware constraints. It combines new structural code conditions, implementable syndrome extraction/rearrangement strategies, and circuit-level noise simulations achieving near-teraquop logical error rates at very high rates (>1/2), which is timely and broadly influential across quantum error correction, hardware architecture, and systems engineering. Paper 1 is novel and rigorous, but its impact is more specialized to quantum Hamiltonian complexity and algorithmic sparsification.
Paper 2 addresses quantum error correction overhead, a central bottleneck for practical quantum computing. It achieves encoding rates exceeding 1/2 (far beyond typical ~1/10), demonstrates near-teraquop logical error rates with practical hardware (neutral atom arrays), and co-designs codes with realistic implementation constraints. This combination of ultra-high rates, strong error suppression, and hardware compatibility represents a significant advance toward scalable quantum computing. While Paper 1 provides rigorous and broadly applicable universality proofs for constrained subspaces, Paper 2's direct impact on the feasibility of fault-tolerant quantum computation gives it higher transformative potential.
Paper 1 targets a globally recognized milestone (breaking RSA-2048) and demonstrates an order-of-magnitude reduction in the required physical qubits. This has massive, immediate implications for both quantum hardware roadmaps and global cybersecurity, giving it broader relevance and higher potential real-world impact than Paper 2, which focuses on a specific hardware platform (neutral atoms) despite its impressive error correction rates.
Paper 1 demonstrates a monumental reduction in the resource requirements for breaking RSA-2048, a benchmark of massive importance to cryptography and global security. While Paper 2 offers significant advancements in quantum error correction for neutral atom arrays, Paper 1's claim of achieving utility-scale computing and breaking RSA with under 100,000 qubits fundamentally alters the timeline and feasibility of high-impact quantum applications.
Paper 1 addresses a critical bottleneck in quantum computing—qubit overhead—by co-designing ultra-high-rate quantum error correction codes for reconfigurable atom arrays. Achieving encoding rates above 1/2 with exceptionally low error rates is a transformative step toward practical, large-scale fault-tolerant quantum computation. While Paper 2 offers a valuable general decoding framework, Paper 1's direct application to a highly promising hardware platform and its demonstration of near-teraquop performance suggest a higher and more immediate scientific impact in the field.
Paper 1 likely has higher impact due to a more novel co-design between ultra-high-rate quantum LDPC code structure and a specific scalable hardware platform (reconfigurable neutral-atom arrays), plus strong circuit-level logical error-rate results approaching the teraquop regime—directly addressing a central bottleneck (QEC overhead) with near-term relevance. Paper 2 is broadly applicable and useful (general stabilizer decoding + open-source), but bounded-distance decoding is less paradigm-shifting and its demonstrated performance is mainly on small-distance codes, suggesting more incremental impact.
Paper 2 addresses the central challenge of qubit overhead in quantum error correction with a novel co-designed code family achieving encoding rates exceeding 1/2—far beyond typical ~1/10 rates—while demonstrating near-teraquop performance. This represents a potentially transformative advance for practical fault-tolerant quantum computing. Paper 1 offers valuable incremental improvements to error suppression in dynamic circuits through empirical DD optimization, but Paper 2's contribution to reducing the fundamental resource requirements of quantum error correction has broader and more lasting impact on the field's trajectory toward scalable quantum computation.
Paper 2 likely has higher impact: it demonstrates an empirically learned, hardware-level error-suppression method directly improving dynamic circuits with mid-circuit measurement/feedforward—capabilities broadly needed across near-term algorithms and fault-tolerant primitives. The results are experimentally grounded (RB error reduction, QFT+M up to 20 qubits, post-entanglement QFT), timely for current superconducting/ion/neutral platforms adopting dynamic circuits, and broadly applicable without committing to a specific code family. Paper 1 is innovative but more specialized to neutral-atom co-design and relies on simulated circuit-level noise/decoding performance.
Paper 2 likely has higher impact due to its direct implications for scalable fault-tolerant quantum computing: it co-designs ultra-high-rate QLDPC codes with a concrete, timely hardware platform (reconfigurable neutral-atom arrays), provides implementability constraints, and reports strong circuit-level performance approaching teraquop targets at realistic physical error rates. This combination of theory, architecture-aware design, and performance evidence suggests near-term applicability and broad relevance to quantum hardware and error-correction communities. Paper 1 is highly rigorous and novel in complexity theory for tomography, but its applications are more indirect and narrower.
Paper 2 addresses one of the most critical bottlenecks in quantum computing—qubit overhead for error correction—by co-designing ultra-high-rate qLDPC codes with neutral atom hardware. Achieving encoding rates >1/2 with practical logical error rates approaching the teraquop regime represents a significant advance toward scalable fault-tolerant quantum computation. Its impact spans quantum coding theory, hardware architecture, and practical quantum computing. Paper 1, while useful, offers incremental performance improvements (2-4×) to classical simulation through memory optimization, which is a narrower engineering contribution.
Paper 1 demonstrates a fully integrated quantum processing unit combining custom cryogenic CMOS control, novel interconnects, and silicon qubits with order-of-magnitude improvements in exchange-only qubit performance, plus experimental validation with repetition and error-detecting codes. This experimental milestone on a commercially viable platform (silicon CMOS-compatible) has broader near-term impact on the quantum computing industry. Paper 2 presents important theoretical/simulation results on ultra-high-rate qLDPC codes for neutral atoms, but remains a proposal without experimental demonstration. The experimental integration achievement of Paper 1 addresses multiple critical engineering challenges simultaneously, giving it higher immediate scientific and practical impact.
Paper 1 likely has higher impact: it advances ultra-high-rate quantum LDPC error correction co-designed for reconfigurable neutral-atom hardware, addressing a central scalability bottleneck with strong methodological rigor (circuit-level noise model, concrete code parameters, very low logical error rates near teraquop). Its novelty (new structural conditions enabling >1/2 rate with implementability constraints) and broad relevance (fault-tolerant QC, codes, neutral-atom architectures) make it timely and cross-cutting. Paper 2 is more incremental within semi-quantum signatures and its practical deployment and rigorous security validation may be less clearly demonstrated from the abstract.