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 Transactions on Networking

A Nonblocking Multistage Switching Network for Distributed Quantum Computing

Yu Liu, Yingling Mao, Xu Xu, Xiaojun Shang, Fan Ye, Yuanyuan Yang

Published Feb 27, 2025• 6 citations
Publisher

Abstract

Quantum computing, utilizing the unique properties of quantum mechanics, has the potential to revolutionize various fields. However, current quantum processors face challenges in scaling the number of qubits, limiting their practical applications. In response, Distributed Quantum Computing (DQC) has emerged as a promising paradigm where multiple interconnected Quantum Processing Units (QPUs) collaborate to execute quantum circuits. In this paper, we focus on designing networks to interconnect QPUs for the implementation of DQC. We find that in real-world experiments and systems, the photon collection and coupling efficiency is low, leading to significant performance degradation in direct connection networks. To address this limitation, we propose a novel multistage switching network tailored for DQC, which has low system complexity and high entanglement generation rates. The proposed switching network comprises$\log _{2}(N)$stages and$N/2$binary switches at each stage, where N represents the number of QPUs. We prove that the proposed network is nonblocking and develop an efficient routing algorithm with a time complexity of$\mathcal {O}(N\log (N))$. Additionally, we show the success probability of entanglement generation in the proposed switching network. Extensive simulations demonstrate that our network significantly outperforms the highly efficient circuit-switching Beneš network and three direct connection networks.

DOI
10.1109/ton.2025.3544319

Related papers

Performance Analysis of Interconnection Networks for Distributed Quantum Computing

Yingling Mao, Yu Liu, Xu Xu +2 more

Quantum computing has the potential to solve complicated problems that are impossible for classical servers. Nevertheless, the applications of current quantum processors are restricted by their limited qubit capacity. Distributed Quantum Computing (DQC) is promising to scale up the computing capability by interconnecting quantum processors and performing computing collectively. The network interconnecting quantum processors can impact the efficiency of DQC. In this paper, we analyze and compare the performance of various interconnection networks for DQC. First, we meticulously derive the success probabilities of entanglement generation and the fidelity of shared Bell states generated within three typical static networks: line, ring, and grid. In addition, we propose a switching network with a minimal number of switch stages and evaluate its performance in terms of probability and fidelity. Moreover, we conduct extensive simulations based on real-world parameters to compare the static and switching networks, and the results reveal that the switching network performs better and is more scalable.

Globecom•Dec 8, 2024•3 citations

Co-Design of Network Topology and Qubit Allocation 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. 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.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Mar 31, 2025•7 citations

Network Topology Design for Distributed Quantum Computing

Yingling Mao, Yu Liu, Xiaojun Shang +1 more

Distributed Quantum Computing (DQC) has the potential to solve industrial large-scale problems by connecting multiple small quantum processors together to form a larger computing system. Concerning the emerging distributed paradigm, a pivotal challenge lies in crafting specialized network topologies to establish efficient connections among quantum processors while minimizing communication costs. In this paper, we propose a novel DQC topology generation algorithm (DQC-TG) to create optimal and near-optimal network topologies for homogeneous and heterogeneous quantum computers, respectively. Furthermore, for specific quantum circuits requiring diverse communication demands between each pair of qubits, we extend the original algorithm into DQC- TG- Plus to design network topologies tailored for these circuits to further enhance the performance. We perform extensive simulations to evaluate the superiority of the generated network topology designs by our algorithms to baselines.

IEEE International Conference on Distributed Computing Systems (ICDCS)•Jul 23, 2024•7 citations

Evaluating Variational Quantum Circuit Architectures for Distributed Quantum Computing

Leo Sünkel, Jonas Stein, Jonas Nüßlein +2 more

Scaling quantum computers, i.e., quantum processing units (QPUs) to enable the execution of large quantum circuits is a major challenge, especially for applications that should provide a quantum advantage over classical algorithms. One approach to scale QPUs is to connect multiple machines through quantum and classical channels to form clusters or even quantum networks. Using this paradigm, several smaller QPUs can collectively execute circuits that each would not be able on its own. However, communication between QPUs is costly as it requires generating and maintaining entanglement, and hence it should be used wisely. In this paper, we evaluate the architectures, and in particular the entanglement patterns, of variational quantum circuits in a distributed quantum computing (DQC) setting. That is, using Qiskit, we simulate the execution of an eight qubit circuit using four QPUs each with two computational and two communication qubits where non-local CX-gates are performed using the remote-CX protocol. We compare the performance of various circuits on a binary classification task where training is executed under ideal and testing under noisy conditions. The study provides initial results on suitable VQC architectures for the DQC paradigm, and indicates that a standard VQC baseline is not always the best choice, and alternative architectures that use entanglement between QPUs sparingly deliver better results under noise.

arXiv:2509.12005•IEEE International Conference on Quantum Artificial Intelligence (QAI)•Nov 2, 2025•4 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

Simulation of Distributed Quantum Computing based on Teleportation

Benedikt Baier, Leo Sünkel, Wolfgang Kellerer

