A Neutral-Atom Quantum Compiler with Application-Specific Layout and Hub-Assisted Shuttling

• URL: http://arxiv.org/abs/2605.29964v1
• Date: Thu, 28 May 2026 14:03:05 GMT
• Title: A Neutral-Atom Quantum Compiler with Application-Specific Layout and Hub-Assisted Shuttling
• Abstract summary: NISQ circuits are constrained by a finite interaction range and a minimum separation between simultaneously addressable sites.<n>We address this with hub traps, a small number of dynamically placed empty traps that serve as transit waypoints.<n>We evaluate the compiler on seventeen benchmarks using analytic estimates of execution time and a per-layer fidelity proxy.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Compiling arbitrary-connectivity NISQ circuits onto monolithic single-zone neutral-atom devices is constrained by a finite interaction range and a minimum separation between simultaneously addressable sites. Under the minimum-separation constraint, the SWAP-only configuration of our pipeline does not return a schedule within a practical time budget on a range of circuits, including circuits as small as nine qubits. We address this with hub traps, a small number of dynamically placed empty traps that serve as transit waypoints, together with a per-gate rule that chooses between SWAP-based routing and hub-mediated shuttling. We evaluate the compiler on seventeen benchmarks using analytic estimates of execution time and a per-layer fidelity proxy, comparing against a placement-matched baseline and against ablations of our own pipeline. Hub traps make these otherwise-unsolved circuits compile in seconds to minutes and remove SWAP gates entirely on every completed circuit, so their role is to enable routing rather than only to optimize fidelity. The benefit is concentrated on routing-dominated circuits and is absent on routing-free ones, which we separate by the structure of the interaction graph. On the most routing-dominated circuit the fidelity proxy improves by up to three orders of magnitude over the placement-matched baseline. The gain comes primarily from eliminating SWAP overhead, as the absolute fidelities there remain low.

Related papers

• Utility-Based Path Selection and Configuration in Quantum Networks via Layered Shortest Paths [20.986889484035093]
  A path in a quantum network is a chain of repeaters that distributes entanglement between two users.<n>We show how a path's performance depends jointly on its route and its per-link settings.<n>A single run returns the full rate fidelity frontier, from which the path maximizing any nondecreasing utility function can be selected.
  arXiv  Detail & Related papers  (2026-09-14T18:30:46Z)
• CRISP: Cliff-awaRe Input-adaptive Sparse Prefilling with Structural-Mass-Motivated Routing [90.63350360476294]
  We present CRISP (Cliff-awaRe Input-adaptive Sparse Prefilling), which identifies and addresses two structural challenges in this dynamic routing paradigm.<n>We show that the routing decision can be read directly off the structure of the proxy attention map.<n>We formalize the post-softmax mass cliff and demonstrate theoretically that strictly cumulative coverage thresholds accumulate O(n) background noise at long contexts.
  arXiv  Detail & Related papers  (2026-09-01T22:49:46Z)
• Bounded-depth spacetime lattice surgery for resource-efficient fault-tolerant quantum computation [0.22166578153935787]
  Fault-tolerant quantum computing based on lattice surgery requires place-and-route compilation with low spacetime overhead.<n>We introduce double-slice routing, a constant-depth spacetime-routing method that uses two consecutive time slices.<n>We numerically benchmark the resulting compiler on Hamiltonian-simulation workloads to show that double-slice routing reduces compilation cost by up to a factor of 2.4 over a single-slice baseline.
  arXiv  Detail & Related papers  (2026-06-19T08:03:26Z)
• CR^2: Cost-Aware Risk-Controlled Routing for Wireless Device-Edge LLM Inference [52.849509991178884]
  Large language models (LLMs) move from centralized clouds to mobile edge environments.<n> query-level routing between lightweight on-device models and stronger edge models provides a flexible mechanism to navigate this trade-off.<n>Existing routers are designed for centralized cloud settings and optimize token-level costs, failing to capture the dynamic latency and energy overheads in wireless edge deployments.
  arXiv  Detail & Related papers  (2026-05-12T11:50:15Z)
• Stochastic Multipath Routing for High-Throughput Entanglement Distribution in Quantum Repeater Networks [6.036769600366487]
  Quantum repeater networks distribute entanglement over lossy links while many users share a limited pool of entangled pairs.<n>Most existing routing schemes either always use a single best path or rely on global optimizations that are hard to run in real time.<n>Here we propose and analyze a simple alternative: a multipath rule in which each entanglement request is sent at random along one of several edge-disjoint paths.
  arXiv  Detail & Related papers  (2026-03-26T15:36:08Z)
• Improving and benchmarking NISQ qubit routers [0.0]
  We benchmark various routing techniques considering random quantum circuits on one-dimensional and square lattice connectivities.<n>We introduce circuit fidelity as a comprehensive metric that captures the effects of SWAP and circuit depth overheads.
  arXiv  Detail & Related papers  (2025-02-06T09:31:51Z)
• SCoTT: Strategic Chain-of-Thought Tasking for Wireless-Aware Robot Navigation in Digital Twins [78.53885607559958]
  We propose SCoTT, a wireless-aware path planning framework.<n>We show that SCoTT achieves path gains within 2% of DP-WA* while consistently generating shorter trajectories.<n>We also show the practical viability of our approach by deploying SCoTT as a ROS node within Gazebo simulations.
  arXiv  Detail & Related papers  (2024-11-27T10:45:49Z)
• Improving Qubit Routing by Using Entanglement Mediated Remote Gates [1.9299285312415735]
  Near-term quantum computers often have connectivity constraints, on which pairs of qubits in the device can interact. We develop a method to optimize the routing of circuits with both standard gates and EPR mediated remote controlled-NOT gates. We demonstrate that EPR-mediated operations can substantially reduce the total number of gates and depths of compiled circuits.
  arXiv  Detail & Related papers  (2023-09-22T18:51:36Z)
• Fidelity-Guarantee Entanglement Routing in Quantum Networks [64.49733801962198]
  Entanglement routing establishes remote entanglement connection between two arbitrary nodes. We propose purification-enabled entanglement routing designs to provide fidelity guarantee for multiple Source-Destination (SD) pairs in quantum networks.
  arXiv  Detail & Related papers  (2021-11-15T14:07:22Z)
• Unit-Modulus Wireless Federated Learning Via Penalty Alternating Minimization [64.76619508293966]
  Wireless federated learning (FL) is an emerging machine learning paradigm that trains a global parametric model from distributed datasets via wireless communications. This paper proposes a wireless FL framework, which uploads local model parameters and computes global model parameters via wireless communications.
  arXiv  Detail & Related papers  (2021-08-31T08:19:54Z)
• Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifiers [112.23981192818721]
  We propose to use backward mode linear relaxation based analysis (LiRPA) to replace Linear Programming (LP) during the BaB process. Unlike LP, LiRPA when applied naively can produce much weaker bounds and even cannot check certain conflicts of sub-domains during splitting. We demonstrate an order of magnitude speedup compared to existing LP-based approaches.
  arXiv  Detail & Related papers  (2020-11-27T16:42:12Z)

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.