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

International Wireless Communications and Mobile Computing Conference (IWCMC)

Cost-Aware Quantum Bit Mapping for Distributed Quantum Computing

Furong Zhan, X G 晓光 Wang 王, Yangming Zhao, HJ Xu

Published Jun 1, 2026• 0 citations
Publisher

Abstract

In this paper, we aim to minimize the total cost (an abstraction of the required resources) of running a task in Distributed Quantum Computing (DQC) systems by optimizing qubit mapping. This problem is challenging since it is a generalized Quadratic Assignment Problem (QAP), which is NP-hard even for finding a solution with a constant approximation ratio. To tackle this challenge, we propose an approach named Cost-aware Qubit Mapping (CQM) to solve the qubit mapping problem in three phases. More specifically, we first partition all qubits into several clusters and then aggregate qubits onto fewer Quantum Processing Units (QPUs). In the last phase, a local refinement scheme is used to further reduce the total cost of running a DQC task. Extensive simulations show that CQM can save up to 24.03% of the cost compared with existing algorithms based on graph partition.

DOI
10.1109/iwcmc69287.2026.11580025

Related papers

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

Time-Aware Qubit Assignment and Circuit Optimization for Distributed Quantum Computing

Leo Sünkel, Jonas Stein, Maximilian Zorn +2 more

The emerging paradigm of distributed quantum computing promises a potential solution to scaling quantum computing to currently unfeasible dimensions. While this approach itself is still in its infancy, and many obstacles must still be overcome before its physical implementation, challenges from the software and algorithmic side must also be identified and addressed. For instance, this paradigm shift requires a new form of compiler that considers the network constraints in general as well as phenomena arising due to the nature of quantum communication. In distributed quantum computing, large circuits are divided into smaller subcircuits such that they can be executed individually and simultaneously on multiple QPUs that are connected through quantum channels. As quantum communication, for example, in the form of teleportation, is expensive, it must be used sparingly. We address the problem of assigning qubits to QPUs to minimize communication costs in two different ways. First by applying time-aware algorithms that take into account the changing connectivity of a given circuit as well as the underlying network topology. We define the optimization problem, use simulated annealing and an evolutionary algorithm and compare the results to graph partitioning and sequential qubit assignment baselines. In another approach, we propose an evolutionary-based quantum circuit optimization algorithm that adjusts the circuit itself rather than the schedule to reduce the overall communication cost. We evaluate the techniques against random circuits and different network topologies. Both evolutionary algorithms outperform the baseline in terms of communication cost reduction. We give an outlook on how the approaches can be integrated into a compilation framework for distributed quantum computing.

arXiv:2507.11707•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•3 citations

Optimizing Compilation for Distributed Quantum Computing via Clustering and Annealing

Ruilin Zhou, Jinglei Cheng, Yuhang Gan +2 more

Efficiently mapping quantum programs onto Distributed quantum computing (DQC) are challenging, particularly when considering the heterogeneous quantum processing units (QPUs) with different structures. In this paper, we present a comprehensive compilation framework that addresses these challenges with three key insights: exploiting structural patterns within quantum circuits, using clustering for initial qubit placement, and adjusting qubit mapping with annealing algorithms. Experimental results demonstrate the effectiveness of our methods and the capability to handle complex heterogeneous distributed quantum systems. Our evaluation shows that our method reduces the objective value at most 88.40% compared to the baseline.

arXiv:2508.15267•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•2 citations

Minimizing Qubit Overhead in Error-Aware Distributed Quantum Computing

Ranjani G. Sundaram, Himanshu Gupta

Scaling fault-tolerant quantum computing to practical advantage requires distributing quantum circuits across networks of heterogeneous processors. However, managing physical qubit overhead while satisfying strict logical error targets remains a critical bottleneck. We introduce the Error-Aware Distributed Quantum Computing (EA-DQC) problem, a unified framework for minimizing the physical footprint of distributed circuits under global error and per-processor capacity constraints. To drive our algorithm design and enable formal performance guarantees, we leverage an aggregation model that frames single-qubit allocation as a Generalized Assignment Problem (GAP), allowing us to prove the optimality of our main algorithm (BPF) in several hardware-specific cases. We also consider the generalized setting of multi-qubit block-encodings, which introduce sub-additive costs and non-monotonic scaling that break standard assignment frameworks, necessitating a density-aware algorithm (BCF-Set) to exploit synergistic resource efficiencies. We evaluate our framework on a diverse set of synthetic and benchmark circuits (QFT, QPE, GHZ) across heterogeneous network topologies. Our results show that our combinatorial heuristics achieve up to a 50% reduction in physical-qubit overhead compared to stochastic baselines such as Simulated Annealing. This work provides a rigorous bridge between quantum error correction and classical optimization, offering a scalable path for resource-efficient faulttolerant distributed quantum architectures.

