Pith. sign in

REVIEW 3 cited by

qSIEVE: Efficient qLDPC Memory via Systolic Movement in Atom Arrays

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2311.16980 v3 pith:BNSTMGZR submitted 2023-11-28 quant-ph

classification quant-ph
keywords codesqldpcqsievemovementarchitecturearraysatomnon-local
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. PureMagic: A Dynamic Scheduler for Lattice Surgery

    quant-ph 2025-12 unverdicted novelty 6.0 of 10

    Repurposing ancilla qubits for both magic-state cultivation and routing improves lattice-surgery schedule efficiency by 19-223% over dedicated-bus routing in simulations.

  2. Louvre: Relaxing Hardware Requirements of Quantum LDPC Codes by Routing with Expanded Quantum Instruction Set

    quant-ph 2025-08 conditional novelty 6.0 of 10

    Louvre cuts the qubit connectivity degree of generalized bicycle codes by up to one-third using iSWAP-based routing, achieving comparable simulated logical error rates.

  3. Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors

    cs.IT 2025-08 unverdicted novelty 6.0 of 10

    New minimum-distance bounds for generalized bicycle codes are used to construct two degree-4 check families, [[d^2+1,2,d]] and [[d^2,2,d]], with surface-code-comparable simulated thresholds and a logical CNOT via relabeling.

Pith tools