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

IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP)

Efficient Circuit Management and Scheduling in Multi-Node Quantum Systems with Dynamic Links

Zefan Du, Wenrui Zhang, Jake Gesseck, Wenqi Wei, Juntao Chen, Tao Han, Zhiding Liang, Ying Mao

Published Sep 1, 2026• 0 citations
Publisher

Abstract

The realization of practical quantum advantage requires executing large-scale circuits that far exceed the qubit capacity of any single quantum processor. To address this, two primary scaling strategies have emerged: circuit cutting, which utilizes classical resources to decompose circuits into smaller fragments, and multi-node networking, which uses quantum resources like EPR pairs to link hardware. However, these methods present a critical trade-off: circuit cutting incurs a classical reconstruction overhead that grows exponentially as$O\left(4^{K}\right)$with the number of cuts$K$, while EPR-based communication introduces significantly higher noise than local operations, degrading overall fidelity. We present ECLIPSE (Efficient Circuit Management and Link-aware Interconnect Placement and Scheduling for large-scale circuit Execution), a unified framework for multi-node quantum systems. ECLIPSE jointly optimizes circuit partitioning, EPR-pair allocation, noise-aware scheduling, and execution by analyzing the connectivity and gate structure of the input circuit to balance classical sampling overhead against quantum communication noise. ECLIPSE comprises: (1) a Circuit Analyst that identifies subcircuit pairs whose EPR-based merging yields a large reduction in sampling overhead; (2) a System Reconfiguration module that assigns each EPR link to a lownoise physical worker pair; and (3) a Scheduler that distributes subcircuits to workers to reduce cumulative noise impact. We implement ECLIPSE using IBM Qiskit and Quantinuum Pytket and evaluate it on real quantum hardware and multiple emulators. Across these platforms, ECLIPSE outperforms state-of-theart Qiskit-Addon-Cut by up to 16.7% in multi-node fidelity and 40.8% for deep circuits at high EPR success rates, while reducing cumulative overhead by up to 99.5% at 8 workers, thereby enabling practical large-circuit execution on today's distributed quantum systems.

DOI
10.1109/asap71856.2026.00022

Related papers

Efficient Circuit Cutting and Scheduling in a Multi-Node Quantum System with Dynamic EPR Pairs

Zefan Du, Wenrui Zhang, Wenqi Wei +4 more

Despite advancements, current quantum hardware faces significant challenges, including limited qubit counts and high susceptibility to noise, which hinder the execution of large, complex algorithms. To address these limitations, multi-node quantum systems and quantum circuit cutting techniques partition large circuits into smaller subcircuits that can be executed on individual quantum machines and then reconstructed using classical resources. However, these methods introduce new challenges, such as the large overhead from subcircuit reconstruction and additional noise from entangled EPR pairs, especially in multi-node quantum systems. In this paper, we propose the Efficient Circuit Cutting and Scheduling (EC2S) system, which integrates EPR pairs with circuit cutting to address these issues. EC2S improves system performance by transitioning from logical to physical EPR pairs and further reduces computational overhead by minimizing the number of subcircuits during the reconstruction phase. \sol~ is implemented using Qiskit and evaluated on both real quantum hardware and various emulators. Compared to the state-of-the-art Qiskit-Addon-Cut, EC2S achieves significant improvements in fidelity, up to 16.7\%, and reduces system-wide expenditure by up to 99.5\%.

arXiv:2412.18709•Dec 24, 2024•3 citations

Quantum Circuit Partitioning For Effective Utilization of Quantum Resources

Connor Howe, Cristina Radian, Justin Woodring +2 more

Near-term hardware is constrained by high error rates, small qubit counts, and relatively low output fidelity, making the execution of large, high performance quantum circuits difficult. Circuit partitioning (or circuit cutting) has emerged as a promising approach to circumvent these limitations by decomposing circuits into smaller subcircuits at two-qubit interaction points. However, it remains unclear which classes of circuits benefit the most from partitioning and under what hardware conditions it is most effective. In this work, we evaluate the suitability of quantum circuits for partitioning from three perspectives: improving fidelity, enabling distributed execution, and scaling to larger circuit sizes. Specifically, we compare uncut circuit execution against two circuit partitioning approaches: Qiskit's automatic cut finding technique and a custom performance optimized circuit cutting method. We also measure these across GHZ, QFT, brickwork, and random quantum circuits ranging from 4 to 14 qubits, using mean absolute error of expectation values and overall output fidelity. Our results show that partitioning benefits larger, highly interconnected circuits, with our custom method reducing error by up to 55\% and improve fidelity for GHZ circuits, but degrading performance for brickwork circuits at larger scales.

