Generalised Circuit Partitioning for Distributed Quantum Computing

Abstract

Distributed quantum computing (DQC) is a new paradigm aimed at scaling up quantum computing via the interconnection of smaller quantum processing units (QPUs). Shared entanglement allows teleportation of both states and gates between QPUs. This leads to an attractive horizontal scaling of quantum processing power, which comes at the expense of the additional time and noise introduced by entanglement sharing protocols. Consequently, methods for partitioning quantum circuits across multiple QPUs should aim to minimise the amount of entanglement-based communication required between distributed QPUs. Existing protocols tend to focus primarily on optimising entanglement costs for gate teleportation or state teleportation to cover operations between QPUs, rather than both at the same time. The most general form of the problem should treat gate and state teleportation on the same footing, allowing minimal cost circuit partitions through a combination of the two. This work introduces a graph-based formulation which allows joint optimisation of gate and state teleportation cost, including extensions of gate teleportation which group gates together for distribution using common resources. The formulation permits low e-bit cost for a variety of circuit types. Using a basic genetic algorithm, improved performance over state-of-the-art methods is obtained in terms of both average e-bit cost and time scaling.

arXiv comment10 pages, 13 figures

References in corpus (10)

• Validating quantum computers using randomized model circuits
• Optimal local implementation of non-local quantum gates
• Quantum remote control: Teleportation of unitary operations
• Towards a Distributed Quantum Computing Ecosystem
• Compiler Design for Distributed Quantum Computing
• Automated distribution of quantum circuits via hypergraph partitioning
• A Modular Quantum Compilation Framework for Distributed Quantum Computing
• Optimized compiler for Distributed Quantum Computing
• Distributing circuits over heterogeneous, modular quantum computing network architectures
• Entanglement-efficient bipartite-distributed quantum computing

Cited by in corpus (6)

• A Multilevel Framework for Partitioning Quantum Circuits
• Entanglement-Efficient Distribution of Quantum Circuits over Large-Scale Quantum Networks
• Time-Aware Qubit Assignment and Circuit Optimization for Distributed Quantum Computing
• Efficient Time-Aware Partitioning of Quantum Circuits for Distributed Quantum Computing
• Evolutionary-Based Circuit Optimization for Distributed Quantum Computing
• Online Job Scheduler for Fault-tolerant Quantum Multiprogramming