{
  "abstract": "Neutral-atom quantum computers commonly connect distant qubits by transporting atoms, incurring trap-handover errors, heating, and atom loss. We present BRIDGE (Buffer-Relay Interconnect for Data-stable Gate Execution), a hardware--software co-design that connects stationary data atoms through a fixed, second-species buffer network. Short buffer chains mediate remote controlled-Z gates and return to their initial states after each operation. BRIDGE-F combines relay routing with buffer-mediated SWAPs to relocate quantum states without transporting atoms. BRIDGE-H additionally permits data-atom transport when its full modeled cost is offset by higher survival-weighted fidelity. Across 21 circuits, BRIDGE-F exceeds ZAP and Enola in modeled survival-weighted fidelity, with geometric-mean ratios of $2.1\\times$ and $38\\times$ and medians of $1.3\\times$ and $3.7\\times$. Modeled execution latency is lower by factors of approximately $500$ and $1{,}350$, respectively, with circuit single-qubit costs excluded and relay/SWAP Hadamards included. On the same fabric, BRIDGE-F matches or exceeds SABRE-based routing on 17 circuits. Rescoring nominal plans with relay-module error equal to direct-CZ error preserves the advantage over ZAP across all 21 circuits, although recompilation can underperform on QFT. These results identify stationary buffer-mediated connectivity as a promising alternative to repeated atom transport under the stated physical assumptions.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2606.31833",
  "author_total": 8,
  "authors": [
    {
      "name": "Chen Huang"
    },
    {
      "name": "Jingbo Wang"
    },
    {
      "name": "Zhemin Zhang"
    },
    {
      "name": "Ming Zhong"
    },
    {
      "name": "Zhuo Fu"
    },
    {
      "name": "Zhiding Liang"
    },
    {
      "name": "Yuan Sun"
    },
    {
      "name": "Dong E. Liu"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/5bn221abvhg89.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2606.31833",
  "fulltext_url": null,
  "id": "5bn221abvhg89",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2606.31833",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.AR"
    ],
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7166805473",
  "pdf_url": "https://arxiv.org/pdf/2606.31833",
  "pmcid": null,
  "pmid": null,
  "published": "2026-11-05",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/5bn221abvhg89.ris",
  "sources": [
    {
      "first_seen": "2026-11-06T18:21:30Z",
      "native_id": "2606.31833",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2606.31833"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "BRIDGE: Lazy-Move Compilation for Dual-Species Neutral-Atom Quantum Computers",
  "title_text": "BRIDGE: Lazy-Move Compilation for Dual-Species Neutral-Atom Quantum Computers",
  "type": "preprint",
  "updated_at": "2026-11-09T00:20:33Z",
  "url": "https://research.draconitic.com/paper/5bn221abvhg89",
  "venue": "arXiv",
  "versions": []
}