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:2602.04869 · New Journal of Physics

Requirements for Teleportation in an Intercity Quantum Network

Soubhadra Maiti, Guus Avis, Sounak Kar, Stephanie Wehner

quant-phSubmitted Feb 4, 2026• Announced Feb 5, 2026• 2 citations
arXivHTMLPDF

Abstract

We investigate the hardware requirements for quantum teleportation in an intercity-scale network topology consisting of two metropolitan-scale networks connected via a long-distance backbone link. Specifically, we identify the minimal improvements required beyond the state-of-the-art to achieve an end-to-end expected teleportation fidelity of $2/3$, which represents the classical limit. To this end, we formulate the hardware requirements computation as optimisation problems, where the hardware parameters representing the underlying device capabilities serve as decision variables. Assuming a simplified noise model, we derive closed-form analytical expressions for the teleportation fidelity and rate when the network is realised using heterogeneous quantum hardware, including a quantum repeater chain with a memory cut-off. Our derivations are based on events defined by the order statistics of link generation durations in both the metropolitan networks and the backbone, and the resulting expressions are validated through simulations on the NetSquid platform. The analytical expressions facilitate efficient exploration of the optimisation parameter space without resorting to computationally intensive simulations. We then apply this framework to a representative realisation in which the metropolitan nodes are based on trapped-ion processors and the backbone is composed of ensemble-based quantum memories. Our results suggest that teleportation across metropolitan distances is already achievable with state-of-the-art hardware when the data qubit is prepared after end-to-end entanglement has already been established, whereas extending teleportation to intercity scales requires additional, though plausibly achievable, improvements in hardware performance.

Comments
72 pages, 9 figures

Related papers

Realizing Scalability Limits of Quantum Communication Networks

Connor Howe, Ali Anwar

The scalability of quantum communication networks is crucial for enabling secure information exchange and distributed quantum computing across global infrastructures. However, achieving scalability remains a significant challenge due to the effects of decoherence, photon loss, and fidelity degradation over extended distances. This paper performs a critical investigation into the scalability limits of quantum communication networks, focusing on the interplay between entanglement generation rates, end-to-end fidelity, and network parameters such as node separation, noise levels, and total distance. Leveraging the SeQUeNCe simulation framework, we model adaptable trapped-ion repeater networks to uncover fundamental insights into both homogeneous and heterogeneous configurations. Our findings reveal transformative insights that help reshape system designs for near term quantum networks. We identify maximum node separation thresholds critical for practical implementations, illuminate the non-linear degradation of fidelity with increasing distance, and expose how routing and swapping protocols influence entanglement success rates at scale. Most notably, we demonstrate that while additional repeaters can mitigate distance-induced failures, excessive node counts introduce compounding fidelity losses that threaten network viability under certain architectures. These results provide a roadmap for revolutionizing quantum networks, with actionable design strategies such as optimized node placement, advanced routing algorithms, and the adoption of cutting-edge qubit technologies like topological qubits. By addressing key bottlenecks in quantum communication scalability, our work lays the foundation for the next generation of global quantum networks.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•0 citations

How Many Qubits Can Be Teleported? Scalability of Fidelity-Constrained Quantum Applications

Oscar Ramón Adamuz-Hinojosa, Jonathan Prados-Garzon, Sara Vaquero-Gil +1 more

Quantum networks (QNs) enable qubit transfer between distant nodes through quantum teleportation, which reconstructs a quantum state at a remote node by consuming a shared Bell pair. In multi-qubit quantum applications (QApps), the teleported qubits may need to remain stored in quantum memories until execution can start, while decoherence progressively reduces their fidelity with respect to the ideal target state. Such QApps can operate only if all teleported qubits simultaneously satisfy a minimum fidelity threshold. In this paper, we study how many qubits can be teleported under this fidelity-constrained operation in a two-node QN. To this end, we define a QApplevel reliability metric as the probability that all end-to-end Bell pairs satisfy the target fidelity when the multi-qubit teleportation stage is completed. We then develop a Monte Carlo simulator that captures stochastic Bell-pair generation, Quantum Repeater (QR)-assisted entanglement distribution, and fidelity degradation. The analysis considers fiber-based and terrestrial free-space optical (FSO) quantum links, as well as representative NV-center- and trapped-ion-based quantum memories. Results show that memory coherence is the main scalability bottleneck under stringent fidelity targets, while parallel entanglement generation is essential for multi-qubit teleportation.

