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

arXiv:2611.07175

Scalable Transpilation for Overcoming Restricted Connectivity in Distributed Superconducting Quantum Architectures

Afonso Azenha, Ilia Polian, Sebastian Brandhofer

Published Nov 4, 2026• 0 citations
arXivHTMLPDF

Abstract

Distributed Quantum Computing (DQC) offers a promising pathway to scale superconducting quantum hardware, but restricted inter- and intra-module connectivity creates a major transpilation bottleneck. Current DQC transpilation methods often assume idealized hardware connectivity, ignore subsequent intra-module routing, or suffer from substantial computational overheads that limit their applicability at scale. To address this, we introduce a scalable transpilation method tailored for the restricted connectivity of distributed superconducting quantum architectures. Specifically, our quantum interaction graph (QIG) approach couples a graph-partitioning mapping step with a fast SABRE-inspired routing heuristic. On a 48-qubit (3 QPUs $\times$ 16 qubits) architecture with all-to-all inter-core connectivity, our method reduces average aggregated costs by up to 24.72% (unstructured) and 24.01% (structured), while delivering >250$\times$ speed-ups for structured workloads compared to the state-of-the-art DMapS algorithm. On the 399-qubit (3$\times$133) IBM Flamingo, where DMapS times out on dense circuits, our approach maintains practical runtimes. Against a DQC-adapted SABRE baseline, it reduces structured circuit routing costs by up to 51.94% (all-to-all inter-core topology) and 51.96% (restricted line topology). Ultimately, this work delivers a practical transpilation method for DQC at scale.

DOI
10.48550/arxiv.2611.07175

Related papers

DMapS: End-to-End Qubit Mapping and Routing for Distributed Quantum Computing Architectures

Tingyu Luo, Yuzhen Zheng, Yuxin Deng +1 more

Distributed quantum computing (DQC) architectures offer a scalable solution for the computational demands of large-scale quantum computing. In near-term DQC architectures, the costly remote quantum communication and the execution cost within quantum chips together significantly limit the execution efficiency of quantum circuits. To comprehensively optimize both costs, we propose DMapS, which consists of end-to-end algorithms for qubit mapping and routing. The qubit mapping component, DMapS-M, adopts a two-stage mapping strategy that decomposes a large quantum circuit into smaller ones and parallelizes the qubit mapping on quantum chips. The qubit routing component, DMapS-R, reduces remote quantum communication overhead by prioritizing the insertion of local SWAP gates and further improves transpilation efficiency by exploiting parallelism within chips. Our experimental results show that DMapS-M reduces overall overhead (including both remote quantum communication overhead and local SWAP gate overhead) by an average of 43.44% and 59.72%, respectively, compared to two baseline algorithms, and achieves an average speedup of 87.05x. DMapS-R, compared to the baseline algorithm, reduces overall overhead by an average of 8.85% and achieves an average transpilation speedup of 2.78×. Moreover, compared to the DQC-oriented quantum compiler, DMapS reduces remote communication overhead by an average of 75.16%.

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems•Sep 17, 2025•0 citations

Distributed quantum computing via enhanced connectivity

Jiyao Liu

