← Back to all news
arXiv AI By Innocenzo Fulginiti, Antonio Tudisco, Salvatore Zammuto, Patrick Hopf, Deborah Volpe, Helmut Seidl, Giovanna Turvani, Robert Wille, Christian B. Mendl, Martin Schulz

Fidelity-Aware Scheduling of Quantum Circuits on Multi-QPU Systems

Read the original on arXiv AI →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

Related stories

arXiv Machine Learning
Sep 25

MQSS-Selector: RL-Guided Pass Selection for an MLIR Compilation Pipeline

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)
reinforcement-learning
More like this →
arXiv Machine Learning
Jun 9

Hardware-aware Low-latency Quantum Compilation with Data-driven Lightweight Error Detection for Early Fault-Tolerant Systems

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)
benchmarks
More like this →
arXiv AI
Sep 24

Quantum Reinforcement Learning for Cost and Delay Tradeoffs in Quantum Cloud Orchestration

Quantum Reinforcement Learning for Cost and Delay Tradeoffs in Quantum Cloud Orchestration proposes QRLQ, a scheduling framework that integrates parameterised quantum circuits with a dueling double deep Q‑network to balance execution cost and delay in quantum‑as‑a‑service environments. Simulation results show QRLQ outperforms heuristic baselines, achieving 5‑11% lower mean cost and up to 82% lower mean delay while maintaining fidelity within 2% of a fidelity‑greedy policy. Compared to a classical deep reinforcement learning baseline, QRLQ delivers comparable performance with 72% fewer trainable parameters.

By An N. H. Phan, Dang Van Huynh, Muhammad Usman, Hoa T. Nguyen
agentsreinforcement-learning
More like this →
arXiv Machine Learning
Jun 11

Family-Aware Residual Architecture for Predicting Quantum Circuit Simulation Performance

arXiv:2606. 11620v1 Announce Type: cross Abstract: Approximate tensor-network simulators enable classical simulation of quantum circuits beyond the reach of exact methods, but selecting optimal approximation parameters -- such as bond dimension thresholds -- remains a costly trial-and-error process.

By Honjar Xing, Yehong Jiang, Xianbang Wang, Zehua Wang, Zhicheng Jiang
benchmarks
More like this →