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:2409.20304 · Physical Review A

Teleportation fidelity of quantum repeater networks

Ganesh Mylavarapu, Subrata Kumar Ghosh, Chittaranjan Hens, Indranil Chakrabarty, Subhadip Mitra

Published Aug 15, 2025• 7 citations
arXivHTMLPDF

Abstract

We show that the average of the maximum teleportation fidelities between all pairs of nodes in a large quantum repeater network is a measure of the resourcefulness of the network as a whole. We use simple Werner state-based models to characterise some fundamental (loopless) topologies (star, chain, and some trees) with respect to this measure in three (semi)realistic scenarios. Most of our results are analytic and are applicable for arbitrary network sizes. We identify the parameter ranges where these networks can achieve quantum advantages and show the large-N behaviours.

DOI
10.1103/72jp-37k6

Related papers

Enhancing the teleportation fidelity of a quantum network using purification

Soumit Roy, Md Sohel Mondal, Siddhartha Santra +1 more

Complex quantum networks can support a diverse set of long-range entanglement distribution schemes ranging from linear repeater protocols to multipath entanglement purification strategies. As a result, a network's resourcefulness, that is its ability to facilitate quantum communication, depends on the deployed distribution scheme. In this work, we analyse and compare the resourcefulness of quantum networks across a broad range of network topologies, including both regular and random networks, under two distinct entanglement distribution schemes. The first relies on entanglement swapping along a single path connecting a source-target pair, while the second exploits entanglement purification using multiple paths between the same source and target nodes. The resourcefulness of the network is quantified using a recently described metric [1] that averages over the maximum teleportation fidelity between arbitrary source-target pairs in the network. We present algorithms for estimating this metric under constraints of edge-usage and ordering of paths. Our results not only demonstrate the sensitivity of the average maximum teleportation fidelity metric to the choice of entanglement distribution protocol, but also highlight the significant improvements enabled by network purification schemes. In particular, purification-based approaches can substantially enhance average teleportation fidelity, thereby improving the overall teleportation capability of quantum networks.

quant-pharXiv:2606.18743•Jun 18, 2026•0 citations

Entanglement and Teleportation in a 1-D Network with Repeaters

Ganesh Mylavarapu, Indranil Chakrabarty, Kaushiki Mukherjee +2 more

The most simplest form of quantum network is an one dimensional quantum network with a single player in each node. In remote entanglement distribution each of the players carry out measurement at the intermediate nodes to produce an entangled state between initial and final node which are remotely separated. It is imperative to say that the flow of information as well as the percolation of entanglement in a network between the source and target node is an important area of study. This will help us to understand the limits of the resource states as well as the measurements that are carried out in the process of remote entanglement distribution. In this article we investigate how the concurrence of the final entangled state obtained is connected with the concurrences of the initial entangled states present in a 1-D chain. We extend the works done for the pure entangled states for mixed entangled states like Werner states, Bell diagonal states and for general mixed states. We did not limit ourselves to a situation where the measurements are happening perfectly. We also investigate how these relations change when we consider imperfect swapping. We obtain the limits on the number of swappings as well as the success probability measurements to ensure the final state to be entangled state after swapping. In addition to these we also investigate on how much quantum information can be sent from the initial node to the final node (by computing the teleportation fidelity) when the measurement is perfect and imperfect with the same set of examples. Here also we obtain the limits on the number of swapping and the success probability of measurement to ensure that the final state obtained is capable of transferring the information . These results have tremendous future applications in sending quantum information between two quantum processors in remote entangled distribution.

arXiv:2306.01406•Jun 2, 2023•6 citations

Repeater-Based Quantum Communication Protocol: Maximizing Teleportation Fidelity with Minimal Entanglement

Arkaprabha Ghosal, Jatin Ghai, Tanmay Saha +2 more

