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

• URL: http://arxiv.org/abs/2606.31833v1
• Date: Tue, 30 Jun 2026 15:38:42 GMT
• Title: Lazy-Move Compilation for Neutral-Atom Quantum Computers via a Buffer-Relay Fabric
• Abstract summary: BRIDGE is a Buffer-Relay Interconnect for Data-stable Gate Execution.<n>It co-designs a static, compiler-managed buffer-relay fabric with a lazy-move compiler that exploits it.<n>It attains a geometric-mean $sim$10$times$ higher total fidelity than ZAP and $sim$16$times$ than Enola.
• Score: 15.14867468741735
• License: http://creativecommons.org/licenses/by/4.0/
• 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-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 $\sim$10$\times$ higher total fidelity than ZAP and $\sim$16$\times$ than Enola, together with $\sim$540$\times$ and $\sim$1000$\times$ lower circuit execution time, respectively, while reducing data-atom movement from thousands of transport events to zero.

Related papers

• FluxBin: Flexible LUT-based Ultra-low-bit LLM Inference by Algorithm-Kernel Synergy [32.21687694159134]
  FluxBin is an algorithm that synerizes binary quantization with a highly optimized kernel.<n>FluxBin achieves up to $5.92times speedup and $10.19times energy savings.<n>This effectively enables the deployment of 70B-scale models on one single A100 bases with a $4times memory reduction.
  arXiv  Detail & Related papers  (2026-08-16T08:01:06Z)
• Fault-tolerant quantum computing with a microwave Cat Bus [11.420387564717707]
  Rydberg atoms are resonantly entangled through a microwave Cat Bus''<n>Cat Bus supports parallelized execution of one-to-many $mathrmCZn$ gates with exponentially suppressed crosstalk.<n>For fault-tolerant operation, we develop a hardware-aware scheduling scheme that exploits the native cat--atom $mathrmCZn$ gate.
  arXiv  Detail & Related papers  (2026-08-02T09:16:10Z)
• ARGON: A GNN-Empowered Compilation Framework for Scalable Neutral Atom Computing [16.598136367375407]
  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.
  arXiv  Detail & Related papers  (2026-07-23T11:30:05Z)
• DYNA-PRUNER: Input-Adaptive Data-Model Co-Pruning for Efficient and Scalable Spatio-Temporal Media Prediction [24.16400471463046]
  Dyna-Pruner is an end-to-end framework for input-dependent co-pruning of data and model structure.<n>A shared-importance synchronization mechanism generates coupled masks that prune redundant regions.<n>Experiments on WeatherBench, SEVIR, and TaxiBJ show seamless integration with CNN, RNN, and Transformer backbones.
  arXiv  Detail & Related papers  (2026-06-13T15:14:05Z)
• LoRe: Adaptive Interaction-Evaluation Routing with Per-Step Interaction Budgets for Iterative Graph Solvers [13.286251127911719]
  We introduce LoRe, a training-free, inference-time drop-in wrapper that enforces per-step interaction-evaluation budgeting.<n>Under fully inclusive end-to-end wall-clock accounting, LoRe substantially improves scalability on the Maximum Independent Set (MIS) problem.<n>LoRe achieves a $sim 15times$ speedup at $n=1000$ with a $44times$ memory reduction and competitive tour quality.
  arXiv  Detail & Related papers  (2026-05-27T19:00:57Z)
• Relay Buffer Independent Communication over Pooled HBM for Efficient MoE Inference on Ascend [14.495939227785074]
  Mixture-of-Experts (MoE) inference requires large-scale token exchange across devices.<n>This report presents a relay-buffer-free communication design for MoE inference acceleration on Ascend systems.
  arXiv  Detail & Related papers  (2026-05-07T11:41:18Z)