arXiv:2603.28672•Joint European Conference on Networks and Communications & 6G Summit (EuCNC/6G Summit)•Jun 2, 2026•0 citations

Rethinking Quantum Network Design Using a Verification-Based Quantum Transmission Protocol

Yiming Zeng, Zhengyu Wu, Xuan Du Trinh +3 more

Quantum networking is poised to enable a distributed quantum Internet, connecting many quantum processors to exchange information securely and efficiently. Quantum networks use quantum repeaters for long-distance communication to mitigate the noise that accumulates over distance. However, today's quantum network protocols still face fundamental limitations: most rely on establishing end-to-end entanglement before teleportation, which is costly to establish and is extremely shortlived. While hop-by-hop teleportation provides more flexibility, existing designs assume ideal, noise-free conditions. In effect, noise emerges as the fundamental bottleneck that affects the scalability and reliability of multi-hop quantum transmission. We present a verification-based quantum transmission (VBQT) protocol that addresses noise as a first-class design goal. This new protocol couples entanglement verification with a new hopby-hop teleportation protocol to deliver robust, long-distance quantum communication. Our verification algorithm provably detects and filters low-quality pair-wise entanglements, ensuring that only high-fidelity pairs are used for communication. Once multiple verified pairs are available, the transmission protocol at each repeater decides which verified pair to use for pairwise teleportation that is consistent across hops so that the destination can recover the qubit successfully. Using the NetSquid simulator under real experiment parameters, we show that VBQT improves average qubit fidelity by up to 42.8% over end-to-end and 34.7% over hop-by-hop teleportation, and increases goodput by up to 870% and 167%, respectively. These results establish a practical foundation for reliable, scalable quantum communication within near-term quantum networks.

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

Scheduling Quantum Teleportation with Noisy Memories

Aparimit Chandra, Wenhan Dai, Don Towsley

Quantum teleportation channels can overcome the effects of photonic loss, a major challenge in the implementation of a quantum network over fiber. Teleportation channels are created by distributing an entangled state between two nodes, which is a probabilistic process requiring classical communication. This causes critical delays that can cause information loss as quantum data suffers from decoherence when stored in memory. In this work, we quantify the effect of decoherence on fidelity at a node in a quantum network due to the storage of qubits in noisy memory platforms. We model a memory platform as a buffer that stores incoming qubits waiting for the creation of a teleportation channel. Memory platforms are parameterized with decoherence rate and buffer size. We show that fidelity at a node is a linear sum of terms, exponentially decaying with time, where the decay rate depends on the decoherence rate of the memory platform. This allows us to utilize Laplace transforms to derive computable functions of average fidelity with respect to the load, buffer size, and decoherence rate of the memory platform. We prove that serving qubits in a Last In First Out order with pushout for buffer overflow management maximizes average fidelity. Last, we apply this framework to model a single repeater node to calculate the average fidelity of the end-to-end entanglement created by this repeater assuming perfect gate operations.

arXiv:2205.06300•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 1, 2022•12 citations

Connecting quantum cities: simulation of a satellite-based quantum network

Raja Yehia, Matteo Schiavon, Valentina Marulanda Acosta +4 more

Abstract We present and analyze an architecture for a European-scale quantum network using satellite links to connect Quantum Cities, which are metropolitan quantum networks with minimal hardware requirements for the end users. Using NetSquid, a quantum network simulation tool based on discrete events, we assess and benchmark the performance of such a network linking distant locations in Europe in terms of quantum key distribution rates, considering realistic parameters for currently available or near-term technology. Our results highlight the key parameters and the limits of current satellite quantum communication links and can be used to assist the design of future missions. We also discuss the possibility of using high-altitude balloons as an alternative to satellites.

arXiv:2307.11606•New Journal of Physics•Jun 24, 2024•23 citations

Towards a Global Scale Quantum Information Network: A Study Applied to Satellite-Enabled Distributed Quantum Computing

Laurent de Forges de Parny, Luca Paccard, Manon Bertrand +8 more