As quantum computing transitions into the Noisy Intermediate-Scale Quantum (NISQ) era, scaling monolithic quantum processors remains a significant challenge due to decoherence and operational noise. This dissertation proposes enhancing the connectivity of distributed quantum systems as a scalable solution, focusing on three major research tasks: architectural co-design, operation scheduling optimization, and network topology design. First, to address the physical qubit limits of single-chip processors, we investigate the co-design of network topology and logical qubit allocation for Distributed Quantum Computing (DQC). By modeling qubit interaction as a graph partition problem, we propose a joint optimization framework to minimize inter-QPU communication overhead. Our results demonstrate that the proposed linearized formulation, TACO-L, significantly outperforms traditional two-stage methods in executing complex quantum circuits. Second, we address the challenge of maintaining high-fidelity long-distance entanglements through the optimization of Swapping and Purification Schemes (SPS). We prove that in Binary systems, any optimal swapping and purification tree (OSPT) must follow a Restricted SPT (RT) pattern, where purification is integrated at the link level prior to swapping. Furthermore, we introduce the gradient-based GradTree algorithm, which enables an efficient search for low-cost, high-fidelity scheduling in complex noise environments. Finally, this dissertation formulates the first general Topology Design Problem (TDP) for quantum networks, jointly optimizing quantum memory allocation, optical channel deployment, and entanglement scheduling. By analyzing flow-based and path-based formulations, we prove the optimality of the Relaxed Complete Swapping Tree (RCST) in minimizing the expected cost of entanglement distribution. Collectively, these contributions provide a comprehensive theoretical and algorithmic framework for building scalable, cost-effective global quantum internet architectures.

•Jun 11, 2026•0 citations

Towards Reproducible Evaluation of Distributed Quantum Circuit Partitioning Algorithms

Javier Vela-Tambo, Davud Azizov, Tian Guo

Distributed Quantum Computing (DQC) addresses the physical scaling limitations of monolithic quantum processors by networking modular Quantum Processing Units (QPUs). Efficient execution of quantum algorithms on DQC architectures requires compiling them across QPUs while minimizing inter-QPU communication bottlenecks, primarily through circuit partitioning. However, current evaluations of state-of-the-art partitioning heuristics focus primarily on the total entanglement cost of the partitions, failing to capture the broader structural and temporal overheads introduced by distributed network constraints. This paper addresses this evaluation gap by applying established monolithic benchmarking metrics to partitioned distributed circuits to quantify the performance impact of network constraints. Using an open-source, automated evaluation pipeline, we systematically assess diverse partitioning algorithms across standardized workloads and quantum network topologies. Our empirical results reveal that partitioning algorithms with comparable entanglement costs can still introduce drastically different physical execution penalties. By exposing these hidden trade-offs, such as severe increases in circuit depth and substantial reductions in gate density, this study demonstrates that comprehensive circuit-level metrics are essential for guiding the future design of DQC compilers.

quant-pharXiv:2608.27099•Aug 28, 2026•0 citations

Efficient Time-Aware Partitioning of Quantum Circuits for Distributed Quantum Computing

Raymond P. H. Wu, Chathu Ranaweera, Sutharshan Rajasegarar +3 more

To overcome the physical limitations of scaling monolithic quantum computers, distributed quantum computing (DQC) interconnects multiple smaller-scale quantum processing units (QPUs) to form a quantum network. However, this approach introduces a critical challenge, namely the high cost of quantum communication between remote QPUs incurred by quantum state teleportation and quantum gate teleportation. To minimize this communication overhead, DQC compilers must strategically partition quantum circuits by mapping logical qubits to distributed physical QPUs. Static graph partitioning methods are fundamentally ill-equipped for this task as they ignore execution dynamics and underlying network topology, while metaheuristics require substantial computational runtime. In this work, we propose a heuristic based on beam search to solve the circuit partitioning problem. Our time-aware algorithm incrementally constructs a low-cost sequence of qubit assignments across successive time steps to minimize overall communication overhead. The time and space complexities of the proposed algorithm scale quadratically with the number of qubits and linearly with circuit depth, offering a significant computational speedup over common metaheuristics. We demonstrate that our proposed algorithm consistently achieves significantly lower communication costs than static baselines across varying circuit sizes, depths, and network topologies, providing an efficient compilation tool for near-term distributed quantum hardware.

quant-pharXiv:2603.04126•International Conference on Quantum Communications, Networking, and Computing (QCNC)•Mar 5, 2026•1 citation

Resource-aware distributed quantum circuits partitioning strategy and transmission cost optimization

Pengcheng Zhu, Zongyuan 宗原 Dai 戴, Lihua Wei +2 more

