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 Conference on Communications

Simulation of Distributed Quantum Computing based on Teleportation

Benedikt Baier, Leo Sünkel, Wolfgang Kellerer

Published May 24, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1109/icc59461.2026.11587733

Related papers

Simulation-based Analysis of Distributed Quantum Computing with Remote Gates

Benedikt Baier, Wolfgang Kellerer

Quantum computers offer computational advantages for specific problems over classical systems [8], but today's devices are limited by qubit counts and susceptibility to noise. Distributed quantum computing (DQC) addresses these constraints by interconnecting quantum processors via quantum networks to enable cooperative execution of quantum algorithms [4]. DQC can be realized either through quantum teleportation [3], which transfers qubit states across nodes, or through remote gates [7], which enact quantum operations between spatially separated qubits while preserving their physical allocation. Both approaches depend on pre-shared entanglement, which must be distributed across potentially multi-hop quantum networks via entanglement swapping [11]. In realistic settings, DQC performance is influenced by factors such as entanglement fidelity, quantum memory coherence time, and routing path length, yet the impact of these parameters on computational fidelity remains insufficiently understood. This work investigates these effects through simulation of distributed Grover circuits executed over quantum networks with 1-4 routers, incorporating entanglement swapping, network delays, and varying physical constraints to assess how network-level properties affect circuit-level performance.

Workshop on Quantum Networks and Distributed Quantum Computing (QuNet)•Aug 19, 2025•0 citations

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

Modeling and Quantum-Hardware-Based Investigation of Entanglement Distribution and Classical Communication in Distributed Quantum Computing

Ashley N. Tittelbaugh

Quantum computers in the noisy intermediate-scale quantum (NISQ) era are constrained by limited qubit counts, imperfect gate fidelities, and short coherence times. NISQ-era computers often have too few qubits to run many algorithms, and those that do run often have limited quantum advantage. Distributed quantum computing (DQC) is a promising approach to overcome this, where multiple quantum processors are interconnected through shared entanglement. This work serves as a system overview of an entanglement distribution system. We achieve this by examining a zero-added loss multiplexing (ZALM) entanglement generation source, simulating multi-hop, repeater-less networks, and various routing algorithms to distribute entanglement, and real-hardware quantum experiments that reconstruct entanglement links of degraded fidelity and simulate classical-communication delay. Network simulations evaluate routing and spectrum-allocation algorithms under entanglement-generation-imposed rate constraints, by evaluating both fairness and throughput across network sizes and topologies. We identify two polynomial-time approximation algorithms that perform well, or better than others under these metrics. Using both simulations and quantum hardware, we evaluate how degraded entanglement and communication latency affect teleportation-based distributed multipartite-entanglement-state construction. The results reveal the coupled influence of source rate, routing efficiency, fidelity, and classical delay on networked entanglement distribution and DQC performance, providing a reproducible framework for both experimental and simulated studies of near-term DQC.

•Jan 1, 2025•0 citations

An Evaluation of the Remote CX Protocol under Noise in Distributed Quantum Computing

Leo Sünkel, Michael Kölle, Tobias Rohe +1 more

Quantum computers connected through classical and quantum communication channels can be combined to function as a single unit to run large quantum circuits that each device is unable to execute on their own. The distributed quantum computing paradigm is therefore often seen as a potential pathway to scaling quantum computing to capacities necessary for practical and large-scale applications. Whether connecting multiple quantum processing units (QPUs) in clusters or over networks, quantum communication requires entanglement to be generated and distributed over distances. Using entanglement, the remote CX protocol can be performed, which allows the application of the CX gate involving qubits located in different QPUs. In this work, we use a specialized simulation framework for a high-level evaluation of the impact of the protocol when executed under noise in various network configurations using different number of QPUs. We compare naive and graph partitioning qubit assignment strategies and how they affect the fidelity in experiments run on Grover, GHZ, VQC, and random circuits. The results provide insights on how QPU and network configurations or naive scheduling can degrade performance.

quant-pharXiv:2602.03536•International Conference on Communications•Feb 4, 2026•0 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

Distributed quantum computing across an optical network link

D. Main, P. Drmota, D. P. Nadlinger +6 more

Abstract Distributed quantum computing (DQC) combines the computing power of multiple networked quantum processing modules, ideally enabling the execution of large quantum circuits without compromising performance or qubit connectivity 1,2 . Photonic networks are well suited as a versatile and reconfigurable interconnect layer for DQC; remote entanglement shared between matter qubits across the network enables all-to-all logical connectivity through quantum gate teleportation (QGT) 3,4 . For a scalable DQC architecture, the QGT implementation must be deterministic and repeatable; until now, no demonstration has satisfied these requirements. Here we experimentally demonstrate the distribution of quantum computations between two photonically interconnected trapped-ion modules. The modules, separated by about two metres, each contain dedicated network and circuit qubits. By using heralded remote entanglement between the network qubits, we deterministically teleport a controlled-Z (CZ) gate between two circuit qubits in separate modules, achieving 86% fidelity. We then execute Grover’s search algorithm 5 —to our knowledge, the first implementation of a distributed quantum algorithm comprising several non-local two-qubit gates—and measure a 71% success rate. Furthermore, we implement distributed iSWAP and SWAP circuits, compiled with two and three instances of QGT, respectively, demonstrating the ability to distribute arbitrary two-qubit operations 6 . As photons can be interfaced with a variety of systems, the versatile DQC architecture demonstrated here provides a viable pathway towards large-scale quantum computing for a range of physical platforms.

