Adaptive Parallelism-Aware Qubit Routing for Ion Trap QCCD Architectures

• URL: http://arxiv.org/abs/2603.19969v1
• Date: Fri, 20 Mar 2026 14:11:29 GMT
• Title: Adaptive Parallelism-Aware Qubit Routing for Ion Trap QCCD Architectures
• Abstract summary: Trapped-ion Quantum Charge-Coupled Device (QCCD) architectures promise scalability through interconnected trap zones and dynamic ion transport.<n>We introduce a routing strategy that turns this challenge into an advantage by exploiting operational parallelism across traps.<n>Across a broad suite of benchmarks and QCCD layouts, the method consistently reduces ion-transport overhead and improves execution fidelity, outperforming state-of-the-art routing techniques.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Trapped-ion Quantum Charge-Coupled Device (QCCD) architectures promise scalability through interconnected trap zones and dynamic ion transport; however, this transport capability creates a complex compilation challenge: how to move qubits efficiently without degrading fidelity. We introduce a routing strategy that turns this challenge into an advantage by exploiting operational parallelism across traps while adapting to both algorithmic structure and device topology through a configurable multi-parameter scoring mechanism. Across a broad suite of benchmarks and QCCD layouts, the method consistently reduces ion-transport overhead and improves execution fidelity, outperforming state-of-the-art routing techniques. These results highlight that explicitly balancing movement overhead and execution parallelism under architectural constraints is key to unlocking the full potential of modular trapped-ion quantum processors.

Related papers

• Accelerating Unified Multimodal Models with Core-Expansion Routing and Unified Computation Scheduling [61.28599393707943]
  Unified multimodal models jointly support understanding and generation, but incur substantial redundant computation across tokens, layers, and generation timesteps.<n>We propose a task-shared core scorer and progress-conditioned generation expansions, optimized through generation decomposition and cross-task core alignment.<n> Experiments on two representative UMM architectures demonstrate consistent quality--efficiency improvements across both tasks, retaining 98.03% of dense understanding performance with a 1.93times$ end-to-end inference speedup.
  arXiv  Detail & Related papers  (2026-08-29T14:27:55Z)
• Architecture-Aware Reinforcement Learning for Communication-Efficient Distributed Quantum Circuit Compilation [16.380589534840862]
  Distributed quantum computing provides a scalable route for executing quantum circuits beyond the capacity limits of a single quantum processing unit.<n>This paper presents an architecture-aware reinforcement-learning framework that formulates distributed quantum compilation as a constrained Markov Decision Process.
  arXiv  Detail & Related papers  (2026-08-07T07:25:18Z)
• Fixed-Point Reasoners: Stable and Adaptive Deep Looped Transformers [72.66457738838515]
  We propose a Transformer-based Fixed-Point Reasoning Model that uses fixed-point convergence as an end-to-end halting mechanism in a looped architecture.<n>FPRM is effective on common reasoning benchmarks, namely Sudoku, Maze, state-tracking, and ARC-AGI.
  arXiv  Detail & Related papers  (2026-06-16T17:36:33Z)
• C-Phase-Aware Compilation for Efficient Fault-Tolerant Quantum Execution [1.635939418192339]
  This work presents a microarchitecture-aware compilation approach that integrates algorithmic structure directly with lattice surgery execution.<n>We design a dynamic, event-driven scheduling strategy that accurately models spatial layout and routing constraints.<n>This approach substantially reduces idle resources and achieves up to a 59.7$times$ reduction in execution time compared to standard baselines.
  arXiv  Detail & Related papers  (2026-05-13T19:03:18Z)
• Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization [0.6479760042717823]
  We present a compilation framework built around the position graph abstraction, a unified representation of executable locations, movement paths, and routing constraints.<n>Using this abstraction, we accelerate the SWAP-based BidiREctional search (SABRE) by implementing relative move scoring.<n>Our results show that combining an architecture-aware abstraction with memoized evaluation yields a practical and effective path toward scalable qubit mapping and routing.
  arXiv  Detail & Related papers  (2026-05-10T00:35:23Z)
• Learning Reactive Dexterous Grasping via Hierarchical Task-Space RL Planning and Joint-Space QP Control [50.28263951510334]
  We propose a hybrid hierarchical control framework for reactive dexterous grasping.<n>The proposed framework explicitly decouples high-level spatial intent from low-level joint execution.<n>We extensively validate the proposed framework through a rigorous simulation-to-reality pipeline.
  arXiv  Detail & Related papers  (2026-05-05T04:49:38Z)
