Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2305.06585 · IEEE International Conference on Quantum Computing and Engineering (QCE)

Parallelizing Quantum-Classical Workloads: Profiling the Impact of Splitting Techniques

Tuhin Khare, Ritajit Majumdar, Rajiv Sangle, Anupama Ray, Padmanabha Venkatagiri Seshadri, Yogesh L. Simmhan

Published Sep 17, 2023• 10 citations
arXivHTMLPDF

Abstract

Quantum computers are the next evolution of computing hardware. Quantum devices are being exposed through the same familiar cloud platforms used for classical computers, and enabling seamless execution of hybrid applications that combine quantum and classical components. Quantum devices vary in features, e.g., number of qubits, quantum volume, CLOPS, noise profile, queuing delays and resource cost. So, it may be useful to split hybrid workloads with either large quantum circuits or a large number of quantum circuits, into smaller units. In this paper, we profile two workload splitting techniques on IBM's Quantum Cloud: (1) Circuit parallelization, to split one large circuit into multiple smaller ones, and (2) Data parallelization to split a large number of circuits that run on one device to smaller batches of circuits that run on concurrently on multiple devices. These can improve the utilization of heterogeneous quantum hardware, but involve trade-offs. We evaluate these techniques on two key algorithmic classes: Variational Quantum Eigensolver (VQE) and Quantum Support Vector Machine (QSVM), and measure the impact on quality of the result, circuit execution times, quantum resource usage, and processing overheads, relative to a baseline without such parallelization. The results are obtained on real hardware and complemented by simulations. We see that (1) VQE with circuit cutting is ~ 39% better in ground state estimation than the uncut version, and (2) QSVM that combines data parallelization with a reduced feature set yields upto 3 ×improvement in quantum workload execution time and reduces quantum resource use by 3 ×, while providing comparable accuracy. Error mitigation can improve the accuracy by ≈ 7% and reduce resource footprint by ≈4% compared to the best case among the considered scenarios.

DOI
10.1109/qce57702.2023.00113

Related papers

Comparing the Orchestration of Quantum Applications on Hybrid Clouds

Rajiv Sangle, Tuhin Khare, Padmanabha Venkatagiri Seshadri +1 more

Early quantum computers are being offered by Cloud providers, with the ability to run Hybrid Quantum-Classical (HQC) applications that span Quantum and Classical (binary) computing resources. These HQC algorithms help benchmark and validate the performance of such near-term quantum hardware. Equally important is the software platform that allows a remote user to program the quantum computer on the cloud. The recent Qiskit Runtime platform from IBM allows a seamless and prioritized access to quantum backends and co-located classical hardware within their hybrid cloud for optimized execution of HQC workloads. In contrast, IBM’s Circuit API offers finer application definition but the classical resources are not co-located but placed farther away. Here, we study and contrast the execution flows of a Variational Quantum Eigensolver (VQE) application defined using Qiskit Runtime, and an equivalent implementation using the Circuit API. We quantify the latencies of the various components in these execution. This offers insights on how to better orchestrate the execution of quantum applications across such hybrid resources.

•May 1, 2023•4 citations

Enhancing computational accuracy with parallel parameter optimization in variational quantum eigensolver

Daisuke Tsukayama, Jun‐ichi Shirakashi, Tetsuo Shibuya +1 more

Variational quantum algorithms have promising applications in noisy intermediate-scale quantum (NISQ) devices. These algorithms rely on a classical optimization outer loop that minimizes a parameterized quantum circuit function. The optimization in variational quantum eigensolver (VQE) is NP-hard, meaning that finding the optimal solution is infeasible in the worst-case scenario. One way to address this challenge is through parallel optimization of parameters using multiple-parameterized quantum circuits. However, this approach is unsuitable for cloud-based quantum processing unit utilization due to the increased number of quantum circuit executions. Although NISQ devices have limitations in terms of gate depth, their size has been growing in recent years. Therefore, implementing multiple-parameterized quantum circuits in NISQ devices can suppress the increase in the number of executions. In this study, we propose a parallel-VQE, which leverages the parallel execution of parameterized quantum circuits to perform parallel parameter optimization in VQE, achieving convergence to solutions closer to the ground state. We validate the effectiveness of parallel-VQE in solving the random weighted max-cut problem using numerical simulations and a real quantum device. We present the results of running up to six circuits in parallel (120 qubits) and demonstrate the advantages of using multiple units to improve computational accuracy. This study provides a potential method for solving eigenvalue problems and combinatorial optimization problems for future quantum devices.