Abstract To overcome the physical limitations of current quantum hardware in terms of available qubits and connectivity, distributed quantum computing (DQC) has emerged as a promising and scalable paradigm. However, in distributed settings, cross-node qubit interactions incur high communication overhead due to the use of costly quantum communication protocols. Efficient circuit partitioning and transmission cost optimization have thus become key challenges. This work addresses the often-overlooked issues of hardware heterogeneity and redundant transmission by proposing a resource-aware partitioning and transmission cost optimization method for distributed quantum circuits. First, we develop a partitioning framework constrained by qubit resources, which accommodates node capacity differences to enable flexible qubit allocation. Second, we model gate dependencies using a directed acyclic graph (DAG) representation and introduce formal criteria to detect “initial-state” and “final-state” redundancies. A measurement-reset strategy is then employed to replace part of the quantum communication, reducing inter-node data transmission. Experimental results on a variety of benchmark circuits and heterogeneous architectures demonstrate that our method significantly reduces transmission cost and improves overall resource utilization. These findings offer both theoretical insight and practical guidance for efficient distributed quantum computing.

Chinese Physics B•Oct 16, 2025•0 citations

A Scalable Distributed Quantum Optimization Framework via Factor Graph Paradigm

Yuwen Huang, Xiaojun Lin, Bin Luo +1 more

Distributed quantum computing (DQC) connects many small quantum processors into a single logical machine, offering a practical route to scalable quantum computation. However, most existing DQC paradigms are structure-agnostic. Circuit cutting proposed by Peng et al. in [Phys. Rev. Lett., Oct. 2020] reduces per-device qubits at the cost of exponential classical post-processing, while search-space partitioning proposed by Avron et al. in [Phys. Rev. A., Nov. 2021] distributes the workload but weakens Grover's ideal quadratic speedup. In this paper, we introduce a structure-aware framework for distributed quantum optimization that resolves this complexity-resource trade-off. We model the objective function as a factor graph and expose its sparse interaction structure. We cut the graph along its natural ``seams'', i.e., a separator of boundary variables, to obtain loosely coupled subproblems that fit on resource-constrained processors. We coordinate these subproblems with shared entanglement, so the network executes a single globally coherent search rather than independent local searches. We prove that this design preserves Grover-like scaling: for a search space of size $N$, our framework achieves $O(\sqrt{N})$ query complexity up to processors and separator dependent factors, while relaxing the qubit requirement of each processor. We extend the framework with a hierarchical divide-and-conquer strategy that scales to large-scale optimization problems and supports two operating modes: a fully coherent mode for fault-tolerant networks and a hybrid mode that inserts measurements to cap circuit depth on near-term devices. We validate the predicted query-entanglement trade-offs through simulations over diverse network topologies, and we show that structure-aware decomposition delivers a practical path to scalable distributed quantum optimization on quantum networks.