Transmitting unknown quantum states to distant locations is crucial for distributed quantum information protocols. The seminal quantum teleportation scheme achieves this feat while requiring prior maximal entanglement between the sender and receiver. In scenarios with noisy entangled states, optimal teleportation fidelity characterizes the efficacy of transmitting the state, demanding the proper selection of local operations at the sender's and receiver's ends. The complexity escalates further in long-range communication setups, prompting the consideration of a repeater-based approach, which incorporates arrays of nodes with multiple segments to facilitate the efficient transmission of quantum information. The fidelity of the communication line gets degraded even if a single segment is affected by noise. In such cases, the general wisdom employs the standard entanglement swapping protocol involving maximally entangled states across the noiseless segments and applying maximally entangled basis measurement at the corresponding nodes to achieve optimal fidelity. In this Letter, we propose a more efficient protocol for a certain class of noisy states, achieving the same fidelity as the standard protocol while consuming less amount of entanglement. Our approach ensures optimal teleportation fidelity even when the end-to-end state gets noisier, and thus promises efficient utility of quantum resources in repeater-based distributed quantum protocols.

arXiv:2406.14216•Physical Review Letters•Apr 23, 2025•8 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

Performance Evaluation of Emerging Networks of Quantum Repeaters: Analysis and Simulation

Kobi Ravid, Javad Ghaderi, Gil Zussman

Emerging experimental quantum network deployments are based on collaborations between research institutions and rely on telecommunications fiber infrastructure. Currently, such networks consist of mostly Dual Input Repeaters (DIRs) and can be viewed as composed of (mostly) line graphs. In order to evaluate the performance of such networks (e.g., in terms of Entangled Pair Rate, EPR, and average Fidelity) we developed a custom quantum network simulation platform that takes into account both the quantum and classical network components. To support the verification of the simulation results, we develop a novel approach for performance analysis of DIRs. We compare the simulation results to the analytical results for DIRs and to prior results for repeaters with more than two inputs. We observe that although the expected memory utilization cannot be bounded, \emph{a small DIR memory size is sufficient and leads to minimal performance degradation}. For line networks with a single repeater and $3$ repeaters, we explore the dependency of incoming and outgoing memory size requirements on the number of nodes (network size), their connectivity (fiber length) and various quantum error settings (amplitude damping and phase flip channels). We evaluate the \emph{EPR} and the \emph{average Fidelity} for a sub-network of a deployed network with $3$ repeaters, using two alternative paths. We show that as the number of nodes increases or when the fiber lengths between nodes differ significantly, additional node memory is needed to maintain the same EPR (qubits are stored for longer duration to allow completion of entanglement across the network). We also show that the memory size should be above some minimum threshold to allow EP creation (EPR $>0$) as pair selection and swapping completion propagate across the network.

arXiv:2610.02778•Oct 2, 2026•0 citations

Requirements for Teleportation in an Intercity Quantum Network

Soubhadra Maiti, Guus Avis, Sounak Kar +1 more

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.