• AdaFuse: Accelerating Dynamic Adapter Inference via Token-Level Pre-Gating and Fused Kernel Optimization [84.25316984309725]
  Integration of dynamic, sparse structures with parameter-efficient adapters (e.g., LoRA) is a powerful technique for enhancing Large Language Models (LLMs)<n>Despite minimal increases in computational load, the computation latency often skyrockets, leading to decoding speeds slowing by over 2.5 times.<n>AdaFuse is a framework built on a tight co-design between the algorithm and the underlying hardware system to enable efficient dynamic adapter execution.
  arXiv  Detail & Related papers  (2026-03-12T12:46:42Z)
• 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)
• Rethinking Transferable Adversarial Attacks on Point Clouds from a Compact Subspace Perspective [55.919842734983156]
  CoSA is a transferable attack framework that operates within a shared low-dimensional semantic space.<n>CoSA consistently outperforms state-of-the-art transferable attacks.
  arXiv  Detail & Related papers  (2026-01-30T15:48:11Z)
• QoS-Aware Hierarchical Reinforcement Learning for Joint Link Selection and Trajectory Optimization in SAGIN-Supported UAV Mobility Management [52.15690855486153]
  A space-air-ground integrated network (SAGIN) has emerged as an essential architecture for enabling ubiquitous UAV connectivity.<n>This paper formulates UAV mobility management in SAGIN as a constrained multiobjective joint optimization problem.
  arXiv  Detail & Related papers  (2025-12-17T06:22:46Z)
• Optimal Compilation Strategies for QFT Circuits in Neutral-Atom Quantum Computing [10.15254069964668]
  Neutral-atom quantum computing (NAQC) offers distinct advantages such as dynamic qubit reconfigurability, long coherence times, and high gate fidelities.<n>This paper introduces optimal compilation strategies tailored to QFT circuits and NAQC systems, addressing these challenges for both linear and grid-like architectures.
  arXiv  Detail & Related papers  (2025-06-18T03:34:03Z)
• Adaptive Job Scheduling in Quantum Clouds Using Reinforcement Learning [1.0542466736167886]
  Current quantum systems face critical bottlenecks, including limited qubit counts, brief coherence intervals, and high susceptibility to errors.<n>We introduce a simulation-based tool that supports distributed scheduling and concurrent execution of quantum jobs on networked QPUs connected via real-time classical channels.
  arXiv  Detail & Related papers  (2025-06-12T16:54:19Z)
• Exploring operation parallelism vs. ion movement in ion-trapped QCCD architectures [0.0]
  Ion-trapped Quantum Charge-Coupled Device (QCCD) architectures have emerged as a promising alternative to scale single-trap devices.<n>This paper explores the trade-off between the parallelism of operations and fidelity loss due to movement overhead.
  arXiv  Detail & Related papers  (2025-02-06T16:12:31Z)
• AsCAN: Asymmetric Convolution-Attention Networks for Efficient Recognition and Generation [48.82264764771652]
  We introduce AsCAN -- a hybrid architecture, combining both convolutional and transformer blocks. AsCAN supports a variety of tasks: recognition, segmentation, class-conditional image generation. We then scale the same architecture to solve a large-scale text-to-image task and show state-of-the-art performance.
  arXiv  Detail & Related papers  (2024-11-07T18:43:17Z)
• Scaling and assigning resources on ion trap QCCD architectures [0.0]
  Ion trap technologies have earned significant attention as potential candidates for quantum information processing. We propose a novel approach for initial qubit placement, demonstrating enhancements of up to 50% compared to prior methods.
  arXiv  Detail & Related papers  (2024-08-01T01:35:55Z)
• Spatio-Temporal Characterization of Qubit Routing in Connectivity-Constrained Quantum Processors [1.3230570759583702]
  This work presents a comparative analysis of the resulting communication overhead among three processor topologies. According to performance metrics of communication-to-computation ratio, mean qubit hotspotness, and temporal burstiness, the square lattice layout is favourable for quantum computer architectures at a scale.
  arXiv  Detail & Related papers  (2024-02-01T10:16:04Z)
• Optimization-Inspired Cross-Attention Transformer for Compressive Sensing [45.672646799969215]
  Deep unfolding network (DUN) with good interpretability and high performance has attracted growing attention in compressive sensing. Existing DUNs often improve the visual quality at the price of a large number of parameters and have the problem of feature information loss during iteration. We propose an Optimization-inspired Cross-attention Transformer ( OCT) module as an iterative process, leading to a lightweight OCT-based Unfolding Framework ( OCTUF) for image CS.
  arXiv  Detail & Related papers  (2023-04-27T07:21:30Z)

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.