Distributed quantum computing (DQC) uses quantum communication to pool the computational power of multiple quantum processors (QPU). Since qubits in a DQC system are not necessarily co-located, interactions between non-co-located qubits require quantum teleportation, which relies on entanglement to transfer qubit states between distant nodes. As DQC typically requires many teleportations, quantum networks must efficiently generate and distribute high-fidelity entanglement to enable these teleportations. However, since large-scale quantum networks are not yet available, simulations are essential to understand their impact on DQC performance. This paper presents a simulation-based evaluation of teleportation-based DQC under varying real-world network conditions and two distribution schemes. Network parameters such as maximum connection length, entanglement fidelity, and quantum memory coherence time are evaluated using two small-scale Grover circuits to show the impact on computational fidelity and execution delay. The results show that computation fidelity drops sharply below practical thresholds when entanglement fidelity falls below 0.95 or memory coherence is under 1s. Additionally, a runtime analysis shows a 32 times increase in simulation time when both circuit width and circuit depth are increased.

International Conference on Communications•May 24, 2026•0 citations
Quantum computing, utilizing the unique properties of quantum mechanics, has the potential to revolutionize various fields. However, current quantum processors face challenges in scaling the number of qubits, limiting their practical applications. In response, Distributed Quantum Computing (DQC) has emerged as a promising paradigm where multiple interconnected Quantum Processing Units (QPUs) collaborate to execute quantum circuits. In this paper, we focus on designing networks to interconnect QPUs for the implementation of DQC. We find that in real-world experiments and systems, the photon collection and coupling efficiency is low, leading to significant performance degradation in direct connection networks. To address this limitation, we propose a novel multistage switching network tailored for DQC, which has low system complexity and high entanglement generation rates. The proposed switching network compriseslog⁡2(N)\log _{2}(N)log2​(N)stages andN/2N/2N/2binary switches at each stage, where N represents the number of QPUs. We prove that the proposed network is nonblocking and develop an efficient routing algorithm with a time complexity ofO(Nlog⁡(N))\mathcal {O}(N\log (N))O(Nlog(N)). Additionally, we show the success probability of entanglement generation in the proposed switching network. Extensive simulations demonstrate that our network significantly outperforms the highly efficient circuit-switching Beneš network and three direct connection networks.
Quantum computing has the potential to solve complicated problems that are impossible for classical servers. Nevertheless, the applications of current quantum processors are restricted by their limited qubit capacity. Distributed Quantum Computing (DQC) is promising to scale up the computing capability by interconnecting quantum processors and performing computing collectively. The network interconnecting quantum processors can impact the efficiency of DQC. In this paper, we analyze and compare the performance of various interconnection networks for DQC. First, we meticulously derive the success probabilities of entanglement generation and the fidelity of shared Bell states generated within three typical static networks: line, ring, and grid. In addition, we propose a switching network with a minimal number of switch stages and evaluate its performance in terms of probability and fidelity. Moreover, we conduct extensive simulations based on real-world parameters to compare the static and switching networks, and the results reveal that the switching network performs better and is more scalable.
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 (DQC) has the potential to solve industrial large-scale problems by connecting multiple small quantum processors together to form a larger computing system. Concerning the emerging distributed paradigm, a pivotal challenge lies in crafting specialized network topologies to establish efficient connections among quantum processors while minimizing communication costs. In this paper, we propose a novel DQC topology generation algorithm (DQC-TG) to create optimal and near-optimal network topologies for homogeneous and heterogeneous quantum computers, respectively. Furthermore, for specific quantum circuits requiring diverse communication demands between each pair of qubits, we extend the original algorithm into DQC- TG- Plus to design network topologies tailored for these circuits to further enhance the performance. We perform extensive simulations to evaluate the superiority of the generated network topology designs by our algorithms to baselines.
Scaling quantum computers, i.e., quantum processing units (QPUs) to enable the execution of large quantum circuits is a major challenge, especially for applications that should provide a quantum advantage over classical algorithms. One approach to scale QPUs is to connect multiple machines through quantum and classical channels to form clusters or even quantum networks. Using this paradigm, several smaller QPUs can collectively execute circuits that each would not be able on its own. However, communication between QPUs is costly as it requires generating and maintaining entanglement, and hence it should be used wisely. In this paper, we evaluate the architectures, and in particular the entanglement patterns, of variational quantum circuits in a distributed quantum computing (DQC) setting. That is, using Qiskit, we simulate the execution of an eight qubit circuit using four QPUs each with two computational and two communication qubits where non-local CX-gates are performed using the remote-CX protocol. We compare the performance of various circuits on a binary classification task where training is executed under ideal and testing under noisy conditions. The study provides initial results on suitable VQC architectures for the DQC paradigm, and indicates that a standard VQC baseline is not always the best choice, and alternative architectures that use entanglement between QPUs sparingly deliver better results under noise.
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.
Distributed quantum computing (DQC) uses quantum communication to pool the computational power of multiple quantum processors (QPU). Since qubits in a DQC system are not necessarily co-located, interactions between non-co-located qubits require quantum teleportation, which relies on entanglement to transfer qubit states between distant nodes. As DQC typically requires many teleportations, quantum networks must efficiently generate and distribute high-fidelity entanglement to enable these teleportations. However, since large-scale quantum networks are not yet available, simulations are essential to understand their impact on DQC performance. This paper presents a simulation-based evaluation of teleportation-based DQC under varying real-world network conditions and two distribution schemes. Network parameters such as maximum connection length, entanglement fidelity, and quantum memory coherence time are evaluated using two small-scale Grover circuits to show the impact on computational fidelity and execution delay. The results show that computation fidelity drops sharply below practical thresholds when entanglement fidelity falls below 0.95 or memory coherence is under 1s. Additionally, a runtime analysis shows a 32 times increase in simulation time when both circuit width and circuit depth are increased.