arXiv:2407.00835•Nature•Feb 5, 2025•277 citations
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.
Quantum computers offer computational advantages for specific problems over classical systems [8], but today's devices are limited by qubit counts and susceptibility to noise. Distributed quantum computing (DQC) addresses these constraints by interconnecting quantum processors via quantum networks to enable cooperative execution of quantum algorithms [4]. DQC can be realized either through quantum teleportation [3], which transfers qubit states across nodes, or through remote gates [7], which enact quantum operations between spatially separated qubits while preserving their physical allocation. Both approaches depend on pre-shared entanglement, which must be distributed across potentially multi-hop quantum networks via entanglement swapping [11]. In realistic settings, DQC performance is influenced by factors such as entanglement fidelity, quantum memory coherence time, and routing path length, yet the impact of these parameters on computational fidelity remains insufficiently understood. This work investigates these effects through simulation of distributed Grover circuits executed over quantum networks with 1-4 routers, incorporating entanglement swapping, network delays, and varying physical constraints to assess how network-level properties affect circuit-level performance.
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.
Quantum computers in the noisy intermediate-scale quantum (NISQ) era are constrained by limited qubit counts, imperfect gate fidelities, and short coherence times. NISQ-era computers often have too few qubits to run many algorithms, and those that do run often have limited quantum advantage. Distributed quantum computing (DQC) is a promising approach to overcome this, where multiple quantum processors are interconnected through shared entanglement. This work serves as a system overview of an entanglement distribution system. We achieve this by examining a zero-added loss multiplexing (ZALM) entanglement generation source, simulating multi-hop, repeater-less networks, and various routing algorithms to distribute entanglement, and real-hardware quantum experiments that reconstruct entanglement links of degraded fidelity and simulate classical-communication delay. Network simulations evaluate routing and spectrum-allocation algorithms under entanglement-generation-imposed rate constraints, by evaluating both fairness and throughput across network sizes and topologies. We identify two polynomial-time approximation algorithms that perform well, or better than others under these metrics. Using both simulations and quantum hardware, we evaluate how degraded entanglement and communication latency affect teleportation-based distributed multipartite-entanglement-state construction. The results reveal the coupled influence of source rate, routing efficiency, fidelity, and classical delay on networked entanglement distribution and DQC performance, providing a reproducible framework for both experimental and simulated studies of near-term DQC.
Quantum computers connected through classical and quantum communication channels can be combined to function as a single unit to run large quantum circuits that each device is unable to execute on their own. The distributed quantum computing paradigm is therefore often seen as a potential pathway to scaling quantum computing to capacities necessary for practical and large-scale applications. Whether connecting multiple quantum processing units (QPUs) in clusters or over networks, quantum communication requires entanglement to be generated and distributed over distances. Using entanglement, the remote CX protocol can be performed, which allows the application of the CX gate involving qubits located in different QPUs. In this work, we use a specialized simulation framework for a high-level evaluation of the impact of the protocol when executed under noise in various network configurations using different number of QPUs. We compare naive and graph partitioning qubit assignment strategies and how they affect the fidelity in experiments run on Grover, GHZ, VQC, and random circuits. The results provide insights on how QPU and network configurations or naive scheduling can degrade performance.
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.
Abstract Distributed quantum computing (DQC) combines the computing power of multiple networked quantum processing modules, ideally enabling the execution of large quantum circuits without compromising performance or qubit connectivity 1,2 . Photonic networks are well suited as a versatile and reconfigurable interconnect layer for DQC; remote entanglement shared between matter qubits across the network enables all-to-all logical connectivity through quantum gate teleportation (QGT) 3,4 . For a scalable DQC architecture, the QGT implementation must be deterministic and repeatable; until now, no demonstration has satisfied these requirements. Here we experimentally demonstrate the distribution of quantum computations between two photonically interconnected trapped-ion modules. The modules, separated by about two metres, each contain dedicated network and circuit qubits. By using heralded remote entanglement between the network qubits, we deterministically teleport a controlled-Z (CZ) gate between two circuit qubits in separate modules, achieving 86% fidelity. We then execute Grover’s search algorithm 5 —to our knowledge, the first implementation of a distributed quantum algorithm comprising several non-local two-qubit gates—and measure a 71% success rate. Furthermore, we implement distributed iSWAP and SWAP circuits, compiled with two and three instances of QGT, respectively, demonstrating the ability to distribute arbitrary two-qubit operations 6 . As photons can be interfaced with a variety of systems, the versatile DQC architecture demonstrated here provides a viable pathway towards large-scale quantum computing for a range of physical platforms.