Quantum Circuit Packaging on Current QCaaS Platforms

Quantum Processing Units are rapidly scaling, with current systems exceeding 100 qubits and targeting one billion operations in the near future. However, Quantum Computing as a Service platforms are facing growing pressure due to high user demand and long execution queues. This is primarily due to resource underutilization and the current execution model, which typically allows only one job per queue slot. Additionally, high costs are associated with the execution of each job. To address these limitations, this paper proposes a multi-batch quantum circuit scheduling approach aimed at increasing hardware utilization and reducing execution queues. To achieve this, different circuits are packed into various batches to be executed within a single job, where the results obtained in each batch are measured in distinct classical registers. These features allow for the reuse of previously utilized qubits in previous batches, enabling them to be used again for execution without the need to submit a new job. The approach has been validated on the 133-qubit IBM Torino processor through large-scale experiments with multiple circuits and controlled noise isolation tests. By reducing repeated queue interactions and job submission overhead, the proposed method increases execution throughput, allowing for numerous circuit executions within a single job. Under the evaluated conditions, this approach achieves significant execution cost reductions compared to traditional circuit submissions. Although the method incurs an overall absolute noise penalty, it allows packing numerous circuits into a single iteration, resulting in substantial financial savings. Furthermore, the noise level remains stable from the first to the last batch, showing no progressive degradation over time.

Authors

Institutions

Publication Details

Journal
˜The œInternational journal of networked and distributed computing
Published
2026-08-26
DOI
https://doi.org/10.1007/s44227-026-00122-2
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quantum Circuit Packaging on Current QCaaS Platforms

Enrique Moguel, Antonio Jesus Sanchez-Gil, Jose Garcia-Alonso, Francisco Moreno-Velez et al.
˜The œInternational journal of networked and distributed computing
Quantum Computing Algorithms and Architecture
article

Quantum Circuit Packaging on Current QCaaS Platforms

Enrique Moguel, Antonio Jesus Sanchez-Gil, Jose Garcia-Alonso, Francisco Moreno-Velez, Juan M. Murillo, Javier Romero-Alvarez, Jaime Alvarado-Valiente
article en

Abstract

Quantum Processing Units are rapidly scaling, with current systems exceeding 100 qubits and targeting one billion operations in the near future. However, Quantum Computing as a Service platforms are facing growing pressure due to high user demand and long execution queues. This is primarily due to resource underutilization and the current execution model, which typically allows only one job per queue slot. Additionally, high costs are associated with the execution of each job. To address these limitations, this paper proposes a multi-batch quantum circuit scheduling approach aimed at increasing hardware utilization and reducing execution queues. To achieve this, different circuits are packed into various batches to be executed within a single job, where the results obtained in each batch are measured in distinct classical registers. These features allow for the reuse of previously utilized qubits in previous batches, enabling them to be used again for execution without the need to submit a new job. The approach has been validated on the 133-qubit IBM Torino processor through large-scale experiments with multiple circuits and controlled noise isolation tests. By reducing repeated queue interactions and job submission overhead, the proposed method increases execution throughput, allowing for numerous circuit executions within a single job. Under the evaluated conditions, this approach achieves significant execution cost reductions compared to traditional circuit submissions. Although the method incurs an overall absolute noise penalty, it allows packing numerous circuits into a single iteration, resulting in substantial financial savings. Furthermore, the noise level remains stable from the first to the last batch, showing no progressive degradation over time.

˜The œInternational journal of networked and distributed computing
Universidad de Extremadura (ES)
Decent work and economic growth
Openalex Percentile: Top 7%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.