AIP Advances•Jan 1, 2025•8 citations

Circuit Partitioning and Full Circuit Execution: A Comparative Study of GPU-Based Quantum Circuit Simulation

Kartikey Sarode

Large quantum circuits cannot be executed efectively on available NISQ (noisy intermediatescale quantum) devices.Moreover, due to the associated cost, researching and developing quantum algorithms on real quantum devices is not feasible.Classical simulations are, therefore, the best method to research and validate large-scale quantum algorithms.This, however, requires a large amount of resources as each additional qubit doubles the computational space for a quantum algorithm.Distributed Quantum Computing (DQC) is a promising alternative to reduce the resources required to simulate large quantum algorithms at the cost of increased runtime.This study performs a comparative analysis between two simulation methods, i.e. circuitsplitting versus full-circuit execution using distributed memory, with each method having a diferent type of overhead.The frst approach cuts the circuits into smaller subcircuits and allows us to simulate large quantum circuits using smaller machines.The second approach distributes the computational space across a distributed memory space and simulates the entire circuit.Results show that full-circuit executions are faster than circuit-splitting for simulations executed on a single node.However, circuit-splitting simulations show promising results in specifc scenarios as the number of qubits is scaled.v

•Jan 1, 2024•1 citation

Circuit Partitioning and Full Circuit Execution: A Comparative Study of GPU - Based Quantum Circuit Simulation

Kartikey Sarode

Executing large quantum circuits is not feasible using the currently available NISQ (noisy intermediate-scale quantum) devices. The high costs of using real quantum devices make it further challenging to research and develop quantum algorithms. As a result, performing classical simulations is usually the preferred method for researching and validating large-scale quantum algorithms. However, these simulations require a huge amount of resources, as each additional qubit exponentially increases the computational space required. Distributed Quantum Computing (DQC) is a promising alternative to reduce the resources required for simulating large quantum algorithms at the cost of increased runtime. This study presents a comparative analysis of two simulation methods: circuit-splitting and full-circuit execution using distributed memory, each having a different type of overhead. The first method, using CutQC, cuts the circuit into smaller subcircuits and allows us to simulate a large quantum circuit on smaller machines. The second method, using Qiskit-Aer-GPU, distributes the computational space across a distributed memory system to simulate the entire quantum circuit. Results indicate that full-circuit executions are faster than circuit-splitting for simulations performed on a single node. However, circuit-splitting simulations show promising results in specific scenarios as the number of qubits is scaled.

IEEE International Conference on High Performance Computing, Data, and Analytics•Dec 18, 2024•2 citations

Circuit Partitioning and Full Circuit Execution: A Comparative Study of GPU-Based Quantum Circuit Simulation

Kartikey Sarode, Daniel Huang, E. Wes Bethel

Executing large quantum circuits is not feasible using the currently available NISQ (noisy intermediate-scale quantum) devices. The high costs of using real quantum devices make it further challenging to research and develop quantum algorithms. As a result, performing classical simulations is usually the preferred method for researching and validating large-scale quantum algorithms. However, these simulations require a huge amount of resources, as each additional qubit exponentially increases the computational space required. Distributed Quantum Computing (DQC) is a promising alternative to reduce the resources required for simulating large quantum algorithms at the cost of increased runtime. This study presents a comparative analysis of two simulation methods: circuit-splitting and full-circuit execution using distributed memory, each having a different type of overhead. The first method, using CutQC, cuts the circuit into smaller subcircuits and allows us to simulate a large quantum circuit on smaller machines. The second method, using Qiskit-Aer-GPU, distributes the computational space across a distributed memory system to simulate the entire quantum circuit. Results indicate that full-circuit executions are faster than circuit-splitting for simulations performed on a single node. However, circuit-splitting simulations show promising results in specific scenarios as the number of qubits is scaled.

arXiv:2502.11385•Feb 17, 2025•0 citations

Accelerating Quantum Subcircuit Reconstruction Utilizing Multi-Node Computation

Chuck Garcia, Ellie Vogel, Wei Tang +1 more

