Distributed quantum computation is a promising approach to building a fault-tolerant quantum computer at practical scale. To complete program execution within the minimum time, computational resources and communication resources should be assigned to reduce communication cost. Since remote lattice surgery operation between spatially separated quantum computers takes longer than local lattice surgery, minimizing delay due to the remote lattice surgery is a crucial issue to improve performance of distributed quantum computation. This delay is driven by three related issues: assignment of variable qubits to specific nodes; placement of those qubits within the nodes (resulting in contention for the limited number of local qubit movement paths); and contention for inter-node communication resources (both network interface communication qubits and channels) during concurrent operations. Focusing on the second problem, we propose placing qubits near the network interface based on their inter-node communication needs to avoid intra-node path collisions. We evaluate execution time of the VBE ripple-carry adder in a$2 \times 2$grid topology, comparing our proposed qubit assignment approach to random placement. Our results suggest that the proposed model has the potential to reduce resource contention and to improve total execution time.
Distributed quantum computation is a promising approach to building a fault-tolerant quantum computer at practical scale. To complete program execution within the minimum time, computational resources and communication resources should be assigned to reduce communication cost. Since remote lattice surgery operation between spatially separated quantum computers takes longer than local lattice surgery, minimizing delay due to the remote lattice surgery is a crucial issue to improve performance of distributed quantum computation. This delay is driven by three related issues: assignment of variable qubits to specific nodes; placement of those qubits within the nodes (resulting in contention for the limited number of local qubit movement paths); and contention for inter-node communication resources (both network interface communication qubits and channels) during concurrent operations. Focusing on the second problem, we propose placing qubits near the network interface based on their inter-node communication needs to avoid intra-node path collisions. We evaluate execution time of the VBE ripple-carry adder in a2×2grid topology, comparing our proposed qubit assignment approach to random placement. Our results suggest that the proposed model has the potential to reduce resource contention and to improve total execution time.
Practical fault-tolerant quantum computation requires a large number of physical qubits, posing a major challenge for scaling up individual quantum processors. Distributed architectures offer a promising solution by interconnecting multiple processors through quantum networks. However, remote Bell-pair generation remains technically demanding, making it essential to assess computational performance under limited communication resources. In this work, we present a comprehensive resource analysis of distributed fault-tolerant quantum computation using superconducting processors connected by microwave or optical links. We show that even a single physical communication channel per node can substantially reduce the physical-qubit requirements per node under experimentally motivated, forward-looking microwave-link assumptions of a 1 MHz physical Bell-pair generation rate and 90% fidelity, although at the cost of a roughly tenfold increase in execution time. Conversely, reducing the execution-time overhead requires substantially greater communication resources, including higher Bell-pair fidelities and extensive multiplexing. These results demonstrate the potential feasibility of distributed fault-tolerant quantum computation with limited communication resources and provide a quantitative basis for balancing quantum-link performance, processor size, and execution time.
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 communication-aware qubit placement offline, minimizing data exchange among nodes, and selects, before circuit execution, the largest node count whose performance degradation stays below a user-defined threshold. The framework is integrated with the QuEST simulator. Evaluations on synthetic benchmarks and real-world QASMBench circuits show that optimized placements reduce communication and achieve runtime speedups of up to 2.3x over the identity placement, particularly in circuits with sparse, structured interactions. Our results show that qubit placement strongly affects the efficiency of distributed simulation and provide a practical, resource-scalable solution for quantum workload
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.
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) 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. In this paper, we propose a joint optimization framework for network topology design and qubit allocation in DQC to minimize the 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 further improve computational efficiency, we present a partially linearized version of the problem, making it solvable using any classical optimization solver. Extensive simulations on both random and real-world quantum circuits validate the effectiveness of our proposed approach, demonstrating its capability to handle complex quantum circuits while reducing communication costs in DQC.
Distributed quantum computing can potentially address the scalability challenge by networking processors through photon-mediated remote entanglement. Prior approaches assumed that remote Bell pairs require distillation before use, incurring substantial overhead, to achieve sufficiently high fidelity. However, recent results show that lattice-surgery operations at logical qubit boundaries tolerate significantly higher error rates than previously assumed. We quantify the resource trade-offs between distillation overhead and surface-code distance requirements under realistic constraints including probabilistic entanglement generation and memory decoherence. We identify the fidelity crossover point separating the two regimes. Below this threshold, the distillation strategy dominates, reducing resource overhead by up to two orders of magnitude. Above it, no-distillation becomes the more efficient choice, reducing resource overhead by more than half. We briefly describe the application of these methods to ion-trap and neutral-atom platforms. These results provide joint design guidelines for optimizing photonic interconnects and fault-tolerant architectures in distributed quantum computing.