ExplorerQuantum ComputingQuantum Physics
Research PaperResearchia:202607.01068

Lazy-Move Compilation for Neutral-Atom Quantum Computers via a Buffer-Relay Fabric

Chen Huang

Abstract

Neutral atom quantum computing offers strong scalability and flexible qubit connectivity, but most existing compilation flows rely on reconfigurable atom arrays that physically shuttle qubit atoms during execution. Although this approach improves connectivity, it also introduces handoff errors, motional heating, and atom-loss risks that can degrade overall fidelity. We present BRIDGE, a Buffer-Relay Interconnect for Data-stable Gate Execution that co-designs a static, compiler-managed buffer-rel...

Submitted: July 1, 2026Subjects: Quantum Physics; Quantum Computing

Description / Details

Neutral atom quantum computing offers strong scalability and flexible qubit connectivity, but most existing compilation flows rely on reconfigurable atom arrays that physically shuttle qubit atoms during execution. Although this approach improves connectivity, it also introduces handoff errors, motional heating, and atom-loss risks that can degrade overall fidelity. We present BRIDGE, a Buffer-Relay Interconnect for Data-stable Gate Execution that co-designs a static, compiler-managed buffer-relay fabric with a lazy-move compiler that exploits it. BRIDGE targets an optimized, dual-species 2D interleaved atom array, using non-encoding ``buffer atoms'' to mediate long-range interactions in the fixed baseline and introducing limited data motion only for selected hotspots. By using calibrated heteronuclear and homonuclear Rydberg channels, BRIDGE realizes a static routing backbone in which data-buffer and buffer-buffer interactions are enabled while residual data-data crosstalk is suppressed. Across a 22-circuit matched benchmark suite re-estimated under a single shared error model, BRIDGE attains a geometric-mean \sim10×\times higher total fidelity than ZAP and \sim16×\times than Enola, together with \sim540×\times and \sim1000×\times lower circuit execution time, respectively, while reducing data-atom movement from thousands of transport events to zero.


Source: arXiv:2606.31833v1 - http://arxiv.org/abs/2606.31833v1 PDF: https://arxiv.org/pdf/2606.31833v1 Original Link: http://arxiv.org/abs/2606.31833v1

Please sign in to join the discussion.

No comments yet. Be the first to share your thoughts!

Access Paper
View Source PDF
Submission Info
Date:
Jul 1, 2026
Topic:
Quantum Computing
Area:
Quantum Physics
Comments:
0
Bookmark