The paper reports on shuttling compilers for trapped‑ion quantum computers that are built using five large language models (LLMs) fine‑tuned on hand‑crafted shuttling schedules for linear and branched one‑dimensional trap architectures. For circuits up to 16 qubits, the fine‑tuned LLMs produce valid schedules on the training architectures, and in 12% of compilations the best of ten runs achieves up to 21% fewer operations than heuristic baselines after rule‑based post‑processing. A single run of one LLM also generates a valid schedule for a previously unseen four‑way branched architecture, providing preliminary evidence of cross‑architecture generalization, though no LLM succeeded on two other unseen architectures.
By Fabian Kreppel, Reza Salkhordeh, Ferdinand Schmidt-Kaler, Andr\'e Brinkmann
arXiv:2607. 24714v1 Announce Type: cross Abstract: Trapped-ion quantum computers rely on shuttling compilers, which cast an input algorithm into a sequence of ion-qubit movements within a given architecture.
By Fabian Kreppel, Reza Salkhordeh, Ferdinand Schmidt-Kaler, Andr\'e Brinkmann
arXiv:2605. 30358v2 Announce Type: replace Abstract: Quantum computing remains in the Noisy Intermediate-Scale Quantum (NISQ) era, with performance constrained by noise.
By Zhenxiao Fu, Lei Jiang, Fan Chen
arXiv:2607. 29145v1 Announce Type: cross Abstract: Quantum software engineering is an emerging research field focusing on efficiently embedding the quantum programming paradigm into existing software ecosystems.
By Piotr Malkowski, Domenik Eichhorn, Joshua Ammermann, Rinor Kelmendi, Nick Poser, Patrick Hopf, Ina Schaefer
The paper introduces MQSS-Selector, a reinforcement‑learning guided pass selection system for an MLIR compilation pipeline aimed at unified High Performance Computing‑Quantum Computing (HPCQC) infrastructures. It addresses the challenges of Noisy Intermediate‑Scale Quantum (NISQ) devices by integrating device selection, compiler‑pass optimization, and job queue scheduling into a single learning‑based framework. The selector can simultaneously optimize multiple objectives—fidelity, compilation time, and scheduling latency—while adapting to circuit characteristics and device conditions.
By Andre Youssefi (Leibniz Supercomputing Centre), Erc\"ument Kaya (Leibniz Supercomputing Centre, Technical University of Munich), Minh Chung (Leibniz Supercomputing Centre), Jorge Echavarria (Munich Quantum Valley), Laura B. Schulz (Argonne National Laboratory), Martin Schulz (Leibniz Supercomputing Centre, Technical University of Munich)
arXiv:2508. 20134v2 Announce Type: replace Abstract: Programming quantum circuits at the OpenQASM level is essential for achieving hardware-aware optimization and reliable execution on noisy intermediate-scale quantum (NISQ) devices, yet it remains challenging due to the need for domain-specific planning, iterative code synthesis, and low-level calibration.
By Zhenxiao Fu, Lei Jiang, Yilun Xu, Gang Huang, Fan Chen
arXiv:2607. 25865v1 Announce Type: cross Abstract: Quantum error correction (QEC) is indispensable for scalable fault-tolerant quantum computing.
By Ge Yan, Shanchuan Li, Pengyue Ma, Qixin Zhang, Pingchuan Ma, Jianping Wang, Min-Hsiu Hsieh, Yuxuan Du
arXiv:2607. 29134v1 Announce Type: cross Abstract: Recent work suggests that relational database management systems (RDBMSs) can execute quantum circuit simulation by compiling the simulation into SQL workloads (primarily join-and-aggregate tensor contractions).
By Andrei Ilinescu, Aadi Patwardhan, Rihan Hai
BadQubits is an LLM-based framework that statically analyzes OpenQASM 2.0 circuits before execution to detect structurally harmful patterns. The system evaluates four large language model architectures on 1,500 circuits, achieving 92.67% classification accuracy and 96.1% recall for harmful circuits with a fine‑tuned Qwen Coder 2.5 7B model. Comparative experiments show that LLMs retain sequential token structure, outperforming a bag‑of‑gates CNN, and that model decisions correlate with threat‑defining features such as SWAP density and measurement timing.
By Justin Woodring, Lamine Noureddine, Aisha Ali-Gombe
AlphaClifford is a model‑based reinforcement learning framework that uses Monte Carlo Tree Search to synthesize Clifford circuits from the H, S, and CNOT gate set. By modeling the state space with the algebraic properties of the symplectic group, it consistently reduces total and two‑qubit gate counts compared to existing heuristics. The approach also extends to hardware‑constrained transpilation and serves as a post‑synthesis optimizer in a full Clifford+T pipeline.
By Daniele Lizzio Bosco, Jacopo Cossio, Carla Piazza, Giuseppe Serra
The paper introduces a low‑overhead, fidelity‑aware scheduling framework for multi‑QPU quantum computing systems. It employs a Graph Neural Network to predict the expected execution fidelity of a given quantum circuit on each available QPU before compilation. Using these predictions, a tunable scheduler balances execution fidelity against parallelism, achieving near‑optimal fidelity assignments while reducing the computational cost compared to brute‑force compilation on every device.
By Innocenzo Fulginiti, Antonio Tudisco, Salvatore Zammuto, Patrick Hopf, Deborah Volpe, Helmut Seidl, Giovanna Turvani, Robert Wille, Christian B. Mendl, Martin Schulz
arXiv:2606. 07666v1 Announce Type: cross Abstract: Noisy intermediate-scale quantum (NISQ) processors are entering an early fault-tolerance regime where full quantum error correction carries prohibitive resource costs, yet lightweight error detection can meaningfully improve algorithmic success rates.
By Sumit Chongder (Indian Institute of Technology Jodhpur)