BRIDGE: Lazy-Move Compilation for Dual-Species Neutral-Atom Quantum Computers
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× and 38× and medians of 1.3× and 3.7×. 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.
Related
- Computational Complexity of Clifford Template Compilation: Are Quantum Computers Useful for Compiling Quantum Circuits?
- General circuit mapping algorithm for neutral atom quantum computers
- Defect-Aware Parallel Atom Reloading Protocol for Neutral-Atom Quantum Computers
- Quantum WalkScore: Benchmarking Quantum Computers on the Graph Nodefinding Problem
- Local thermalization of SU(2) lattice gauge fields on quantum computers
BibTeX
@misc{huang2026bridge,
title = {{BRIDGE: Lazy-Move Compilation for Dual-Species Neutral-Atom Quantum Computers}},
author = {Chen Huang and Jingbo Wang and Zhemin Zhang and Ming Zhong and Zhuo Fu and Zhiding Liang and Yuan Sun and Dong E. Liu},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2606.31833},
eprint = {2606.31833},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2606.31833},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - BRIDGE: Lazy-Move Compilation for Dual-Species Neutral-Atom Quantum Computers
AU - Chen Huang
AU - Jingbo Wang
AU - Zhemin Zhang
AU - Ming Zhong
AU - Zhuo Fu
AU - Zhiding Liang
AU - Yuan Sun
AU - Dong E. Liu
PY - 2026
DA - 2026/11/05
PB - arXiv
DO - 10.48550/arxiv.2606.31833
UR - https://arxiv.org/abs/2606.31833
AB - 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× and 38× and medians of 1.3× and 3.7×. 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.
ER -