IEEE International Conference on Distributed Computing Systems (ICDCS)•Jun 1, 2026•0 citations

Joint Optimization of Circuit Transformation and Qubit Mapping for Distributed Quantum Computing

Xiangzhi Zhang, Xu Xu, Ying Liu +3 more

Distributed Quantum Computing (DQC) scales quantum computing capabilities by interconnecting multiple Quantum Processing Units (QPUs) for collaborative computation, but faces the critical challenge of high entanglement costs associated with remote gate operations. Circuit transformation and qubit mapping are critical components of quantum circuit compilation for minimizing entanglement cost, which are interdependent in DQC. Existing approaches that treat circuit transformation and qubit mapping as separate optimization problems fail to account for their fundamental interdependence, resulting in suboptimal entanglement utilization and degraded performance. This paper presents the first optimization framework for circuit transformation and qubit mapping tailored for DQC. To address this joint optimization problem, we propose Qmactr, a two-phase reinforcement learning approach. The first phase trains a qubit mapping agent, and the second phase trains a circuit transformation agent that utilizes the mapping agent as a reward oracle. Extensive evaluation results demonstrate that the proposed approach reduces entanglement consumption by up to 35% compared to state-of-the-art sequential methods while achieving superior circuit fidelity.

IEEE Conference on Computer Communications (INFOCOM)•May 18, 2026•2 citations

Handling Qubit Allocation and Topology Design at Scale for Distributed Quantum Computing

Jiyao Liu, Lei Fan, Yuanxiong Guo +2 more

Distributed Quantum Computing (DQC) enables the execution of quantum circuits across multiple interconnected quantum processing units (QPUs) but requiring efficient qubit allocation and network topology design to optimize computational performance. Proper qubit allocation minimizes entanglement costs across QPUs, balances computational workload, and ensures efficient execution of quantum computing tasks. Meanwhile, network topology plays a crucial role in reducing entanglement routing complexity and communication overhead for remote quantum gate operations. Therefore, in this paper, we propose a joint optimization framework for network topology design and qubit allocation in DQC to minimize communication overhead. We formulate the problem as a tractable integer nonlinear programming model that explicitly incorporates entanglement routing, thereby ensuring a more tractable optimization process. To improve computational efficiency, we present a partially linearized version of the problem, making it solvable using any classical optimization solver. To further address the scheduling of large-scale quantum circuits, we develop heuristics from edge contraction in the qubit interaction graph to pre-assign groups of qubits to QPUs, ensuring that our method remains effective at scale. Extensive simulations on real-world quantum circuits over various quantum clusters or distributed quantum networks validate the effectiveness of our proposed approach, demonstrating its capability to handle complex quantum circuits while reducing communication costs in DQC.