quant-pharXiv:2602.04869•New Journal of Physics•Feb 5, 2026•2 citations
We show that the average of the maximum teleportation fidelities between all pairs of nodes in a large quantum repeater network is a measure of the resourcefulness of the network as a whole. We use simple Werner state-based models to characterise some fundamental (loopless) topologies (star, chain, and some trees) with respect to this measure in three (semi)realistic scenarios. Most of our results are analytic and are applicable for arbitrary network sizes. We identify the parameter ranges where these networks can achieve quantum advantages and show the large-N behaviours.
Complex quantum networks can support a diverse set of long-range entanglement distribution schemes ranging from linear repeater protocols to multipath entanglement purification strategies. As a result, a network's resourcefulness, that is its ability to facilitate quantum communication, depends on the deployed distribution scheme. In this work, we analyse and compare the resourcefulness of quantum networks across a broad range of network topologies, including both regular and random networks, under two distinct entanglement distribution schemes. The first relies on entanglement swapping along a single path connecting a source-target pair, while the second exploits entanglement purification using multiple paths between the same source and target nodes. The resourcefulness of the network is quantified using a recently described metric [1] that averages over the maximum teleportation fidelity between arbitrary source-target pairs in the network. We present algorithms for estimating this metric under constraints of edge-usage and ordering of paths. Our results not only demonstrate the sensitivity of the average maximum teleportation fidelity metric to the choice of entanglement distribution protocol, but also highlight the significant improvements enabled by network purification schemes. In particular, purification-based approaches can substantially enhance average teleportation fidelity, thereby improving the overall teleportation capability of quantum networks.
The most simplest form of quantum network is an one dimensional quantum network with a single player in each node. In remote entanglement distribution each of the players carry out measurement at the intermediate nodes to produce an entangled state between initial and final node which are remotely separated. It is imperative to say that the flow of information as well as the percolation of entanglement in a network between the source and target node is an important area of study. This will help us to understand the limits of the resource states as well as the measurements that are carried out in the process of remote entanglement distribution. In this article we investigate how the concurrence of the final entangled state obtained is connected with the concurrences of the initial entangled states present in a 1-D chain. We extend the works done for the pure entangled states for mixed entangled states like Werner states, Bell diagonal states and for general mixed states. We did not limit ourselves to a situation where the measurements are happening perfectly. We also investigate how these relations change when we consider imperfect swapping. We obtain the limits on the number of swappings as well as the success probability measurements to ensure the final state to be entangled state after swapping. In addition to these we also investigate on how much quantum information can be sent from the initial node to the final node (by computing the teleportation fidelity) when the measurement is perfect and imperfect with the same set of examples. Here also we obtain the limits on the number of swapping and the success probability of measurement to ensure that the final state obtained is capable of transferring the information . These results have tremendous future applications in sending quantum information between two quantum processors in remote entangled distribution.
Transmitting unknown quantum states to distant locations is crucial for distributed quantum information protocols. The seminal quantum teleportation scheme achieves this feat while requiring prior maximal entanglement between the sender and receiver. In scenarios with noisy entangled states, optimal teleportation fidelity characterizes the efficacy of transmitting the state, demanding the proper selection of local operations at the sender's and receiver's ends. The complexity escalates further in long-range communication setups, prompting the consideration of a repeater-based approach, which incorporates arrays of nodes with multiple segments to facilitate the efficient transmission of quantum information. The fidelity of the communication line gets degraded even if a single segment is affected by noise. In such cases, the general wisdom employs the standard entanglement swapping protocol involving maximally entangled states across the noiseless segments and applying maximally entangled basis measurement at the corresponding nodes to achieve optimal fidelity. In this Letter, we propose a more efficient protocol for a certain class of noisy states, achieving the same fidelity as the standard protocol while consuming less amount of entanglement. Our approach ensures optimal teleportation fidelity even when the end-to-end state gets noisier, and thus promises efficient utility of quantum resources in repeater-based distributed quantum protocols.
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.
Emerging experimental quantum network deployments are based on collaborations between research institutions and rely on telecommunications fiber infrastructure. Currently, such networks consist of mostly Dual Input Repeaters (DIRs) and can be viewed as composed of (mostly) line graphs. In order to evaluate the performance of such networks (e.g., in terms of Entangled Pair Rate, EPR, and average Fidelity) we developed a custom quantum network simulation platform that takes into account both the quantum and classical network components. To support the verification of the simulation results, we develop a novel approach for performance analysis of DIRs. We compare the simulation results to the analytical results for DIRs and to prior results for repeaters with more than two inputs. We observe that although the expected memory utilization cannot be bounded, \emph{a small DIR memory size is sufficient and leads to minimal performance degradation}. For line networks with a single repeater and 333 repeaters, we explore the dependency of incoming and outgoing memory size requirements on the number of nodes (network size), their connectivity (fiber length) and various quantum error settings (amplitude damping and phase flip channels). We evaluate the \emph{EPR} and the \emph{average Fidelity} for a sub-network of a deployed network with 333 repeaters, using two alternative paths. We show that as the number of nodes increases or when the fiber lengths between nodes differ significantly, additional node memory is needed to maintain the same EPR (qubits are stored for longer duration to allow completion of entanglement across the network). We also show that the memory size should be above some minimum threshold to allow EP creation (EPR >0>0>0) as pair selection and swapping completion propagate across the network.
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.