Quantum Computing, Communication, and Simulation

Optimized quantum circuit partitioning across multiple quantum processors

Eneet Kaur, Hassan Shapourian, Jiapeng Zhao, Michael Kilzer, Ramana Rao Kompella, Reza Nejabati

Published Mar 19, 2025• 6 citations

Abstract

This paper addresses the challenge of scaling quantum computing using distributed quantum algorithms across multiple processors. We propose methods to optimize entanglement consumption for a quantum algorithm, and account for network constraints in the proposed solution.

DOI: 10.1117/12.3042502

Related papers

Optimized Quantum Circuit Partitioning Across Multiple Quantum Processors

Eneet Kaur, Shahrooz Pouryousef, Hassan Shapourian +4 more

This paper addresses the challenge of scaling quantum computing by employing distributed quantum algorithms across multiple processors. As quantum circuits grow in complexity, efficiently managing the entanglement resources required for communication between quantum processing units (QPUs) becomes increasingly critical. We propose novel methods to optimize entanglement consumption while accounting for network constraints. Our approach leverages graph partitioning techniques to optimize both qubit teleportation and gate teleportation, minimizing the number of Einstein-Podolsky-Rosen (EPR) pairs required to execute general quantum circuits. Additionally, we formulate an integer linear program (ILP) to further reduce entanglement requirements by mapping the logical resources of partitioned circuits to the physical constraints of the underlying quantum network. Finally, we analyze the entanglement cost for implementing the Quantum Fourier Transform (QFT) across multiple QPUs, employing an approach that exploits the circuit's structure to minimize total entanglement consumption. These contributions provide a pathway to scalable and resource-efficient distributed quantum computing.

IEEE Transactions on Quantum EngineeringJan 1, 20256 citations

Entanglement-Efficient Distribution of Quantum Circuits Over Large-Scale Quantum Networks

Felix Burt, Kuan‐Cheng Chen, Kin Kwong Leung

Quantum computers face inherent scaling challenges, a fact that necessitates investigation of distributed quantum computing systems, whereby scaling is achieved through interconnection of smaller quantum processing units. However, connecting large numbers of QPUs will eventually result in connectivity constraints at the network level, where the difficulty of entanglement sharing increases with network path lengths. This increases the complexity of the quantum circuit partitioning problem, since the cost of generating entanglement between end nodes varies with network topologies and existing links. We address this challenge using a simple modification to existing partitioning schemes designed for all-to-all connected networks, that efficiently accounts for both of these factors. We investigate the performance in terms of entanglement requirements and optimisation time of various quantum circuits over different network topologies, achieving lower entanglement costs in the majority of cases than state-of-the-art methods. We provide techniques for scaling to large-scale quantum networks employing both network and problem coarsening. We show that coarsened methods can achieve improved solution quality in most cases with significantly lower run-times than direct partitioning methods.

arXiv:2507.16036IEEE International Conference on Quantum Computing and Engineering (QCE)Aug 30, 20255 citations

Optimized Quantum Circuit Partitioning Across Multiple Quantum Processors

Eneet Kaur, Hassan Shapourian, Jiapeng Zhao +3 more

This paper addresses the challenge of scaling quantum computing by employing distributed quantum algorithms across multiple processors. We propose a novel circuit partitioning method that leverages graph partitioning to optimize both qubit and gate teleportation, minimizing the required Einstein-Podolsky-Rosen (EPR) pairs for executing general quantum circuits. Additionally, we formulate an integer linear program to further reduce entanglement requirements by mapping the logical resources of partitioned circuits to the physical constraints of the quantum network. Finally, we analyze the entanglement cost of implementing the Quantum Fourier Transform (QFT) across multiple QPUs, exploiting the circuit's structure to minimize total entanglement consumption.

arXiv:2501.14947Jan 24, 20251 citation

Efficient Execution of Multiple Quantum Circuits Over a Quantum Network

Yukun Yang, Ranjani G. Sundaram, Himanshu Gupta

As quantum computing continues to scale, the ability to execute quantum circuits across distributed quantum networks is becoming increasingly important. While prior work has largely focused on distributing a single circuit to optimize the number of entanglement pairs (EPs) used or the execution time, future applications will require the efficient scheduling and execution of multiple circuits on a shared quantum network. Therefore, we study the problem of efficiently distributing multiple quantum circuits across a shared quantum network under decoherence and network constraints and seek to minimize the execution time required to execute all circuits (makespan). Solving the above problem involves jointly determining when and where each circuit should be executed, and how to schedule concurrent EP generation required to execute remote gates. We propose several algorithmic approaches for this multi-circuit distribution problem and provide theoretical performance guarantees for special cases. To assess the practical effectiveness of our methods, we conduct extensive simulations using the NetSquid quantum network simulator.

IEEE International Conference on Quantum Computing and Engineering (QCE)Aug 30, 20252 citations

A Novel Approach to Quantum Circuit Partitioning

Joseph Clark, Himanshu Thapliyal, Travis S. Humble

Quantum synthesis presents an effective method of circuit optimization, but scales exponentially with the number of qubits in the circuit. This problem can be addressed by partitioning the circuit into blocks with a limited number of qubits. Existing partitioning algorithms make large trade-offs to achieve either high speed or quality. We propose a method of circuit partitioning which is competitive with existing algorithms for both metrics. The proposed method is compared with two existing methods across common circuit architectures, matching an exhaustive solution in performance and a fast solution on time.

IEEE Computer Society Annual Symposium on VLSIJul 1, 20224 citations

Distributed Quantum Computation with Minimum Circuit Execution Time over Quantum Networks

Ranjani G. Sundaram, Himanshu Gupta, C. R. Ramakrishnan

Present quantum computers are constrained by limited qubit capacity and restricted physical connectivity, leading to challenges in large-scale quantum computations. Distributing quantum computations across a network of quantum computers is a promising way to circumvent these challenges and facilitate large quantum computations. However, distributed quantum computations require entanglements (to execute remote gates) which can incur significant generation latency and, thus, lead to decoherence of qubits. In this work, we consider the problem of distributing quantum circuits across a quantum network to minimize the execution time. The problem entails mapping the circuit qubits to network memories, including within each computer since limited connectivity within computers can affect the circuit execution time. We provide two-step solutions for the above problem: In the first step, we allocate qubits to memories to minimize the estimated execution time; for this step, we design an efficient algorithm based on an approximation algorithm for the max-quadratic-assignment problem. In the second step, we determine an efficient execution scheme, including generating required entanglements with minimum latency under the network resource and decoherence constraints; for this step, we develop two algorithms with appropriate performance guarantees under certain settings or assumptions. We consider multiple protocols for executing remote gates, viz., telegates and cat-entanglements. With extensive simulations over NetSquid, a quantum network simulator, we demonstrate the effectiveness of our developed techniques and show that they outperform a scheme based on prior work by up to 95%.

arXiv:2405.07499May 13, 20242 citations