IEEE Transactions on Networking•Jan 1, 2026•0 citations
In this paper, we aim to minimize the total cost (an abstraction of the required resources) of running a task in Distributed Quantum Computing (DQC) systems by optimizing qubit mapping. This problem is challenging since it is a generalized Quadratic Assignment Problem (QAP), which is NP-hard even for finding a solution with a constant approximation ratio. To tackle this challenge, we propose an approach named Cost-aware Qubit Mapping (CQM) to solve the qubit mapping problem in three phases. More specifically, we first partition all qubits into several clusters and then aggregate qubits onto fewer Quantum Processing Units (QPUs). In the last phase, a local refinement scheme is used to further reduce the total cost of running a DQC task. Extensive simulations show that CQM can save up to 24.03% of the cost compared with existing algorithms based on graph partition.
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.
The emerging paradigm of distributed quantum computing promises a potential solution to scaling quantum computing to currently unfeasible dimensions. While this approach itself is still in its infancy, and many obstacles must still be overcome before its physical implementation, challenges from the software and algorithmic side must also be identified and addressed. For instance, this paradigm shift requires a new form of compiler that considers the network constraints in general as well as phenomena arising due to the nature of quantum communication. In distributed quantum computing, large circuits are divided into smaller subcircuits such that they can be executed individually and simultaneously on multiple QPUs that are connected through quantum channels. As quantum communication, for example, in the form of teleportation, is expensive, it must be used sparingly. We address the problem of assigning qubits to QPUs to minimize communication costs in two different ways. First by applying time-aware algorithms that take into account the changing connectivity of a given circuit as well as the underlying network topology. We define the optimization problem, use simulated annealing and an evolutionary algorithm and compare the results to graph partitioning and sequential qubit assignment baselines. In another approach, we propose an evolutionary-based quantum circuit optimization algorithm that adjusts the circuit itself rather than the schedule to reduce the overall communication cost. We evaluate the techniques against random circuits and different network topologies. Both evolutionary algorithms outperform the baseline in terms of communication cost reduction. We give an outlook on how the approaches can be integrated into a compilation framework for distributed quantum computing.
Efficiently mapping quantum programs onto Distributed quantum computing (DQC) are challenging, particularly when considering the heterogeneous quantum processing units (QPUs) with different structures. In this paper, we present a comprehensive compilation framework that addresses these challenges with three key insights: exploiting structural patterns within quantum circuits, using clustering for initial qubit placement, and adjusting qubit mapping with annealing algorithms. Experimental results demonstrate the effectiveness of our methods and the capability to handle complex heterogeneous distributed quantum systems. Our evaluation shows that our method reduces the objective value at most 88.40% compared to the baseline.
Scaling fault-tolerant quantum computing to practical advantage requires distributing quantum circuits across networks of heterogeneous processors. However, managing physical qubit overhead while satisfying strict logical error targets remains a critical bottleneck. We introduce the Error-Aware Distributed Quantum Computing (EA-DQC) problem, a unified framework for minimizing the physical footprint of distributed circuits under global error and per-processor capacity constraints. To drive our algorithm design and enable formal performance guarantees, we leverage an aggregation model that frames single-qubit allocation as a Generalized Assignment Problem (GAP), allowing us to prove the optimality of our main algorithm (BPF) in several hardware-specific cases. We also consider the generalized setting of multi-qubit block-encodings, which introduce sub-additive costs and non-monotonic scaling that break standard assignment frameworks, necessitating a density-aware algorithm (BCF-Set) to exploit synergistic resource efficiencies. We evaluate our framework on a diverse set of synthetic and benchmark circuits (QFT, QPE, GHZ) across heterogeneous network topologies. Our results show that our combinatorial heuristics achieve up to a 50% reduction in physical-qubit overhead compared to stochastic baselines such as Simulated Annealing. This work provides a rigorous bridge between quantum error correction and classical optimization, offering a scalable path for resource-efficient faulttolerant distributed quantum architectures.
Distributed Quantum Computing (DQC) scales quantum computing capabilities by interconnecting multiple Quantum Processing Units (QPUs) for collaborative computation, but faces the critical challenge of high entanglement costs associated with remote gate operations. Circuit transformation and qubit mapping are critical components of quantum circuit compilation for minimizing entanglement cost, which are interdependent in DQC. Existing approaches that treat circuit transformation and qubit mapping as separate optimization problems fail to account for their fundamental interdependence, resulting in suboptimal entanglement utilization and degraded performance. This paper presents the first optimization framework for circuit transformation and qubit mapping tailored for DQC. To address this joint optimization problem, we propose Qmactr, a two-phase reinforcement learning approach. The first phase trains a qubit mapping agent, and the second phase trains a circuit transformation agent that utilizes the mapping agent as a reward oracle. Extensive evaluation results demonstrate that the proposed approach reduces entanglement consumption by up to 35% compared to state-of-the-art sequential methods while achieving superior circuit fidelity.
Distributed Quantum Computing (DQC) enables the execution of quantum circuits across multiple interconnected quantum processing units (QPUs) but requiring efficient qubit allocation and network topology design to optimize computational performance. Proper qubit allocation minimizes entanglement costs across QPUs, balances computational workload, and ensures efficient execution of quantum computing tasks. Meanwhile, network topology plays a crucial role in reducing entanglement routing complexity and communication overhead for remote quantum gate operations. Therefore, in this paper, we propose a joint optimization framework for network topology design and qubit allocation in DQC to minimize communication overhead. We formulate the problem as a tractable integer nonlinear programming model that explicitly incorporates entanglement routing, thereby ensuring a more tractable optimization process. To improve computational efficiency, we present a partially linearized version of the problem, making it solvable using any classical optimization solver. To further address the scheduling of large-scale quantum circuits, we develop heuristics from edge contraction in the qubit interaction graph to pre-assign groups of qubits to QPUs, ensuring that our method remains effective at scale. Extensive simulations on real-world quantum circuits over various quantum clusters or distributed quantum networks validate the effectiveness of our proposed approach, demonstrating its capability to handle complex quantum circuits while reducing communication costs in DQC.