Pith. sign in

REVIEW 6 cited by

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2411.05061 v1 pith:OU4CJN24 submitted 2024-11-07 quant-ph

Optimal Routing Protocols for Reconfigurable Atom Arrays

Nathan Constantinides , Ali Fahimniya , Dhruv Devulapalli , Dolev Bluvstein , Michael J. Gullans , J. V. Porto , Andrew M. Childs , Alexey V. Gorshkov This is my paper
classification quant-ph
keywords routingarraysatomstepsatomsneutralprocessingquantum
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Neutral atom arrays have emerged as a promising platform for both analog and digital quantum processing. Recently, devices capable of reconfiguring arrays during quantum processes have enabled new applications for these systems. Atom reconfiguration, or routing, is the core mechanism for programming circuits; optimizing this routing can increase processing speeds, reduce decoherence, and enable efficient implementations of highly non-local connections. In this work, we investigate routing models applicable to state-of-the-art neutral atom systems. With routing steps that can operate on multiple atoms in parallel, we prove that current designs require $\Omega(\sqrt N \log N)$ steps to perform certain permutations on 2D arrays with $N$ atoms and provide a protocol that achieves routing in $\mathcal O(\sqrt N \log N)$ steps for any permutation. We also propose a simple experimental upgrade and show that it would reduce the routing cost to $\Theta(\log N)$ steps.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 6 Pith papers

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

  1. Using Tanner Spectral Reduction to Improve Multi-Layer Optical Lattice Routing for Hypergraph-Product and Bivariate Bicycle qLDPC Codes

    quant-ph 2026-07 conditional novelty 6.0

    The HGP/LP Tanner graph spectral ratio equals (1+β_base)/2 and BB code spectra reduce to lm independent 2×2 SVDs, enabling a multi-layer AOL routing protocol with constant per-cycle depth.

  2. Permutation Routing on Ramanujan Hypergraphs with Applications to Neutral Atom Quantum Architectures

    quant-ph 2026-05 unverdicted novelty 6.0

    Ramanujan hypergraphs enable Θ(log N) permutation routing depth for neutral-atom quantum architectures via clique-expansion matchings, virtual overlays, and entanglement-assisted teleportation.

  3. Square-root Time Atom Reconfiguration Plan for Lattice-shaped Mobile Tweezers

    quant-ph 2026-04 conditional novelty 6.0

    A divide-and-conquer algorithm decomposes atom reconfiguration into three 1D shuttling tasks, enabling O(sqrt N) total transportation cost and reliable solutions via the Gale-Ryser theorem for arbitrary geometries.

  4. Block Permutation Routing on Ramanujan Hypergraphs for Fault-Tolerant Quantum Computing

    quant-ph 2026-05 unverdicted novelty 5.0

    Block permutation routing number on Ramanujan hypergraphs for surface code patches is Theta(d_C log N_L), with spectral analysis preserving key connectivity properties.

  5. Block Permutation Routing on Ramanujan Hypergraphs for Fault-Tolerant Quantum Computing

    quant-ph 2026-05 unverdicted novelty 5.0

    Block routing number on Ramanujan hypergraphs for surface code patches is Θ(d_C log N_L), with spectral analysis and integration into error correction protocols.

  6. Permutation Routing on Ramanujan Hypergraphs with Applications to Neutral Atom Quantum Architectures

    quant-ph 2026-05 unverdicted novelty 5.0

    Proves Θ(log N) routing number for Ramanujan (d,r)-regular hypergraphs via clique expansion matchings and develops applications to neutral atom qubit routing including virtual overlays, entanglement assistance, and hi...