Recent developments have reported on the feasibility of interconnecting small quantum registers in a quantum information network of a few meter-scale for distributed quantum computing purposes. Small quantum processors in a network represent a promising solution to the scalability problem of manipulating more than thousands of noise-free qubits. Here, we propose and assess a satellite-enabled distributed quantum computing system at the French national scale based on existing infrastructures in Paris and Nice. We consider a system composed of both a ground and a Space segment, allowing for the distribution of end-to-end entanglement between Alice in Paris and Bob in Nice, each owning a few-qubit processor composed of trapped ions. In the context of quantum computing, this entanglement resource can be used for the teleportation of a qubit state or for gate teleportation. After having developed a model, we numerically assess the entanglement distribution rate and fidelity generated by this space-based quantum information network and discuss concrete use cases and service performance levels in the framework of distributed quantum computing. We obtain 90 end-to-end entangled photon pairs distributed over a satellite pass of 331 s that can perform a teleportation-based controlled-Z operation with a fidelity of at most 82%.

arXiv:2509.11908•Entropy•Nov 18, 2025•2 citations
We investigate the hardware requirements for quantum teleportation in an intercity-scale network topology consisting of two metropolitan-scale networks connected via a long-distance backbone link. Specifically, we identify the minimal improvements required beyond the state-of-the-art to achieve an end-to-end expected teleportation fidelity of 2/32/32/3, which represents the classical limit. To this end, we formulate the hardware requirements computation as optimisation problems, where the hardware parameters representing the underlying device capabilities serve as decision variables. Assuming a simplified noise model, we derive closed-form analytical expressions for the teleportation fidelity and rate when the network is realised using heterogeneous quantum hardware, including a quantum repeater chain with a memory cut-off. Our derivations are based on events defined by the order statistics of link generation durations in both the metropolitan networks and the backbone, and the resulting expressions are validated through simulations on the NetSquid platform. The analytical expressions facilitate efficient exploration of the optimisation parameter space without resorting to computationally intensive simulations. We then apply this framework to a representative realisation in which the metropolitan nodes are based on trapped-ion processors and the backbone is composed of ensemble-based quantum memories. Our results suggest that teleportation across metropolitan distances is already achievable with state-of-the-art hardware when the data qubit is prepared after end-to-end entanglement has already been established, whereas extending teleportation to intercity scales requires additional, though plausibly achievable, improvements in hardware performance.
The scalability of quantum communication networks is crucial for enabling secure information exchange and distributed quantum computing across global infrastructures. However, achieving scalability remains a significant challenge due to the effects of decoherence, photon loss, and fidelity degradation over extended distances. This paper performs a critical investigation into the scalability limits of quantum communication networks, focusing on the interplay between entanglement generation rates, end-to-end fidelity, and network parameters such as node separation, noise levels, and total distance. Leveraging the SeQUeNCe simulation framework, we model adaptable trapped-ion repeater networks to uncover fundamental insights into both homogeneous and heterogeneous configurations. Our findings reveal transformative insights that help reshape system designs for near term quantum networks. We identify maximum node separation thresholds critical for practical implementations, illuminate the non-linear degradation of fidelity with increasing distance, and expose how routing and swapping protocols influence entanglement success rates at scale. Most notably, we demonstrate that while additional repeaters can mitigate distance-induced failures, excessive node counts introduce compounding fidelity losses that threaten network viability under certain architectures. These results provide a roadmap for revolutionizing quantum networks, with actionable design strategies such as optimized node placement, advanced routing algorithms, and the adoption of cutting-edge qubit technologies like topological qubits. By addressing key bottlenecks in quantum communication scalability, our work lays the foundation for the next generation of global quantum networks.
Quantum networks (QNs) enable qubit transfer between distant nodes through quantum teleportation, which reconstructs a quantum state at a remote node by consuming a shared Bell pair. In multi-qubit quantum applications (QApps), the teleported qubits may need to remain stored in quantum memories until execution can start, while decoherence progressively reduces their fidelity with respect to the ideal target state. Such QApps can operate only if all teleported qubits simultaneously satisfy a minimum fidelity threshold. In this paper, we study how many qubits can be teleported under this fidelity-constrained operation in a two-node QN. To this end, we define a QApplevel reliability metric as the probability that all end-to-end Bell pairs satisfy the target fidelity when the multi-qubit teleportation stage is completed. We then develop a Monte Carlo simulator that captures stochastic Bell-pair generation, Quantum Repeater (QR)-assisted entanglement distribution, and fidelity degradation. The analysis considers fiber-based and terrestrial free-space optical (FSO) quantum links, as well as representative NV-center- and trapped-ion-based quantum memories. Results show that memory coherence is the main scalability bottleneck under stringent fidelity targets, while parallel entanglement generation is essential for multi-qubit teleportation.
Quantum networking is poised to enable a distributed quantum Internet, connecting many quantum processors to exchange information securely and efficiently. Quantum networks use quantum repeaters for long-distance communication to mitigate the noise that accumulates over distance. However, today's quantum network protocols still face fundamental limitations: most rely on establishing end-to-end entanglement before teleportation, which is costly to establish and is extremely shortlived. While hop-by-hop teleportation provides more flexibility, existing designs assume ideal, noise-free conditions. In effect, noise emerges as the fundamental bottleneck that affects the scalability and reliability of multi-hop quantum transmission. We present a verification-based quantum transmission (VBQT) protocol that addresses noise as a first-class design goal. This new protocol couples entanglement verification with a new hopby-hop teleportation protocol to deliver robust, long-distance quantum communication. Our verification algorithm provably detects and filters low-quality pair-wise entanglements, ensuring that only high-fidelity pairs are used for communication. Once multiple verified pairs are available, the transmission protocol at each repeater decides which verified pair to use for pairwise teleportation that is consistent across hops so that the destination can recover the qubit successfully. Using the NetSquid simulator under real experiment parameters, we show that VBQT improves average qubit fidelity by up to 42.8% over end-to-end and 34.7% over hop-by-hop teleportation, and increases goodput by up to 870% and 167%, respectively. These results establish a practical foundation for reliable, scalable quantum communication within near-term quantum networks.
Quantum teleportation channels can overcome the effects of photonic loss, a major challenge in the implementation of a quantum network over fiber. Teleportation channels are created by distributing an entangled state between two nodes, which is a probabilistic process requiring classical communication. This causes critical delays that can cause information loss as quantum data suffers from decoherence when stored in memory. In this work, we quantify the effect of decoherence on fidelity at a node in a quantum network due to the storage of qubits in noisy memory platforms. We model a memory platform as a buffer that stores incoming qubits waiting for the creation of a teleportation channel. Memory platforms are parameterized with decoherence rate and buffer size. We show that fidelity at a node is a linear sum of terms, exponentially decaying with time, where the decay rate depends on the decoherence rate of the memory platform. This allows us to utilize Laplace transforms to derive computable functions of average fidelity with respect to the load, buffer size, and decoherence rate of the memory platform. We prove that serving qubits in a Last In First Out order with pushout for buffer overflow management maximizes average fidelity. Last, we apply this framework to model a single repeater node to calculate the average fidelity of the end-to-end entanglement created by this repeater assuming perfect gate operations.
Abstract We present and analyze an architecture for a European-scale quantum network using satellite links to connect Quantum Cities, which are metropolitan quantum networks with minimal hardware requirements for the end users. Using NetSquid, a quantum network simulation tool based on discrete events, we assess and benchmark the performance of such a network linking distant locations in Europe in terms of quantum key distribution rates, considering realistic parameters for currently available or near-term technology. Our results highlight the key parameters and the limits of current satellite quantum communication links and can be used to assist the design of future missions. We also discuss the possibility of using high-altitude balloons as an alternative to satellites.
Recent developments have reported on the feasibility of interconnecting small quantum registers in a quantum information network of a few meter-scale for distributed quantum computing purposes. Small quantum processors in a network represent a promising solution to the scalability problem of manipulating more than thousands of noise-free qubits. Here, we propose and assess a satellite-enabled distributed quantum computing system at the French national scale based on existing infrastructures in Paris and Nice. We consider a system composed of both a ground and a Space segment, allowing for the distribution of end-to-end entanglement between Alice in Paris and Bob in Nice, each owning a few-qubit processor composed of trapped ions. In the context of quantum computing, this entanglement resource can be used for the teleportation of a qubit state or for gate teleportation. After having developed a model, we numerically assess the entanglement distribution rate and fidelity generated by this space-based quantum information network and discuss concrete use cases and service performance levels in the framework of distributed quantum computing. We obtain 90 end-to-end entangled photon pairs distributed over a satellite pass of 331 s that can perform a teleportation-based controlled-Z operation with a fidelity of at most 82%.