Parallel Circuit Execution for Scalable Quantum Computation

• URL: http://arxiv.org/abs/2609.12172v1
• Date: Thu, 10 Sep 2026 20:00:16 GMT
• Title: Parallel Circuit Execution for Scalable Quantum Computation
• Abstract summary: 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.<n>We demonstrate the approach on IBM's 156-qubit ibm_boston processor using standard QED-C benchmark and Hamiltonian-based observable-estimation workloads.
• Score: 0.7747796552298198
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Classic and Quantum Task-Based Intelligent Runtime for QIRs Running on Multiple QPUs [1.212250364181868]
  We introduce an intelligent, task-based runtime that marries the Intelligent RuntIme System (IRIS) scheduler with a quantum programming stack through the Quantum Intermediate Representation Execution Engine (QIR-EE)<n>Our design allows programs written in the quantum intermediate representation (QIR) to be dispatched concurrently to a variety of back-ends, including multiple quantum simulators and nascent quantum processors, enabling genuine hybrid execution on a single node.
  arXiv  Detail & Related papers  (2026-05-12T01:14:13Z)
• Towards High Performance Quantum Computing (HPQ): Parallelisation of the Hamiltonian Auto Decomposition Optimisation Framework (HADOF) [0.0]
  Hamiltonian Auto Decomposition Optimisation Framework (HADOF) addresses this by decomposing large quantum QUBOs into smaller subproblems.<n>This allows the scalability of quantum QUBO algorithms beyond device limits, as well as their simulation on classical devices.<n>We show that even single QPU execution benefits from parallelised job orchestration and execution, yielding up to 3x speedup.
  arXiv  Detail & Related papers  (2026-04-30T13:22:02Z)
• The Quest for Quantum Advantage in Combinatorial Optimization: End-to-end Benchmarking of Quantum Solvers vs. Multi-core Classical Solvers [34.734652426291525]
  We perform an end-to-end benchmark of a hybrid sequential quantum computing solver for higher-order unconstrained binary optimization (HUBO) on IBM Heron r3 quantum processors.<n>Across 20 benchmark instances, a single hybrid attempt produces high-quality solutions in less than one second, matching the ground-state energy in 14 cases.
  arXiv  Detail & Related papers  (2026-03-13T21:29:20Z)
• Parallelizing Program Execution on Distributed Quantum Systems via Compiler/Hardware Co-Design [39.81714981855818]
  This paper introduces a novel approach to enhance the execution of quantum algorithms on distributed quantum systems.<n>The proposed method involves the development of a hardware design that supports parallel instruction execution and a compiler that modifies the order of instructions to increase parallelism opportunities.<n>The results demonstrate a significant speedup, achieving a maximum average speedup of 16.5x and a maximum single-benchmark speedup of 56.2x relative to a baseline, serial execution model.
  arXiv  Detail & Related papers  (2025-11-18T10:05:20Z)
• Lazy Qubit Reordering for Accelerating Parallel State-Vector-based Quantum Circuit Simulation [0.0]
  Two quantum operation scheduling methods are proposed for quantum circuit simulation. The proposed methods reduce all-to-all communication caused by qubit reordering. We develop these methods tailored for two primary procedures in variational quantum eigensolver (VQE) simulation.
  arXiv  Detail & Related papers  (2024-10-05T18:20:37Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• One-Time Compilation of Device-Level Instructions for Quantum Subroutines [21.79238078751215]
  We develop a device-level partial-compilation (DLPC) technique that reduces compilation overhead to nearly constant. We execute this modified pipeline on real trapped-ion quantum computers and observe significant reductions in compilation time.
  arXiv  Detail & Related papers  (2023-08-21T15:23:09Z)
• Cutting Quantum Circuits to Run on Quantum and Classical Platforms [25.18520278107402]
  CutQC is a scalable hybrid computing approach that distributes a large quantum circuit onto quantum (QPU) and classical platforms ( CPU or GPU) for co-processing. It achieves much higher quantum circuit evaluation fidelity than the large NISQ devices achieve in real-system runs.
  arXiv  Detail & Related papers  (2022-05-12T02:09:38Z)
• Parallel Simulation of Quantum Networks with Distributed Quantum State Management [56.24769206561207]
  We identify requirements for parallel simulation of quantum networks and develop the first parallel discrete event quantum network simulator. Our contributions include the design and development of a quantum state manager that maintains shared quantum information distributed across multiple processes. We release the parallel SeQUeNCe simulator as an open-source tool alongside the existing sequential version.
  arXiv  Detail & Related papers  (2021-11-06T16:51:17Z)
• Enabling Multi-programming Mechanism for Quantum Computing in the NISQ Era [0.0]
  NISQ devices have several physical limitations and unavoidable noisy quantum operations. Only small circuits can be executed on a quantum machine to get reliable results. We propose a Quantum Multi-programming Compiler (QuMC) to execute multiple quantum circuits on quantum hardware simultaneously.
  arXiv  Detail & Related papers  (2021-02-10T08:46:16Z)
• Accelerating Feedforward Computation via Parallel Nonlinear Equation Solving [106.63673243937492]
  Feedforward computation, such as evaluating a neural network or sampling from an autoregressive model, is ubiquitous in machine learning. We frame the task of feedforward computation as solving a system of nonlinear equations. We then propose to find the solution using a Jacobi or Gauss-Seidel fixed-point method, as well as hybrid methods of both. Our method is guaranteed to give exactly the same values as the original feedforward computation with a reduced (or equal) number of parallelizable iterations, and hence reduced time given sufficient parallel computing power.
  arXiv  Detail & Related papers  (2020-02-10T10:11:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.