Today's Quantum Computers (QCs) face significant engineering challenges that limit their size and fidelity. To execute realistic applications, researchers must develop ways to move past these constraints. CutQC enables small QCs to run larger quantum circuits by cutting circuits into smaller subcircuits and then utilizing classical resources and Kronecker products to reproduce the desired output. In this work, we enhance the reconstruction process. In particular, we develop a distributed PyTorch implementation of CutQC's classical post-processing step, which can run across multiple nodes on either GPU or CPU devices. Our results show that our PyTorch implementation executes circuits of up to 35 qubits on 10- and 15-qubit QCs with efficient reconstruction. We use single-node computation as a baseline and then compare the results to the runtimes of our PyTorch workflows. By utilizing parallelism and specified devices, the reconstruction step of hybrid quantum-classical circuit execution can be improved. The original CutQC paper demonstrated a 60X to 8600X runtime speedup over classical simulation, and our work increases this speedup. These results show that large quantum circuits can be run on smaller QCs by leveraging circuit cutting with data parallelism techniques to maintain a reasonable runtime. This allows researchers to maintain the high fidelity of smaller machines while executing larger circuits.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•0 citations
Quantum computers are the next evolution of computing hardware. Quantum devices are being exposed through the same familiar cloud platforms used for classical computers, and enabling seamless execution of hybrid applications that combine quantum and classical components. Quantum devices vary in features, e.g., number of qubits, quantum volume, CLOPS, noise profile, queuing delays and resource cost. So, it may be useful to split hybrid workloads with either large quantum circuits or a large number of quantum circuits, into smaller units. In this paper, we profile two workload splitting techniques on IBM's Quantum Cloud: (1) Circuit parallelization, to split one large circuit into multiple smaller ones, and (2) Data parallelization to split a large number of circuits that run on one device to smaller batches of circuits that run on concurrently on multiple devices. These can improve the utilization of heterogeneous quantum hardware, but involve trade-offs. We evaluate these techniques on two key algorithmic classes: Variational Quantum Eigensolver (VQE) and Quantum Support Vector Machine (QSVM), and measure the impact on quality of the result, circuit execution times, quantum resource usage, and processing overheads, relative to a baseline without such parallelization. The results are obtained on real hardware and complemented by simulations. We see that (1) VQE with circuit cutting is ~ 39% better in ground state estimation than the uncut version, and (2) QSVM that combines data parallelization with a reduced feature set yields upto 3 ×improvement in quantum workload execution time and reduces quantum resource use by 3 ×, while providing comparable accuracy. Error mitigation can improve the accuracy by ≈ 7% and reduce resource footprint by ≈4% compared to the best case among the considered scenarios.
Early quantum computers are being offered by Cloud providers, with the ability to run Hybrid Quantum-Classical (HQC) applications that span Quantum and Classical (binary) computing resources. These HQC algorithms help benchmark and validate the performance of such near-term quantum hardware. Equally important is the software platform that allows a remote user to program the quantum computer on the cloud. The recent Qiskit Runtime platform from IBM allows a seamless and prioritized access to quantum backends and co-located classical hardware within their hybrid cloud for optimized execution of HQC workloads. In contrast, IBM’s Circuit API offers finer application definition but the classical resources are not co-located but placed farther away. Here, we study and contrast the execution flows of a Variational Quantum Eigensolver (VQE) application defined using Qiskit Runtime, and an equivalent implementation using the Circuit API. We quantify the latencies of the various components in these execution. This offers insights on how to better orchestrate the execution of quantum applications across such hybrid resources.
Variational quantum algorithms have promising applications in noisy intermediate-scale quantum (NISQ) devices. These algorithms rely on a classical optimization outer loop that minimizes a parameterized quantum circuit function. The optimization in variational quantum eigensolver (VQE) is NP-hard, meaning that finding the optimal solution is infeasible in the worst-case scenario. One way to address this challenge is through parallel optimization of parameters using multiple-parameterized quantum circuits. However, this approach is unsuitable for cloud-based quantum processing unit utilization due to the increased number of quantum circuit executions. Although NISQ devices have limitations in terms of gate depth, their size has been growing in recent years. Therefore, implementing multiple-parameterized quantum circuits in NISQ devices can suppress the increase in the number of executions. In this study, we propose a parallel-VQE, which leverages the parallel execution of parameterized quantum circuits to perform parallel parameter optimization in VQE, achieving convergence to solutions closer to the ground state. We validate the effectiveness of parallel-VQE in solving the random weighted max-cut problem using numerical simulations and a real quantum device. We present the results of running up to six circuits in parallel (120 qubits) and demonstrate the advantages of using multiple units to improve computational accuracy. This study provides a potential method for solving eigenvalue problems and combinatorial optimization problems for future quantum devices.
Large quantum circuits cannot be executed efectively on available NISQ (noisy intermediatescale quantum) devices.Moreover, due to the associated cost, researching and developing quantum algorithms on real quantum devices is not feasible.Classical simulations are, therefore, the best method to research and validate large-scale quantum algorithms.This, however, requires a large amount of resources as each additional qubit doubles the computational space for a quantum algorithm.Distributed Quantum Computing (DQC) is a promising alternative to reduce the resources required to simulate large quantum algorithms at the cost of increased runtime.This study performs a comparative analysis between two simulation methods, i.e. circuitsplitting versus full-circuit execution using distributed memory, with each method having a diferent type of overhead.The frst approach cuts the circuits into smaller subcircuits and allows us to simulate large quantum circuits using smaller machines.The second approach distributes the computational space across a distributed memory space and simulates the entire circuit.Results show that full-circuit executions are faster than circuit-splitting for simulations executed on a single node.However, circuit-splitting simulations show promising results in specifc scenarios as the number of qubits is scaled.v
Executing large quantum circuits is not feasible using the currently available NISQ (noisy intermediate-scale quantum) devices. The high costs of using real quantum devices make it further challenging to research and develop quantum algorithms. As a result, performing classical simulations is usually the preferred method for researching and validating large-scale quantum algorithms. However, these simulations require a huge amount of resources, as each additional qubit exponentially increases the computational space required. Distributed Quantum Computing (DQC) is a promising alternative to reduce the resources required for simulating large quantum algorithms at the cost of increased runtime. This study presents a comparative analysis of two simulation methods: circuit-splitting and full-circuit execution using distributed memory, each having a different type of overhead. The first method, using CutQC, cuts the circuit into smaller subcircuits and allows us to simulate a large quantum circuit on smaller machines. The second method, using Qiskit-Aer-GPU, distributes the computational space across a distributed memory system to simulate the entire quantum circuit. Results indicate that full-circuit executions are faster than circuit-splitting for simulations performed on a single node. However, circuit-splitting simulations show promising results in specific scenarios as the number of qubits is scaled.
Executing large quantum circuits is not feasible using the currently available NISQ (noisy intermediate-scale quantum) devices. The high costs of using real quantum devices make it further challenging to research and develop quantum algorithms. As a result, performing classical simulations is usually the preferred method for researching and validating large-scale quantum algorithms. However, these simulations require a huge amount of resources, as each additional qubit exponentially increases the computational space required. Distributed Quantum Computing (DQC) is a promising alternative to reduce the resources required for simulating large quantum algorithms at the cost of increased runtime. This study presents a comparative analysis of two simulation methods: circuit-splitting and full-circuit execution using distributed memory, each having a different type of overhead. The first method, using CutQC, cuts the circuit into smaller subcircuits and allows us to simulate a large quantum circuit on smaller machines. The second method, using Qiskit-Aer-GPU, distributes the computational space across a distributed memory system to simulate the entire quantum circuit. Results indicate that full-circuit executions are faster than circuit-splitting for simulations performed on a single node. However, circuit-splitting simulations show promising results in specific scenarios as the number of qubits is scaled.
Today's Quantum Computers (QCs) face significant engineering challenges that limit their size and fidelity. To execute realistic applications, researchers must develop ways to move past these constraints. CutQC enables small QCs to run larger quantum circuits by cutting circuits into smaller subcircuits and then utilizing classical resources and Kronecker products to reproduce the desired output. In this work, we enhance the reconstruction process. In particular, we develop a distributed PyTorch implementation of CutQC's classical post-processing step, which can run across multiple nodes on either GPU or CPU devices. Our results show that our PyTorch implementation executes circuits of up to 35 qubits on 10- and 15-qubit QCs with efficient reconstruction. We use single-node computation as a baseline and then compare the results to the runtimes of our PyTorch workflows. By utilizing parallelism and specified devices, the reconstruction step of hybrid quantum-classical circuit execution can be improved. The original CutQC paper demonstrated a 60X to 8600X runtime speedup over classical simulation, and our work increases this speedup. These results show that large quantum circuits can be run on smaller QCs by leveraging circuit cutting with data parallelism techniques to maintain a reasonable runtime. This allows researchers to maintain the high fidelity of smaller machines while executing larger circuits.