We have investigated the entanglement distribution and quantum teleportation in quantum passive optical networks, where an entangled state is distributed between the central node and multiple end users through lossy fibers and passive optical splitter/combiner. The entanglement degradation is quantified using logarithmic negativity and teleportation fidelity, both in nonassisted and assisted strategies. We find that nonassisted teleportation fidelity rapidly drops below the classical limit as the number of users increases (possible up to five users), while assisted teleportation remains robust against both network size and photon loss, provided that the distributed entangled resource has sufficiently high fidelity. These results highlight the fundamental limitations of bipartite schemes and establish cooperative assisted strategies as essential primitives for scalable fiber-to-the-home quantum access networks and the quantum internet with several end users.
We have investigated the entanglement distribution and quantum teleportation in quantum passive optical networks, where an entangled state is distributed between the central node and multiple end users through lossy fibers and passive optical splitter/combiner. The entanglement degradation is quantified using logarithmic negativity and teleportation fidelity, both in nonassisted and assisted strategies. We find that nonassisted teleportation fidelity rapidly drops below the classical limit as the number of users increases (possible up to five users), while assisted teleportation remains robust against both network size and photon loss, provided that the distributed entangled resource has sufficiently high fidelity. These results highlight the fundamental limitations of bipartite schemes and establish cooperative assisted strategies as essential primitives for scalable fiber-to-the-home quantum access networks and the quantum internet with several end users.
Introduction: Continuous-variable quantum teleportation and entanglement distribution are fundamental building blocks for future quantum internet infrastructures. Quantum passive optical networks (QPONs) provide a promising architecture for scalable multi-user quantum communication by exploiting the mature passive optical network infrastructure. Materials and methods: We develop a theoretical framework for continuous-variable entanglement distribution and quantum teleportation in QPONs using two-mode squeezed vacuum states propagating through splitter–combiner–loss channels. Both downlink and uplink architectures are investigated under assisted and non-assisted protocols. The performance is analyzed using covariance matrix formalism, logarithmic negativity, and teleportation fidelity, and closed-form analytical expressions are derived together with numerical evaluations. Results: The analysis demonstrates that downlink entanglement distribution consistently outperforms the uplink architecture in terms of both logarithmic negativity and teleportation fidelity except in noise-less channels. Assisted protocols further enhance the achievable performance compared with non-assisted schemes. We derive the optimum squeezing parameter for non-assisted teleportation, showing that excessive squeezing may become detrimental because of network loss and splitting. Numerical results quantify the effects of network size, transmission distance, channel excess noise, detector imperfections, and measurement-added noise on entanglement distribution and teleportation performance. Also, we have showed that the time-division multiple-access is the preferred scheduling scheme between the users. Conclusions: The proposed framework establishes fundamental performance limits for continuous-variable QPONs and identifies practical design guidelines for scalable quantum access networks. The results demonstrate the advantages of downlink entanglement distribution and assisted teleportation, providing theoretical support for the development of future multi-user quantum communication and quantum internet infrastructures.
Quantum teleportation is a fundamental protocol enabling the transfer of quantum states between remote nodes without physical transmission. As the Quantum Internet evolves, optimizing quantum teleportation becomes crucial due to entanglement degradation, resource constraints, and network efficiency. This paper proposes a game-theoretic framework for managing quantum teleportation by modeling quantum nodes as rational agents competing or cooperating to maximize teleportation fidelity and entanglement utility. We introduce cooperative and non-cooperative game models, analyze Nash equilibrium strategies for teleportation efficiency, and propose a Shapley-value-based entanglement allocation for fair resource distribution. Our system model incorporates graph-theoretic representations of quantum networks, utility functions, and incentive mechanisms to encourage efficient teleportation strategies. A Qiskit-based simulation evaluates teleportation fidelity and resource efficiency, comparing game-theoretic strategies with classical resource allocation methods. Our findings demonstrate that game-theoretic approaches significantly enhance teleportation efficiency, entanglement utilization, and robustness in a dynamic Quantum Internet environment.
Abstract Quantum teleportation as the key strategy for quantum communication requires pure maximally shared entangled states among quantum nodes. In practice, quantum decoherence drastically degrades the shared entanglement during entanglement distribution, which is a serious challenge for the development of quantum networks. However, most of the decoherence control strategies proposed thus far are either resource-intensive or time-consuming. To overcome this obstacle, we enable noise-resistant teleportation through a noisy channel with a limited number of qubits and without applying time-consuming weak measurements. We apply a quantum gate control unit consisting of a controlled NOT gate and a rotation gate after the original teleportation protocol is accomplished. Furthermore, we demonstrate that a teleportation fidelity of unity is attainable when environment-assisted measurement is added to the proposed teleportation protocol via quantum gates. Moreover, we present an entanglement distribution process by employing the designed quantum gate control unit followed by the deterministic standard teleportation protocol to improve teleportation fidelity by establishing improved shared entanglement. Our performance analysis indicates that the proposed teleportation schemes offer a competitive fidelity and success probability compared with the conventional schemes and a recent weak measurement-based teleportation protocol.
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 QApp-level 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.
The realization of a global-scale quantum internet is hindered by practical challenges such as high photon loss, decoherence, susceptibility to node failure, and others. We analyze [1] the implications of these practical constraints on the scalability and robustness of the quantum Internet. Considering repeater-based quantum networks, we present bottlenecks for distributing resources among multiple end nodes. We use graph theory to assess network robustness and identify its critical nodes and critical length scales. In particular, we consider repeater-based quantum networks and present practical limitations on distilling secret keys via device-independent quantum key distribution (DI-QKD) protocols and other information processing tasks such as sharing of entanglement between the end nodes, performing Bell-CHSH violation experiments, and implementing quantum teleportation protocols. By considering instances of a hybrid satellite-fiber network for distributing entangled states between far-off cities and considering currently available quantum processor architectures as networks, we analyze the practical limitations and robustness of real-world quantum networks. For such real-world networks, we present algorithms for different network tasks. Overall, the assessment presented in this work can be used to benchmark the critical parameters in the practical realization of a global-scale quantum internet.
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.