• Sequential vs. Simultaneous Entanglement Swapping under Optimal Link-Layer Control [1.8829359083448898]
  Connection-less, packet-switched quantum network architectures distribute entanglement across multi-hop paths through sequential entanglement swapping.<n>We present a proof-of-principle study at fixed chain length $n = 4$ in which each link is governed by a fixed reinforcement-learning policy.<n>Sequence swapping collapses to zero end-to-end deliveries below $T_cmathrmext/= 25$, and begins recovering at $T_cmathrmext/= 50$.
  arXiv  Detail & Related papers  (2026-05-05T17:59:22Z)
• The Recurrent Transformer: Greater Effective Depth and Efficient Decoding [48.9323408950142]
  We introduce the Recurrent Transformer, a simple architectural change where each layer attends to key-value pairs computed off its own activations.<n>We show that the architecture can emulate both (i) a conventional Transformer and (ii) token-to-gressive recurrent updates under mild assumptions.
  arXiv  Detail & Related papers  (2026-04-23T02:12:58Z)
• DexWorldModel: Causal Latent World Modeling towards Automated Learning of Embodied Tasks [54.32016216994156]
  We introduce the Causal Latent World Model (CLWM), which employs DINOv3 features as generative targets to disentangle interaction semantics from visual noise.<n>To overcome memory scaling, CLWM features a Dual-State Test-Time Training (TTT) Memory that guarantees a strict $mathcalO(1)$ footprint for long-horizon tasks.<n>We present EmbodiChain, an online framework that establishes the Efficiency Law by injecting an infinite flow of physics-grounded trajectories during training.
  arXiv  Detail & Related papers  (2026-04-13T03:19:36Z)
• Time Is All It Takes: Spike-Retiming Attacks on Event-Driven Spiking Neural Networks [87.16809558673403]
  Spiking neural networks (SNNs) compute with discrete spikes and exploit temporal structure.<n>We study a timing-only adversary that retimes existing spikes while preserving spike counts and amplitudes in event-driven SNNs.
  arXiv  Detail & Related papers  (2026-02-03T09:06:53Z)
• ATLAS: Efficient Atom Rearrangement for Defect-Free Neutral-Atom Quantum Arrays Under Transport Loss [46.043413607980845]
  Neutral-atom quantum computers encode qubits in individually trapped atoms arranged in optical lattices.<n>Algorithm converts a randomly loaded $W times W$ lattice into a defect-free $L times L$ subarray.<n>Algorithm achieves sublinear move scaling and linear growth of required initial size with target dimension.
  arXiv  Detail & Related papers  (2025-11-20T12:32:35Z)
• XQuant: Breaking the Memory Wall for LLM Inference with KV Cache Rematerialization [58.92253769255316]
  LLM inference is challenging due to substantial memory footprint and bandwidth requirements.<n>XQuant exploits the rapidly increasing compute capabilities of hardware platforms to eliminate the memory bottleneck.<n>XQuant-CL exploits the cross-layer similarity in the X embeddings for extreme compression.
  arXiv  Detail & Related papers  (2025-08-14T06:52:38Z)
• Optimal Connectivity from Idle Qubit residual coupling Cross-Talks in a Cavity Mediated Entangling Gate [0.0]
  We investigate the effect of high processor connectivity on average two qubit gate fidelity in a cavity based architecture with tunable coupling.<n>We quantify the cross-talk errors from transverse residual couplings and show that they scale as $nm2$.<n>We predict that the maximum number of qubits allowed by $E_mathrmthr$ scales as $n propto E_mathrmthr/m2$.
  arXiv  Detail & Related papers  (2025-03-10T15:36:10Z)
• HiRE: High Recall Approximate Top-$k$ Estimation for Efficient LLM Inference [68.59839755875252]
  HiRE comprises of two novel components: (i) a compression scheme to cheaply predict top-$k$ rows/columns with high recall, followed by full computation restricted to the predicted subset, and (ii) DA-TOP-$k$: an efficient multi-device approximate top-$k$ operator. We demonstrate that on a one billion parameter model, HiRE applied to both the softmax as well as feedforward layers, achieves almost matching pretraining and downstream accuracy, and speeds up inference latency by $1.47times$ on a single TPUv5e device.
  arXiv  Detail & Related papers  (2024-02-14T18:04:36Z)

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.