qSIEVE: Efficient qLDPC Memory via Systolic Movement in Atom Arrays
read the original abstract
As quantum machines have scaled up in their number of qubits, significant research has turned towards increasing their fidelity with quantum error correction codes. Although promising results have been shown with the surface code, which only requires near-neighbor connections between qubits, the high qubit overhead of such local codes promises to be problematic. Consequently, recent work has explored non-local quantum LDPC (qLDPC) codes, which have good asymptotic encoding rates. Despite theoretical progress, hardware implementations of these codes has been a longstanding challenge. At the experimental level, demonstrations of movement based communication on atom arrays suggest this is a powerful new primitive to achieve non-local connectivity. Leveraging this, we present a protocol for implementing non-local qLDPC codes in hardware. Our protocol, qSIEVE, is a co-design of such codes with movement in atom arrays. qSIEVE defines a restricted family of qLDPC codes that can be implemented efficiently with systolic movement. We then quantify the utility of qSIEVE in the context of a complete fault tolerant architecture. We compare the cost of implementing benchmark programs in a standard, surface code only architecture and a mixed architecture where data is stored in qLDPC memory with qSIEVE and loaded to surface codes for computation.
This paper has not been read by Pith yet.
Forward citations
Cited by 8 Pith papers
-
Magic tricycles: Efficient magic state generation with finite block-length quantum LDPC codes
Tricycle codes generalize bicycle codes to three homological dimensions, enabling constant-depth CCZ circuits and single-shot magic state generation with circuit-level thresholds above 0.5% and low error rates at bloc...
-
Placing and routing quantum LDPC codes in multilayer superconducting hardware
HAL heuristic produces explicit layouts for bivariate bicycle, tile, radial, and Tanner qLDPC codes on multilayer superconducting hardware, demonstrating that open-boundary designs reduce hardware demands with only mo...
-
CAbLECAR: efficiently scheduling QLDPC codes on a tileable spin qubit chip with shuttling
CAbLECAR provides a robotics-inspired shuttle scheduler that enables QLDPC codes on tileable spin-qubit hardware, yielding up to 86% faster schedules and orders-of-magnitude gains in encoding efficiency and logical er...
-
Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures
A programmable 2D toric oscillator network enables efficient routing for bivariate bicycle LDPC codes, reducing long-range couplers to O(sqrt(n)) and achieving 3.06% logical error rate per cycle in simulations for the...
-
Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays
A family of quantum LDPC codes with encoding rates exceeding 1/2 achieves logical error rates of 10^{-13} per round on atom arrays under 0.1% circuit noise using hierarchical decoding.
-
PureMagic: A Dynamic Scheduler for Lattice Surgery
PureMagic dynamically schedules magic state cultivation by repurposing ancilla patches for routing and cultivation in surface codes, reporting 40-150% efficiency gains and up to 15x improvement over DASCOT on 29 benchmarks.
-
Benchmarking fault-tolerant quantum computing hardware via QLOPS
Proposes QLOPS as an integrated benchmarking metric for FTQC hardware that factors in code rates, decoder throughput, latency, and accuracy, illustrated via RSA-2048 factoring resource estimates.
-
Transversal Fault Tolerant Distributed Quantum Computing Operations
Simulations show non-local CNOT achieves up to 10x lower logical error than teleportation and distributed qLDPC needs d≈11 at p=10^{-4} or d≈29 at p=10^{-3} (with p_ebit=10p) for <10^{-12} error.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.