Metraipolis › archive › dc_af2eb30cdb98

Fidelity-Aware Scheduling of Quantum Circuits on Multi-QPU Systems — arXiv:2609.09980

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.09980
License (as archived)
CC0-1.0
Archived
2026-10-16T07:26:41.248Z
SHA-256 of the archived text
47d5a8ad965ddba48525c52d8b95a1742f0a2ea9795f9822d7a3a513f6040cbf
Stable URL of this page
https://metraipolis.com/documento/dc_af2eb30cdb98

How to cite

Fidelity-Aware Scheduling of Quantum Circuits on Multi-QPU Systems — arXiv:2609.09980 — arXiv (en), https://arxiv.org/abs/2609.09980 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_af2eb30cdb98 (Metraipolis archive dc_af2eb30cdb98, sha256 47d5a8ad965ddba48525c52d8b95a1742f0a2ea9795f9822d7a3a513f6040cbf)
BibTeX
@misc{dcaf2eb30cdb98,
  title = {Fidelity-Aware Scheduling of Quantum Circuits on Multi-QPU Systems — arXiv:2609.09980},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.09980},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_af2eb30cdb98; sha256 47d5a8ad965ddba48525c52d8b95a1742f0a2ea9795f9822d7a3a513f6040cbf},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.09980. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

High Performance Computing-Quantum Computing (HPCQC) platforms expose multiple Quantum Processing Units (QPUs) that may differ in size, topology, native gates, and noise characteristics. For current noisy devices, errors compound along the compiled circuits quickly, and minimizing them, that is, maximizing the circuits' execution fidelity, is essential for reliable results. Fidelity depends on the compilation to a specific target device: the same high-level circuit may produce different executables and, therefore, different expected fidelities across QPUs. We present a low-overhead fidelity-aware scheduling framework for multi-QPU systems based on a Graph Neural Network (GNN) that estimates, before compilation, the expected fidelity of each circuit on each available QPU. Then, a tunable scheduler uses these estimates to control the trade-off between execution fidelity and parallelism. Results show that this framework allows for approximating an exhaustive fidelity-based assignment, saving computational resources compared to a brute-force approach that compiles each circuit on every device.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-10 in cs.AI).
Categorie arXiv: Quantum Physics (quant-ph) ; Artificial Intelligence (cs.AI); Emerging Technologies (cs.ET).
Pagina del lavoro: https://arxiv.org/abs/2609.09980 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T07:00:16.368Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).