quant-pharXiv:2603.07673•Mar 10, 2026•0 citations
Distributed Quantum Computing (DQC) offers a promising pathway to scale superconducting quantum hardware, but restricted inter- and intra-module connectivity creates a major transpilation bottleneck. Current DQC transpilation methods often assume idealized hardware connectivity, ignore subsequent intra-module routing, or suffer from substantial computational overheads that limit their applicability at scale. To address this, we introduce a scalable transpilation method tailored for the restricted connectivity of distributed superconducting quantum architectures. Specifically, our quantum interaction graph (QIG) approach couples a graph-partitioning mapping step with a fast SABRE-inspired routing heuristic. On a 48-qubit (3 QPUs ×\times× 16 qubits) architecture with all-to-all inter-core connectivity, our method reduces average aggregated costs by up to 24.72% (unstructured) and 24.01% (structured), while delivering >250×\times× speed-ups for structured workloads compared to the state-of-the-art DMapS algorithm. On the 399-qubit (3×\times×133) IBM Flamingo, where DMapS times out on dense circuits, our approach maintains practical runtimes. Against a DQC-adapted SABRE baseline, it reduces structured circuit routing costs by up to 51.94% (all-to-all inter-core topology) and 51.96% (restricted line topology). Ultimately, this work delivers a practical transpilation method for DQC at scale.
Distributed quantum computing (DQC) architectures offer a scalable solution for the computational demands of large-scale quantum computing. In near-term DQC architectures, the costly remote quantum communication and the execution cost within quantum chips together significantly limit the execution efficiency of quantum circuits. To comprehensively optimize both costs, we propose DMapS, which consists of end-to-end algorithms for qubit mapping and routing. The qubit mapping component, DMapS-M, adopts a two-stage mapping strategy that decomposes a large quantum circuit into smaller ones and parallelizes the qubit mapping on quantum chips. The qubit routing component, DMapS-R, reduces remote quantum communication overhead by prioritizing the insertion of local SWAP gates and further improves transpilation efficiency by exploiting parallelism within chips. Our experimental results show that DMapS-M reduces overall overhead (including both remote quantum communication overhead and local SWAP gate overhead) by an average of 43.44% and 59.72%, respectively, compared to two baseline algorithms, and achieves an average speedup of 87.05x. DMapS-R, compared to the baseline algorithm, reduces overall overhead by an average of 8.85% and achieves an average transpilation speedup of 2.78×. Moreover, compared to the DQC-oriented quantum compiler, DMapS reduces remote communication overhead by an average of 75.16%.
As quantum computing transitions into the Noisy Intermediate-Scale Quantum (NISQ) era, scaling monolithic quantum processors remains a significant challenge due to decoherence and operational noise. This dissertation proposes enhancing the connectivity of distributed quantum systems as a scalable solution, focusing on three major research tasks: architectural co-design, operation scheduling optimization, and network topology design. First, to address the physical qubit limits of single-chip processors, we investigate the co-design of network topology and logical qubit allocation for Distributed Quantum Computing (DQC). By modeling qubit interaction as a graph partition problem, we propose a joint optimization framework to minimize inter-QPU communication overhead. Our results demonstrate that the proposed linearized formulation, TACO-L, significantly outperforms traditional two-stage methods in executing complex quantum circuits. Second, we address the challenge of maintaining high-fidelity long-distance entanglements through the optimization of Swapping and Purification Schemes (SPS). We prove that in Binary systems, any optimal swapping and purification tree (OSPT) must follow a Restricted SPT (RT) pattern, where purification is integrated at the link level prior to swapping. Furthermore, we introduce the gradient-based GradTree algorithm, which enables an efficient search for low-cost, high-fidelity scheduling in complex noise environments. Finally, this dissertation formulates the first general Topology Design Problem (TDP) for quantum networks, jointly optimizing quantum memory allocation, optical channel deployment, and entanglement scheduling. By analyzing flow-based and path-based formulations, we prove the optimality of the Relaxed Complete Swapping Tree (RCST) in minimizing the expected cost of entanglement distribution. Collectively, these contributions provide a comprehensive theoretical and algorithmic framework for building scalable, cost-effective global quantum internet architectures.
Distributed Quantum Computing (DQC) addresses the physical scaling limitations of monolithic quantum processors by networking modular Quantum Processing Units (QPUs). Efficient execution of quantum algorithms on DQC architectures requires compiling them across QPUs while minimizing inter-QPU communication bottlenecks, primarily through circuit partitioning. However, current evaluations of state-of-the-art partitioning heuristics focus primarily on the total entanglement cost of the partitions, failing to capture the broader structural and temporal overheads introduced by distributed network constraints. This paper addresses this evaluation gap by applying established monolithic benchmarking metrics to partitioned distributed circuits to quantify the performance impact of network constraints. Using an open-source, automated evaluation pipeline, we systematically assess diverse partitioning algorithms across standardized workloads and quantum network topologies. Our empirical results reveal that partitioning algorithms with comparable entanglement costs can still introduce drastically different physical execution penalties. By exposing these hidden trade-offs, such as severe increases in circuit depth and substantial reductions in gate density, this study demonstrates that comprehensive circuit-level metrics are essential for guiding the future design of DQC compilers.
To overcome the physical limitations of scaling monolithic quantum computers, distributed quantum computing (DQC) interconnects multiple smaller-scale quantum processing units (QPUs) to form a quantum network. However, this approach introduces a critical challenge, namely the high cost of quantum communication between remote QPUs incurred by quantum state teleportation and quantum gate teleportation. To minimize this communication overhead, DQC compilers must strategically partition quantum circuits by mapping logical qubits to distributed physical QPUs. Static graph partitioning methods are fundamentally ill-equipped for this task as they ignore execution dynamics and underlying network topology, while metaheuristics require substantial computational runtime. In this work, we propose a heuristic based on beam search to solve the circuit partitioning problem. Our time-aware algorithm incrementally constructs a low-cost sequence of qubit assignments across successive time steps to minimize overall communication overhead. The time and space complexities of the proposed algorithm scale quadratically with the number of qubits and linearly with circuit depth, offering a significant computational speedup over common metaheuristics. We demonstrate that our proposed algorithm consistently achieves significantly lower communication costs than static baselines across varying circuit sizes, depths, and network topologies, providing an efficient compilation tool for near-term distributed quantum hardware.
Abstract To overcome the physical limitations of current quantum hardware in terms of available qubits and connectivity, distributed quantum computing (DQC) has emerged as a promising and scalable paradigm. However, in distributed settings, cross-node qubit interactions incur high communication overhead due to the use of costly quantum communication protocols. Efficient circuit partitioning and transmission cost optimization have thus become key challenges. This work addresses the often-overlooked issues of hardware heterogeneity and redundant transmission by proposing a resource-aware partitioning and transmission cost optimization method for distributed quantum circuits. First, we develop a partitioning framework constrained by qubit resources, which accommodates node capacity differences to enable flexible qubit allocation. Second, we model gate dependencies using a directed acyclic graph (DAG) representation and introduce formal criteria to detect “initial-state” and “final-state” redundancies. A measurement-reset strategy is then employed to replace part of the quantum communication, reducing inter-node data transmission. Experimental results on a variety of benchmark circuits and heterogeneous architectures demonstrate that our method significantly reduces transmission cost and improves overall resource utilization. These findings offer both theoretical insight and practical guidance for efficient distributed quantum computing.
Distributed quantum computing (DQC) connects many small quantum processors into a single logical machine, offering a practical route to scalable quantum computation. However, most existing DQC paradigms are structure-agnostic. Circuit cutting proposed by Peng et al. in [Phys. Rev. Lett., Oct. 2020] reduces per-device qubits at the cost of exponential classical post-processing, while search-space partitioning proposed by Avron et al. in [Phys. Rev. A., Nov. 2021] distributes the workload but weakens Grover's ideal quadratic speedup. In this paper, we introduce a structure-aware framework for distributed quantum optimization that resolves this complexity-resource trade-off. We model the objective function as a factor graph and expose its sparse interaction structure. We cut the graph along its natural ``seams'', i.e., a separator of boundary variables, to obtain loosely coupled subproblems that fit on resource-constrained processors. We coordinate these subproblems with shared entanglement, so the network executes a single globally coherent search rather than independent local searches. We prove that this design preserves Grover-like scaling: for a search space of size NNN, our framework achieves O(N)O(\sqrt{N})O(N​) query complexity up to processors and separator dependent factors, while relaxing the qubit requirement of each processor. We extend the framework with a hierarchical divide-and-conquer strategy that scales to large-scale optimization problems and supports two operating modes: a fully coherent mode for fault-tolerant networks and a hybrid mode that inserts measurements to cap circuit depth on near-term devices. We validate the predicted query-entanglement trade-offs through simulations over diverse network topologies, and we show that structure-aware decomposition delivers a practical path to scalable distributed quantum optimization on quantum networks.