quant-pharXiv:2604.22664•Apr 27, 2026•0 citations

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

Shuwen Kan, Zefan Du, Miguel Palma +6 more

Despite rapid developments in quantum computing, current systems remain limited in practical applications due to their constrained qubit counts and quality. Technologies such as superconducting, trapped ions, and neutral atom quantum computing are progressing towards fault tolerance. However, they face challenges in scalability and control. Recent efforts have concentrated on multi-node quantum systems that connect smaller quantum devices to execute larger circuits. Future demonstrations aim to utilize quantum channels for system coupling, but current methods often resort to classical communication with circuit cutting techniques. This involves dividing large circuits into smaller subcircuits and reconstructing them after execution. Existing cutting methods face challenges such as lengthy search times with increasing numbers of qubits and gates. Moreover, they often struggle to efficiently use resources across various worker configurations in a multi-node system. To address these challenges, we propose FitCut, a novel approach that transforms quantum circuits into weighted graphs. FitCut employs a community-based, bottom-up approach to cut circuits based on resource constraints such as qubit counts on each worker. Additionally, it includes a scheduling algorithm that optimizes resource utilization across workers. Implemented with Qiskit and evaluated extensively, FitCut significantly outperforms existing tools such as Qiskit Circuit Knitting Toolbox, reducing time costs by factors ranging from 3 to 2000 and improving resource utilization rates by up to 388% on the worker side, leading to a system-wide improvement of 286% in accumulated circuit depth.

arXiv:2405.04514•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•25 citations

Resource-Aware Scheduling for Distributed Quantum Computing

Connor Howe, Raghav Mundada, Jake O'Shaughnessy +2 more

Distributed quantum computing (DQC) is a promising near-term approach for executing circuits that exceed the capacity of a single quantum processing unit (QPU). Prior work has made significant progress on circuit partitioning and reconstruction, but practical DQC requires more than cutting a circuit into smaller pieces. A runtime system must determine whether to execute the circuit intact, cut it for sequential execution on one QPU, or distribute it across multiple QPUs, while accounting for queueing, communication, reconstruction, and hardware constraints. We present a resource-aware scheduler for DQC that compares these execution alternatives at runtime using explicit models of QPU execution, communication, and host-side reconstruction, together with hardware-informed timing derived from simulated IBM QPUs. By treating communication and reconstruction as first-class scheduling costs, the scheduler selects execution plans using a more realistic view of end-to-end overhead than cutting-only approaches. Across our experiments, reconstruction accounts for over 83% of cutting overhead, distributed execution reduces P90 latency by up to 39% relative to uncut single-QPU execution, and scheduling overhead itself remains negligible, never exceeding 0.038% of end-to-end job latency. Together, these results show that DQC must be treated as a runtime scheduling problem over both quantum and classical resources, not just circuit partitioning.

arXiv:2610.30482•Oct 21, 2026•0 citations

Reducing Maximum Subcircuits Depth in Quantum Circuit Cutting

Milad Eslaminia, Sébastien Le Beux

Noisy intermediate-scale quantum (NISQ) devices with limited qubit count and connectivity limit the scale of quantum circuits that can be executed. Circuit cutting methods simulate larger quantum computers by decomposing large circuits into small subcircuits that can be executed on NISQ hardware. Existing circuit cutting methods only consider the qubit count of the target hardware for finding the locations of cuts on the circuits. This can result in deeper subcircuits after mapping on the hardware. Fidelity decays exponentially with circuit depth and diminishes the quality of execution. We propose a circuit-cutting framework that reduces variance in the depth of subcircuits after mapping to the hardware. Our method formulates the initial circuit cutting as a multi-objective optimization problem based on an evolutionary search method with the number of cuts and the maximum depth of individual routed subcircuits as fitness objectives. This method is implemented as an extension to the existing Qiskit Circuit Cutting Addon, which allows for integration in existing flows. Our approach achieves reductions in routed subcircuit depth of up to 9.9% across benchmark circuits compared with baseline methods.

IEEE Transactions on Quantum Engineering•Jan 1, 2026•0 citations

Hardware-aware Circuit Cutting and Distributed Qubit Mapping for Connected Quantum Systems

Zefan Du, Y.-W. Li, Mo, Zijian +4 more

