Metraipolis › archive › dc_ce307b8465b8
Parallel Circuit Execution for Scalable Quantum Computation — arXiv:2609.12172
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.12172
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T04:01:08.394Z
- SHA-256 of the archived text
169c5edbdddc3b9255e289a4d7607d22ff979fbdb31a8eb092b07b2ffe10c0c7- Stable URL of this page
https://metraipolis.com/documento/dc_ce307b8465b8
How to cite
Parallel Circuit Execution for Scalable Quantum Computation — arXiv:2609.12172 — arXiv (en), https://arxiv.org/abs/2609.12172 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ce307b8465b8 (Metraipolis archive dc_ce307b8465b8, sha256 169c5edbdddc3b9255e289a4d7607d22ff979fbdb31a8eb092b07b2ffe10c0c7)
BibTeX
@misc{dcce307b8465b8,
title = {Parallel Circuit Execution for Scalable Quantum Computation — arXiv:2609.12172},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.12172},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ce307b8465b8; sha256 169c5edbdddc3b9255e289a4d7607d22ff979fbdb31a8eb092b07b2ffe10c0c7},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.12172. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Today's quantum processors have tens to hundreds of physical qubits, but reliable execution of arbitrary circuits remains limited to fewer than 30 entangled qubits across hardware modalities. Building upon prior work, we introduce an error- and topology-aware method for mapping multiple independent circuits onto disjoint regions of a single large-scale QPU for parallel circuit execution. For applications with many similarly sized circuits, such as observable estimation for Hamiltonian simulation, this approach can reduce billed QPU execution time, with ideal speedup proportional to the number of usable partitions. We demonstrate the approach on IBM's 156-qubit ibm_boston processor using standard QED-C benchmark and Hamiltonian-based observable-estimation workloads. Compared with standard sequential execution, parallel execution reduces billed execution time by 3.5-5.5x while retaining 83-92% of the sequential fidelity. We further evaluate the scaling of parallel circuit execution using GPU-accelerated classical simulation, distributing measurement circuits across GPUs via MPI. Using CUDA-Q on the NERSC Perlmutter system, we achieve up to 13.8x speedup on 16 GPUs (86% parallel efficiency) for an H2 electronic-structure simulation, with scaling evaluated across multiple Hamiltonians and circuit counts. These results provide an indication of the performance ceiling that parallel execution on future quantum hardware may eventually approach. Both execution modes are implemented as a runtime option within the QED-C Application-Oriented Benchmark suite. Together, the results show that circuit-level parallelism can reduce execution cost on current quantum hardware and simulation time on GPU clusters, with the potential for greater benefits as device quality and qubit counts increase. Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-14 in quant-ph). Categorie arXiv: Quantum Physics (quant-ph). Pagina del lavoro: https://arxiv.org/abs/2609.12172 — 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-16T03:55:40.537Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).