Table of Contents
Fetching ...

Scalable Circuit Cutting and Scheduling in a Resource-constrained and Distributed Quantum System

Shuwen Kan, Zefan Du, Miguel Palma, Samuel A Stein, Chenxu Liu, Wenqi Wei, Juntao Chen, Ang Li, Ying Mao

TL;DR

FitCut presents a scalable, resource-aware approach to circuit cutting and scheduling for distributed quantum systems. By transforming a DAG-based quantum circuit into a gate-based weighted graph and applying constrained, modularity-driven community detection, FitCut partitions circuits into subcircuits that respect per-worker qubit limits. A two-tier objective balances minimizing sampling overhead with maximizing per-worker and system-wide resource utilization, followed by a weighted closest-first scheduling and iterative optimization. Reconstruction guarantees fidelity on par with established circuit-knitting methods, while achieving 3–2000x faster cutting times and up to 3.88x per-worker and 2.86x system-wide improvements, demonstrating practical potential for large-scale distributed quantum computing.

Abstract

Despite quantum computing's rapid development, current systems remain limited in practical applications due to their limited qubit count and quality. Various technologies, such as superconducting, trapped ions, and neutral atom quantum computing technologies are progressing towards a fault tolerant era, however they all face a diverse set of challenges in scalability and control. Recent efforts have focused on multi-node quantum systems that connect multiple smaller quantum devices to execute larger circuits. Future demonstrations hope to use quantum channels to couple systems, however current demonstrations can leverage classical communication with circuit cutting techniques. This involves cutting large circuits into smaller subcircuits and reconstructing them post-execution. However, existing cutting methods are hindered by lengthy search times as the number of qubits and gates increases. Additionally, they often fail to effectively utilize the resources of various worker configurations in a multi-node system. To address these challenges, we introduce FitCut, a novel approach that transforms quantum circuits into weighted graphs and utilizes a community-based, bottom-up approach to cut circuits according to resource constraints, e.g., qubit counts, on each worker. FitCut also includes a scheduling algorithm that optimizes resource utilization across workers. Implemented with Qiskit and evaluated extensively, FitCut significantly outperforms the Qiskit Circuit Knitting Toolbox, reducing time costs by factors ranging from 3 to 2000 and improving resource utilization rates by up to 3.88 times on the worker side, achieving a system-wide improvement of 2.86 times.

Scalable Circuit Cutting and Scheduling in a Resource-constrained and Distributed Quantum System

TL;DR

FitCut presents a scalable, resource-aware approach to circuit cutting and scheduling for distributed quantum systems. By transforming a DAG-based quantum circuit into a gate-based weighted graph and applying constrained, modularity-driven community detection, FitCut partitions circuits into subcircuits that respect per-worker qubit limits. A two-tier objective balances minimizing sampling overhead with maximizing per-worker and system-wide resource utilization, followed by a weighted closest-first scheduling and iterative optimization. Reconstruction guarantees fidelity on par with established circuit-knitting methods, while achieving 3–2000x faster cutting times and up to 3.88x per-worker and 2.86x system-wide improvements, demonstrating practical potential for large-scale distributed quantum computing.

Abstract

Despite quantum computing's rapid development, current systems remain limited in practical applications due to their limited qubit count and quality. Various technologies, such as superconducting, trapped ions, and neutral atom quantum computing technologies are progressing towards a fault tolerant era, however they all face a diverse set of challenges in scalability and control. Recent efforts have focused on multi-node quantum systems that connect multiple smaller quantum devices to execute larger circuits. Future demonstrations hope to use quantum channels to couple systems, however current demonstrations can leverage classical communication with circuit cutting techniques. This involves cutting large circuits into smaller subcircuits and reconstructing them post-execution. However, existing cutting methods are hindered by lengthy search times as the number of qubits and gates increases. Additionally, they often fail to effectively utilize the resources of various worker configurations in a multi-node system. To address these challenges, we introduce FitCut, a novel approach that transforms quantum circuits into weighted graphs and utilizes a community-based, bottom-up approach to cut circuits according to resource constraints, e.g., qubit counts, on each worker. FitCut also includes a scheduling algorithm that optimizes resource utilization across workers. Implemented with Qiskit and evaluated extensively, FitCut significantly outperforms the Qiskit Circuit Knitting Toolbox, reducing time costs by factors ranging from 3 to 2000 and improving resource utilization rates by up to 3.88 times on the worker side, achieving a system-wide improvement of 2.86 times.
Paper Structure (20 sections, 19 equations, 9 figures, 2 tables, 3 algorithms)

This paper contains 20 sections, 19 equations, 9 figures, 2 tables, 3 algorithms.

Figures (9)

  • Figure 1: System Overview
  • Figure 2: An Example of circuit transformation
  • Figure 3: The Graph Representation of $7\times8$ Supremacy Circuit
  • Figure 4: (a) Constrained Community Detection and (b) Subgraph of one Community
  • Figure 5: Merged Graph with SVWs and SEWs
  • ...and 4 more figures