Pith. sign in

REVIEW 3 cited by

Constant-Overhead Fault-Tolerant Quantum Computation with Reconfigurable 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 2308.08648 v1 pith:5K33FAJ5 submitted 2023-08-16 quant-ph

classification quant-ph
keywords codesquantumphysicalqldpcqubitsatomcodefault-tolerant
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Quantum low-density parity-check (qLDPC) codes can achieve high encoding rates and good code distance scaling, providing a promising route to low-overhead fault-tolerant quantum computing. However, the long-range connectivity required to implement such codes makes their physical realization challenging. Here, we propose a hardware-efficient scheme to perform fault-tolerant quantum computation with high-rate qLDPC codes on reconfigurable atom arrays, directly compatible with recently demonstrated experimental capabilities. Our approach utilizes the product structure inherent in many qLDPC codes to implement the non-local syndrome extraction circuit via atom rearrangement, resulting in effectively constant overhead in practically relevant regimes. We prove the fault tolerance of these protocols, perform circuit-level simulations of memory and logical operations with these codes, and find that our qLDPC-based architecture starts to outperform the surface code with as few as several hundred physical qubits at a realistic physical error rate of $10^{-3}$. We further find that less than 3000 physical qubits are sufficient to obtain over an order of magnitude qubit savings compared to the surface code, and quantum algorithms involving thousands of logical qubits can be performed using less than $10^5$ physical qubits. Our work paves the way for explorations of low-overhead quantum computing with qLDPC codes at a practical scale, based on current experimental technologies.

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. Genuine Multipartite Entanglement between Logical Qubits via Cross-Code Lattice Surgery

    quant-ph 2026-07 accept novelty 7.5 of 10

    Cross-code lattice surgery between surface and 3D colour codes yields certified logical GHZ and |CCZ> GME plus arbitrary logical rotations on a trapped-ion processor.

  2. A simple universal routing strategy for reducing the connectivity requirements of quantum LDPC codes

    quant-ph 2025-08 conditional novelty 6.0 of 10

    Routing syndrome information through opposite-type ancilla qubits reduces long-range connectivity of quantum LDPC codes (up to 50% for BB codes) at the cost of roughly doubled circuit depth, with circuit-level distanc...

  3. Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning

    quant-ph 2025-01 conditional novelty 6.0 of 10

    Searching over edge-swap variations of hypergraph product codes with an erasure-decoding cost function yields codes that beat Progressive Edge-Growth codes on erasure and bit-flip channels.

Pith tools