Shuttling Compiler for Trapped-Ion Quantum Computers Based on Large Language Models

• URL: http://arxiv.org/abs/2512.18021v1
• Date: Fri, 19 Dec 2025 19:29:09 GMT
• Title: Shuttling Compiler for Trapped-Ion Quantum Computers Based on Large Language Models
• Authors: Fabian Kreppel, Reza Salkhordeh, Ferdinand Schmidt-Kaler, André Brinkmann,
• Abstract summary: Trapped-ion quantum computers rely on connectivity operations to establish connectivity between sub-registers within a quantum processing unit.<n>We propose a layout compilation strategy based on language increasing models to address this challenge.<n>We demonstrate that it provides a foundation for developing LLM-based compilers for branched-ion quantum computers.
• Score: 27.588919587175543
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Trapped-ion quantum computers based on segmented traps rely on shuttling operations to establish connectivity between multiple sub-registers within a quantum processing unit. Several architectures of increasing complexity have already been realized, including linear arrays, racetrack loops, and junction-based layouts. As hardware capabilities advance, the need arises for flexible software layers within the control stack to manage qubit routing$\unicode{x2014}$the process of dynamically reconfiguring qubit positions so that all qubits involved in a gate operation are co-located within the same segment. Existing approaches typically employ architecture-specific heuristics, which become impractical as system complexity grows. To address this challenge, we propose a layout-independent compilation strategy based on large language models (LLMs). Specifically, we fine-tune pretrained LLMs to generate the required shuttling operations. We evaluate this approach on both linear and branched one-dimensional architectures, demonstrating that it provides a foundation for developing LLM-based shuttling compilers for trapped-ion quantum computers.

Related papers

• RASCqL: Reaction-time-limited Architecture for Space-time-efficient Complex qLDPC Logic [0.39768138694503036]
  RASCqL is a Reaction-timelimited Architecture for Space-time-efficient qLDPC Logic.<n>It supports key algorithmic subroutines such as quantum arithmetic, table lookups, and magic-state distillation directly in qLDPC codes.<n>RASCqL implements key algorithmic subroutines at space-time costs comparable to state-of-the-art surface-code architectures.
  arXiv  Detail & Related papers  (2026-02-15T18:52:25Z)
• Estimating Local Observables via Cluster-Level Light-Cone Decomposition [0.9713561148090973]
  We introduce a framework based on Cluster-level Light-cone analysis that leverages the natural locality of quantum workloads.<n>We propose two complementary algorithms: the Causal Decoupling Algorithm, which exploits geometric disconnections in the light cone for sampling efficiency, and the Algebraic Decomposition Algorithm, which utilizes algebraic expansion to minimize hardware requirements.
  arXiv  Detail & Related papers  (2025-12-02T03:35:44Z)
• COMPAS: A Distributed Multi-Party SWAP Test for Parallel Quantum Algorithms [4.584616394519209]
  We introduce COMPAS, an architecture that realizes multivariate trace estimation across a multi-party network of interconnected modular and distributed QPUs.<n>Unlike other schemes, which must choose between optimality in circuit depth or GHZ width, COMPAS achieves both at once.<n>We analyze network-level errors and simulate the effects of circuit-level noise on the architecture.
  arXiv  Detail & Related papers  (2025-11-28T18:31:15Z)
• Scalable modular architecture for universal quantum computation [45.989522481082986]
  We show that it is sufficient to connect two qubit arrays that are evolution operator controllable by a single entangling two-qubit gate.<n>We illustrate the approach with two examples, consisting of 10, respectively 127 qubits, inspired by IBM quantum processors.
  arXiv  Detail & Related papers  (2025-07-19T16:45:47Z)
• Extractors: QLDPC Architectures for Efficient Pauli-Based Computation [39.98920557126034]
  We propose a new primitive that can augment any QLDPC memory into a computational block well-suited for Pauli-based computation.<n>In particular, any logical Pauli operator supported on the memory can be fault-tolerantly measured in one logical cycle.<n>Our architecture can implement universal quantum circuits via parallel logical measurements.
  arXiv  Detail & Related papers  (2025-03-13T14:07:40Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Distributed Architecture for FPGA-based Superconducting Qubit Control [7.804530685405802]
  Quantum circuits utilizing real time feedback techniques are a powerful tool for NISQ-era quantum computing. We have developed a custom FPGA-based processor architecture for QubiC, an open source platform for superconducting qubit control. We will detail the design of both the processor and compiler stack, and demonstrate its capabilities with a quantum state teleportation experiment.
  arXiv  Detail & Related papers  (2024-04-23T17:47:31Z)
• Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors [5.012570785656963]
  Dynamically field-programmable qubit arrays (DPQA) have emerged as a promising platform for quantum information processing. In this paper, we consider a DPQA architecture that contains multiple arrays and supports 2D array movements. We show that our DPQA-based compiled circuits feature reduced scaling overhead compared to a grid fixed architecture.
  arXiv  Detail & Related papers  (2023-06-06T08:13:10Z)
• The Basis of Design Tools for Quantum Computing: Arrays, Decision Diagrams, Tensor Networks, and ZX-Calculus [55.58528469973086]
  Quantum computers promise to efficiently solve important problems classical computers never will. A fully automated quantum software stack needs to be developed. This work provides a look "under the hood" of today's tools and showcases how these means are utilized in them, e.g., for simulation, compilation, and verification of quantum circuits.
  arXiv  Detail & Related papers  (2023-01-10T19:00:00Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• QuaSiMo: A Composable Library to Program Hybrid Workflows for Quantum Simulation [48.341084094844746]
  We present a composable design scheme for the development of hybrid quantum/classical algorithms and for applications of quantum simulation. We implement our design scheme using the hardware-agnostic programming language QCOR into the QuaSiMo library.
  arXiv  Detail & Related papers  (2021-05-17T16:17:57Z)
• Composable Programming of Hybrid Workflows for Quantum Simulation [48.341084094844746]
  We present a composable design scheme for the development of hybrid quantum/classical algorithms and for applications of quantum simulation. We implement our design scheme using the hardware-agnostic programming language QCOR into the QuaSiMo library.
  arXiv  Detail & Related papers  (2021-01-20T14:20:14Z)

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.