ARGON: A GNN-Empowered Compilation Framework for Scalable Neutral Atom Computing

• URL: http://arxiv.org/abs/2607.21216v1
• Date: Thu, 23 Jul 2026 11:30:05 GMT
• Title: ARGON: A GNN-Empowered Compilation Framework for Scalable Neutral Atom Computing
• Abstract summary: We propose ARGON, a scalable compilation framework for atom processors.<n>Our key novelty is offloading static geometric conflict resolution to an offline phase.<n>We show ARGON completes compilation in under 10 seconds, delivering up to a >104x and 600x average speedup over state-of-the-art baselines.
• Score: 16.598136367375407
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Neutral atom quantum systems offer a promising pathway to large-scale quantum computing due to high qubit uniformity and flexible connectivity. To exploit this architecture, compilers must coordinate dynamic atom transport alongside highly parallel entangling gates. As circuits scale, the interplay between these operations becomes a system bottleneck, introducing denser logical interactions and longer temporal dependencies. Compilers must simultaneously satisfy rigid spatial constraints and complex movement schedules. Existing joint spatiotemporal compilation methods face an exponentially expanding search space, incurring substantial overheads or compromising fidelity as circuit size grows. In this work, we propose ARGON, a scalable compilation framework that introduces a spatiotemporal decoupling paradigm for neutral atom processors. Our key novelty is offloading static geometric conflict resolution to an offline phase, precomputing a library of hardware-certified, high-parallelism spatial layouts. To guide temporal routing, we deploy a Graph Neural Network (GNN) predictor to evaluate candidate layouts against deep temporal horizons, proactively evading downstream kinematic bottlenecks. Finally, a heuristic router translates the selected sequence into collision-free physical transport. Evaluations show ARGON completes compilation in under 10 seconds, delivering up to a >10^4x and 600x average speedup over state-of-the-art baselines. ARGON also minimizes routing decoherence and reduces Rydberg stages, improving execution fidelity by up to 10^2x on dense circuits.

Related papers

• To Scale Up or To Scale Out: Evaluating Space-Time Costs of Compiled Logical Circuits on Modular Superconducting Quantum Processors [0.6024602799136752]
  Two primary strategies lead this effort: chiplet-based scaling and distributed architectures.<n>We introduce a quantitative stress test measuring the execution cost of a dense workload of logical entangling operations.<n>We find that distributed architectures incur an up to exponential space-time performance penalty compared to an effectively monolithic architecture.
  arXiv  Detail & Related papers  (2026-08-20T18:00:12Z)
• Fault-tolerant quantum computation with static atomic buses [0.0]
  Efficient quantum error correction and fault-tolerant quantum computing require high-fidelity long-range connectivity.<n>Here, we introduce a neutral-atom architecture on static atomic buses, in which mediator atoms enable long-range operations without qubit transport.<n>The architecture achieves logical gate times of approximately 100 us and quantum-error- cycle distances of about 1 ms for code d12.
  arXiv  Detail & Related papers  (2026-07-02T22:34:55Z)
• Centralizing Task-based Approach to Quantum Network Control [71.48385446560893]
  layered architectures impose stringent design and timing constraints on quantum networks.<n>We simulate a resource-centric, task-based approach to quantum network control by utilizing a centralized controller.
  arXiv  Detail & Related papers  (2026-05-05T03:57:17Z)
• A Scalable Distributed Quantum Optimization Framework via Factor Graph Paradigm [46.08923284345648]
  We introduce a structure-aware framework for distributed quantum optimization.<n>We find that for a search space of size $N$, our framework achieves $O(sqrtN)$ query complexity up to processors and separator dependent factors.<n>We show that structure-aware decomposition delivers a practical path to scalable distributed quantum optimization on quantum networks.
  arXiv  Detail & Related papers  (2026-03-08T15:15:52Z)