Quantum computing offers unparalleled computational capabilities but faces significant challenges, including limited qubit counts, diverse hardware topologies, and dynamic noise/error rates, which hinder scalability and reliability. Distributed quantum computing, particularly chip-to-chip connections, has emerged as a solution by interconnecting multiple processors to collaboratively execute large circuits. While hardware advancements, such as IBM's Quantum Flamingo, focus on improving inter-chip fidelity, limited research addresses efficient circuit cutting and qubit mapping in distributed systems. This project introduces DisMap, a self-adaptive, hardware-aware framework for chip-to-chip distributed quantum systems. DisMap analyzes qubit noise and error rates to construct a virtual system topology, guiding circuit partitioning, and distributed qubit mapping to minimize SWAP overhead and enhance fidelity. Implemented with IBM Qiskit and compared with the state-of-the-art, DisMap achieves up to a 20.8\% improvement in fidelity and reduces SWAP overhead by as much as 80.2\%, demonstrating scalability and effectiveness in extensive evaluations on real quantum hardware topologies.

arXiv:2412.18458•Dec 24, 2024•6 citations
The realization of practical quantum advantage requires executing large-scale circuits that far exceed the qubit capacity of any single quantum processor. To address this, two primary scaling strategies have emerged: circuit cutting, which utilizes classical resources to decompose circuits into smaller fragments, and multi-node networking, which uses quantum resources like EPR pairs to link hardware. However, these methods present a critical trade-off: circuit cutting incurs a classical reconstruction overhead that grows exponentially asO(4K)O\left(4^{K}\right)O(4K)with the number of cutsKKK, while EPR-based communication introduces significantly higher noise than local operations, degrading overall fidelity. We present ECLIPSE (Efficient Circuit Management and Link-aware Interconnect Placement and Scheduling for large-scale circuit Execution), a unified framework for multi-node quantum systems. ECLIPSE jointly optimizes circuit partitioning, EPR-pair allocation, noise-aware scheduling, and execution by analyzing the connectivity and gate structure of the input circuit to balance classical sampling overhead against quantum communication noise. ECLIPSE comprises: (1) a Circuit Analyst that identifies subcircuit pairs whose EPR-based merging yields a large reduction in sampling overhead; (2) a System Reconfiguration module that assigns each EPR link to a lownoise physical worker pair; and (3) a Scheduler that distributes subcircuits to workers to reduce cumulative noise impact. We implement ECLIPSE using IBM Qiskit and Quantinuum Pytket and evaluate it on real quantum hardware and multiple emulators. Across these platforms, ECLIPSE outperforms state-of-theart Qiskit-Addon-Cut by up to 16.7% in multi-node fidelity and 40.8% for deep circuits at high EPR success rates, while reducing cumulative overhead by up to 99.5% at 8 workers, thereby enabling practical large-circuit execution on today's distributed quantum systems.
Despite advancements, current quantum hardware faces significant challenges, including limited qubit counts and high susceptibility to noise, which hinder the execution of large, complex algorithms. To address these limitations, multi-node quantum systems and quantum circuit cutting techniques partition large circuits into smaller subcircuits that can be executed on individual quantum machines and then reconstructed using classical resources. However, these methods introduce new challenges, such as the large overhead from subcircuit reconstruction and additional noise from entangled EPR pairs, especially in multi-node quantum systems. In this paper, we propose the Efficient Circuit Cutting and Scheduling (EC2S) system, which integrates EPR pairs with circuit cutting to address these issues. EC2S improves system performance by transitioning from logical to physical EPR pairs and further reduces computational overhead by minimizing the number of subcircuits during the reconstruction phase. \sol~ is implemented using Qiskit and evaluated on both real quantum hardware and various emulators. Compared to the state-of-the-art Qiskit-Addon-Cut, EC2S achieves significant improvements in fidelity, up to 16.7\%, and reduces system-wide expenditure by up to 99.5\%.
Near-term hardware is constrained by high error rates, small qubit counts, and relatively low output fidelity, making the execution of large, high performance quantum circuits difficult. Circuit partitioning (or circuit cutting) has emerged as a promising approach to circumvent these limitations by decomposing circuits into smaller subcircuits at two-qubit interaction points. However, it remains unclear which classes of circuits benefit the most from partitioning and under what hardware conditions it is most effective. In this work, we evaluate the suitability of quantum circuits for partitioning from three perspectives: improving fidelity, enabling distributed execution, and scaling to larger circuit sizes. Specifically, we compare uncut circuit execution against two circuit partitioning approaches: Qiskit's automatic cut finding technique and a custom performance optimized circuit cutting method. We also measure these across GHZ, QFT, brickwork, and random quantum circuits ranging from 4 to 14 qubits, using mean absolute error of expectation values and overall output fidelity. Our results show that partitioning benefits larger, highly interconnected circuits, with our custom method reducing error by up to 55\% and improve fidelity for GHZ circuits, but degrading performance for brickwork circuits at larger scales.
Despite rapid developments in quantum computing, current systems remain limited in practical applications due to their constrained qubit counts and quality. Technologies such as superconducting, trapped ions, and neutral atom quantum computing are progressing towards fault tolerance. However, they face challenges in scalability and control. Recent efforts have concentrated on multi-node quantum systems that connect smaller quantum devices to execute larger circuits. Future demonstrations aim to utilize quantum channels for system coupling, but current methods often resort to classical communication with circuit cutting techniques. This involves dividing large circuits into smaller subcircuits and reconstructing them after execution. Existing cutting methods face challenges such as lengthy search times with increasing numbers of qubits and gates. Moreover, they often struggle to efficiently use resources across various worker configurations in a multi-node system. To address these challenges, we propose FitCut, a novel approach that transforms quantum circuits into weighted graphs. FitCut employs a community-based, bottom-up approach to cut circuits based on resource constraints such as qubit counts on each worker. Additionally, it includes a scheduling algorithm that optimizes resource utilization across workers. Implemented with Qiskit and evaluated extensively, FitCut significantly outperforms existing tools such as Qiskit Circuit Knitting Toolbox, reducing time costs by factors ranging from 3 to 2000 and improving resource utilization rates by up to 388% on the worker side, leading to a system-wide improvement of 286% in accumulated circuit depth.
Distributed quantum computing (DQC) is a promising near-term approach for executing circuits that exceed the capacity of a single quantum processing unit (QPU). Prior work has made significant progress on circuit partitioning and reconstruction, but practical DQC requires more than cutting a circuit into smaller pieces. A runtime system must determine whether to execute the circuit intact, cut it for sequential execution on one QPU, or distribute it across multiple QPUs, while accounting for queueing, communication, reconstruction, and hardware constraints. We present a resource-aware scheduler for DQC that compares these execution alternatives at runtime using explicit models of QPU execution, communication, and host-side reconstruction, together with hardware-informed timing derived from simulated IBM QPUs. By treating communication and reconstruction as first-class scheduling costs, the scheduler selects execution plans using a more realistic view of end-to-end overhead than cutting-only approaches. Across our experiments, reconstruction accounts for over 83% of cutting overhead, distributed execution reduces P90 latency by up to 39% relative to uncut single-QPU execution, and scheduling overhead itself remains negligible, never exceeding 0.038% of end-to-end job latency. Together, these results show that DQC must be treated as a runtime scheduling problem over both quantum and classical resources, not just circuit partitioning.
Noisy intermediate-scale quantum (NISQ) devices with limited qubit count and connectivity limit the scale of quantum circuits that can be executed. Circuit cutting methods simulate larger quantum computers by decomposing large circuits into small subcircuits that can be executed on NISQ hardware. Existing circuit cutting methods only consider the qubit count of the target hardware for finding the locations of cuts on the circuits. This can result in deeper subcircuits after mapping on the hardware. Fidelity decays exponentially with circuit depth and diminishes the quality of execution. We propose a circuit-cutting framework that reduces variance in the depth of subcircuits after mapping to the hardware. Our method formulates the initial circuit cutting as a multi-objective optimization problem based on an evolutionary search method with the number of cuts and the maximum depth of individual routed subcircuits as fitness objectives. This method is implemented as an extension to the existing Qiskit Circuit Cutting Addon, which allows for integration in existing flows. Our approach achieves reductions in routed subcircuit depth of up to 9.9% across benchmark circuits compared with baseline methods.
Quantum computing offers unparalleled computational capabilities but faces significant challenges, including limited qubit counts, diverse hardware topologies, and dynamic noise/error rates, which hinder scalability and reliability. Distributed quantum computing, particularly chip-to-chip connections, has emerged as a solution by interconnecting multiple processors to collaboratively execute large circuits. While hardware advancements, such as IBM's Quantum Flamingo, focus on improving inter-chip fidelity, limited research addresses efficient circuit cutting and qubit mapping in distributed systems. This project introduces DisMap, a self-adaptive, hardware-aware framework for chip-to-chip distributed quantum systems. DisMap analyzes qubit noise and error rates to construct a virtual system topology, guiding circuit partitioning, and distributed qubit mapping to minimize SWAP overhead and enhance fidelity. Implemented with IBM Qiskit and compared with the state-of-the-art, DisMap achieves up to a 20.8\% improvement in fidelity and reduces SWAP overhead by as much as 80.2\%, demonstrating scalability and effectiveness in extensive evaluations on real quantum hardware topologies.