Sep 2026· IEEE International Conference on Application-Specific Systems, Architectures, and Processors· pp. 77-84· 0 citations· 34 references
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.
Quantum circuit simulation enables the execution of large-scale quantum algorithms by partitioning qubits across multiple computational nodes. However, an inefficient qubit placement leads to excessive inter-node communication, limiting performance and scalability. This work introduces a framework that computes a commu...
Íñigo Aréjula-Aísa, Sergio Iserte, P. Sandås et al.· 2 citations
DPRQ is proposed, a qubit routing algorithm for minimizing inter-node communication in distributed quantum circuits divided into collective communication blocks that employs a dynamic programming-based technique focused on global circuit-level optimization, while capturing inter-block dependencies.
Dhaval Vaidya, Ruozhou Yu· Proceedings of the 3rd ACM S...· 0 citations
Routing-aware pruning is established as a practical and unified compilation strategy across the quantum computing stack and a feasibility analysis on FT hardware indicates that pruning is expected to remain relevant across a range of code distances and physical error rates.
Pau Escofet, C. G. Almudéver, S. Abadal et al.· IEEE Transactions on Circuit...· 0 citations
An algorithm-to-execution framework for low-cost surface-code quantum computing that carries the structure of a computation from hierarchical logical descriptions to circuit-specific spatial organization, non-Clifford resource planning, and physical resource evaluation is developed.
Yun-Xin Tang, Zi-Xuan Huo, Jun-Xiang Huang et al.· 0 citations
This work forms the joint selection of compilations and allocation of shots under per-link Bell-pair capacities as Candidate-Constrained Max-Shot Allocation (CMA), proves it NP-hard, and solves it with a dynamic program and its approximate variant AppDP, a compact MILP, and a greedy heuristic Effi.
Yi-Pei Liu, Sen Zhang, Ze-Bo Yang et al.· 0 citations
A low-overhead fidelity-aware scheduling framework for multi-QPU systems based on a Graph Neural Network that estimates, before compilation, the expected fidelity of each circuit on each available QPU, and a tunable scheduler uses these estimates to control the trade-off between execution fidelity and parallelism.
Innocenzo Fulginiti, Antonio Tudisco, Salvatore Zammuto et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.