• Taming the Tail: NoI Topology Synthesis for Mixed DL Workloads on Chiplet-Based Accelerators [8.493759841403682]
  Heterogeneous chiplet-based systems improve scaling by disag-gregating CPUs/GPUs and emerging technologies (HBM/DRAM)<n>However this on-package disaggregation introduces a latency inNetwork-on-Interposer(NoI)
  arXiv  Detail & Related papers  (2025-10-28T06:36:44Z)
• Protocol Models: Scaling Decentralized Training with Communication-Efficient Model Parallelism [59.79227116582264]
  Scaling models has led to significant advancements in deep learning, but training these models in decentralized settings remains challenging.<n>We propose a novel compression algorithm that compresses both forward and backward passes, enabling up to 99% compression with no convergence degradation.
  arXiv  Detail & Related papers  (2025-06-02T02:19:22Z)
• FusionLLM: A Decentralized LLM Training System on Geo-distributed GPUs with Adaptive Compression [55.992528247880685]
  Decentralized training faces significant challenges regarding system design and efficiency. We present FusionLLM, a decentralized training system designed and implemented for training large deep neural networks (DNNs) We show that our system and method can achieve 1.45 - 9.39x speedup compared to baseline methods while ensuring convergence.
  arXiv  Detail & Related papers  (2024-10-16T16:13:19Z)
• Arctic: A Field Programmable Quantum Array Scheduling Technique [0.0]
  I present the first compiler pass designed to optimize reconfigurable coupling in zoned neutral atom architectures. I approach qubit mapping and movement scheduling as a max-cut and layered cross-minimization problem. I compare the method across various algorithms sourced from Supermarq and Qasmbench.
  arXiv  Detail & Related papers  (2024-05-10T01:56:01Z)
• Parallelized Spatiotemporal Binding [47.67393266882402]
  We introduce Parallelizable Spatiotemporal Binder or PSB, the first temporally-parallelizable slot learning architecture for sequential inputs. Unlike conventional RNN-based approaches, PSB produces object-centric representations, known as slots, for all time-steps in parallel. Compared to the state-of-the-art, our architecture demonstrates stable training on longer sequences, achieves parallelization that results in a 60% increase in training speed, and yields performance that is on par with or better on unsupervised 2D and 3D object-centric scene decomposition and understanding.
  arXiv  Detail & Related papers  (2024-02-26T23:16:34Z)
• An Architecture for Improved Surface Code Connectivity in Neutral Atoms [3.3186866268167146]
  We address quantum computers made from neutral atom arrays to design a surface code architecture that translates the hardware's physical connectivity into a higher logical connectivity. Compared to standard lattice surgery operations, this reduces both the overall qubit footprint and execution time, lowering the spacetime overhead needed for small-scale QEC circuits. We look at using physical atom movement schemes and propose interleaved lattice surgery which allows an all-to-all connectivity between qubits in adjacent interleaved groups, creating a higher connectivity routing space for large-scale circuits.
  arXiv  Detail & Related papers  (2023-09-24T00:10:47Z)
• An Adaptive Device-Edge Co-Inference Framework Based on Soft Actor-Critic [72.35307086274912]
  High-dimension parameter model and large-scale mathematical calculation restrict execution efficiency, especially for Internet of Things (IoT) devices. We propose a new Deep Reinforcement Learning (DRL)-Soft Actor Critic for discrete (SAC-d), which generates the emphexit point, emphexit point, and emphcompressing bits by soft policy iterations. Based on the latency and accuracy aware reward design, such an computation can well adapt to the complex environment like dynamic wireless channel and arbitrary processing, and is capable of supporting the 5G URL
  arXiv  Detail & Related papers  (2022-01-09T09:31:50Z)
• Time-Sliced Quantum Circuit Partitioning for Modular Architectures [67.85032071273537]
  Current quantum computer designs will not scale. To scale beyond small prototypes, quantum architectures will likely adopt a modular approach with clusters of tightly connected quantum bits and sparser connections between clusters. We exploit this clustering and the statically-known control flow of quantum programs to create tractable partitionings which map quantum circuits to modular physical machines one time slice at a time.
  arXiv  Detail & Related papers  (2020-05-25T17:58:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.