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

ACM SIGMETRICS Performance Evaluation Review

Entanglement Management through Swapping over Quantum Internets

Yiming Zeng, Jiarui Zhang, Zhenhua Liu, Yuanyuan Yang

Published Sep 28, 2023• 2 citations
Publisher

Abstract

Quantum Internet has the potential to support a wide range of applications in quantum communication and quantum computing by generating, distributing, and processing quantum information. Generating a long-distance quantum entanglement is one of the most essential functions of a quantum Internet to facilitate these applications. However, entanglement is a probabilistic process, and its success rate drops significantly as distance increases. Entanglement swapping is an efficient technique used to address this challenge. How to efficiently manage the entanglement through swapping is a fundamental yet challenging problem. In this paper, we will consider two swapping methods: (1) BSM: a classic entanglement-swapping method based on Bell State measurements that fuse two successful quantum links, (2) nfusion: a more general and efficient swapping method based on Greenberger-Horne-Zeilinger measurements, capable of fusing n successful quantum links. Our goal is to maximize the entanglement rate for multiple quantum-user pairs over the quantum Internet with an arbitrary topology. We propose efficient entanglement management algorithms that utilized the unique properties of BSM and n-fusion. Evaluation results highlight that our approach outperforms existing routing protocols.

DOI
10.1145/3626570.3626595

Related papers

Entanglement Management Through Swapping Over Quantum Internets

Yiming Zeng, Jiarui Zhang, Ji yin Liu +2 more

Quantum Internet has the potential to support a wide range of applications in quantum communication and quantum computing by generating, distributing, and processing quantum information. Generating a long-distance quantum entanglement is one of the most fundamental functions of a quantum Internet to facilitate these applications. However, entanglement is a probabilistic process, and its success rate drops significantly as distance increases. Entanglement-swapping is an efficient technique used to address this challenge. How to efficiently manage the entanglement through swapping is a fundamental yet challenging problem. This article considers two entanglement-swapping methods: (1) Bell state measurement (BSM) entanglement-swapping: a classic entanglement-swapping method that is able to fuse two successful quantum links, (2) Greenberger-Horne-Zeilinger (GHZ) measurement entanglement-swapping: a more general and efficient swapping method which is capable of fusingnsuccessful quantum links. The goal is to maximize the entanglement rate for multiple quantum processor unit (QPU) pairs over the quantum Internet with a general topology. Two efficient entanglement management protocols are proposed which respectively make use of the unique properties of BSM and GHZ. Evaluation results highlight that the proposed protocols outperform the existing ones.

IEEE Network•Oct 24, 2023•4 citations

Entanglement Routing Over Quantum Networks Using Greenberger-Horne-Zeilinger Measurements

Yiming Zeng, Jiarui Zhang, Ji yin Liu +2 more

Generating a long-distance quantum entanglement is one of the most essential functions of a quantum network to support quantum communication and computing applications. The successful entanglement rate during a probabilistic entanglement process decreases dramatically with distance, and swapping is a widely-applied quantum technique to address this issue. Most existing entanglement routing protocols use a classic entanglement-swapping method based on Bell State measurements that can only fuse two successful entanglement links. This paper appeals to a more general and efficient swapping method, namely n-fusion based on Greenberger-Horne-Zeilinger measurements that can fuse n successful entanglement links, to maximize the entanglement rate for multiple quantum-user pairs over a quantum network. We propose efficient entanglement routing algorithms that utilize the properties of n-fusion for quantum networks with general topologies. Evaluation results highlight that our proposed algorithm under n-fusion can greatly improve the network performance compared with existing ones.

arXiv:2306.16671•IEEE International Conference on Distributed Computing Systems (ICDCS)•Jul 1, 2023•8 citations

Entanglement generation in a quantum network at distance-independent rate

Ashlesha Patil, Mihir Pant, Dirk Englund +2 more

Abstract We develop a protocol for entanglement generation in the quantum internet that allows a repeater node to use n-qubit Greenberger-Horne-Zeilinger (GHZ) projective measurements that can fuse n successfully-entangled links, i.e., two-qubit entangled Bell pairs shared across n network edges, incident at that node. Implementing n-fusion, for n≥3, is in principle not much harder than 2-fusions (Bell-basis measurements) in solid-state qubit memories. If we allow even 3-fusions at the nodes, we find---by developing a connection to a modified version of the site-bond percolation problem---that despite lossy (hence probabilistic) link-level entanglement generation, and probabilistic success of the fusion measurements at nodes, one can generate entanglement between end parties Alice and Bob at a rate that stays constant as the distance between them increases. We prove that this powerful network property is not possible to attain with any quantum networking protocol built with Bell measurements and multiplexing alone. We also design a two-party quantum key distribution protocol that converts the entangled states shared between two nodes into a shared secret, at a key generation rate that is independent of the distance between the two parties.

arXiv:2005.07247•npj Quantum Information•May 6, 2022•59 citations

QUANTUM ENTANGLEMENT SWAPPING IN MULTI-NODE QUANTUM NETWORKS: EFFICIENCY AND SCALABILITY ANALYSIS

Muzafarova Sevinch Muhammadovna

This paper investigates the scalability and transmission efficiency of entanglement swapping protocols within multi-node quantum networks. As the realization of a global quantum internet relies heavily on long-distance entanglement distribution, quantum repeaters utilizing entanglement swapping serve as a critical backbone. However, scalability remains a bottleneck due to photon loss, operational infidelities, and quantum memory coherence times. In this study, we analytically model a multi-node quantum chain and evaluate how the end-to-end entanglement fidelity degrades as the number of intermediate nodes scales up. Our analysis highlights the critical thresholds for Bell state measurement (BSM) success rates required to maintain quantum state integrity across large distances. The findings provide optimization constraints for designing scalable and fault-tolerant routing protocols in future quantum information networks.

International Journal of Emerging Innovations in Science and Technology•Jun 8, 2026•0 citations

Multi-User Entanglement Routing Design over Quantum Internets

Yiming Zeng, Jiarui Zhang, Xiaojun Shang +3 more

Quantum Internet has potential capabilities far beyond the traditional Internet and is thus a promising future platform for communication and computation. Entanglement is a cornerstone of quantum mechanics and forms the basis of numerous quantum applications in the quantum Internet. While existing studies primarily focus on two-user entanglement, a plethora of applications necessitates the leap to multi-user entanglement. This paper tackles the fundamental problem of multi-user entanglement routing in the quantum Internet, aiming to entangle multiple quantum users with a high entanglement rate. We abstract the problem as a novel graph routing problem, which is not readily addressed by existing graph problem solutions due to the unique characteristics of the quantum Internet. To address this problem, we first consider a sufficient condition ensuring a feasible solution's existence and design an algorithm with the optimal solution. Given the NP-Completeness and NP- Hardness of determining a feasible solution's existence and deriving an optimal solution in general cases, respectively, we propose two heuristic algorithms to offer efficient solutions, which are shown, via extensive simulations, to outperform the existing algorithms in terms of entanglement rates.

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

Routing entanglement in the quantum internet

Mihir Pant, Hari Krovi, Don Towsley +5 more

Abstract Remote quantum entanglement can enable numerous applications including distributed quantum computation, secure communication, and precision sensing. We consider how a quantum network—nodes equipped with limited quantum processing capabilities connected via lossy optical links—can distribute high-rate entanglement simultaneously between multiple pairs of users. We develop protocols for such quantum “repeater” nodes, which enable a pair of users to achieve large gains in entanglement rates over using a linear chain of quantum repeaters, by exploiting the diversity of multiple paths in the network. Additionally, we develop repeater protocols that enable multiple user pairs to generate entanglement simultaneously at rates that can far exceed what is possible with repeaters time sharing among assisting individual entanglement flows. Our results suggest that the early-stage development of quantum memories with short coherence times and implementations of probabilistic Bell-state measurements can have a much more profound impact on quantum networks than may be apparent from analyzing linear repeater chains. This framework should spur the development of a general quantum network theory, bringing together quantum memory physics, quantum information theory, quantum error correction, and computer network theory.

arXiv:1708.07142•npj Quantum Information•Mar 13, 2019•441 citations
Quantum Internet has the potential to support a wide range of applications in quantum communication and quantum computing by generating, distributing, and processing quantum information. Generating a long-distance quantum entanglement is one of the most essential functions of a quantum Internet to facilitate these applications. However, entanglement is a probabilistic process, and its success rate drops significantly as distance increases. Entanglement swapping is an efficient technique used to address this challenge. How to efficiently manage the entanglement through swapping is a fundamental yet challenging problem. In this paper, we will consider two swapping methods: (1) BSM: a classic entanglement-swapping method based on Bell State measurements that fuse two successful quantum links, (2) nfusion: a more general and efficient swapping method based on Greenberger-Horne-Zeilinger measurements, capable of fusing n successful quantum links. Our goal is to maximize the entanglement rate for multiple quantum-user pairs over the quantum Internet with an arbitrary topology. We propose efficient entanglement management algorithms that utilized the unique properties of BSM and n-fusion. Evaluation results highlight that our approach outperforms existing routing protocols.
Quantum Internet has the potential to support a wide range of applications in quantum communication and quantum computing by generating, distributing, and processing quantum information. Generating a long-distance quantum entanglement is one of the most fundamental functions of a quantum Internet to facilitate these applications. However, entanglement is a probabilistic process, and its success rate drops significantly as distance increases. Entanglement-swapping is an efficient technique used to address this challenge. How to efficiently manage the entanglement through swapping is a fundamental yet challenging problem. This article considers two entanglement-swapping methods: (1) Bell state measurement (BSM) entanglement-swapping: a classic entanglement-swapping method that is able to fuse two successful quantum links, (2) Greenberger-Horne-Zeilinger (GHZ) measurement entanglement-swapping: a more general and efficient swapping method which is capable of fusingnsuccessful quantum links. The goal is to maximize the entanglement rate for multiple quantum processor unit (QPU) pairs over the quantum Internet with a general topology. Two efficient entanglement management protocols are proposed which respectively make use of the unique properties of BSM and GHZ. Evaluation results highlight that the proposed protocols outperform the existing ones.
Generating a long-distance quantum entanglement is one of the most essential functions of a quantum network to support quantum communication and computing applications. The successful entanglement rate during a probabilistic entanglement process decreases dramatically with distance, and swapping is a widely-applied quantum technique to address this issue. Most existing entanglement routing protocols use a classic entanglement-swapping method based on Bell State measurements that can only fuse two successful entanglement links. This paper appeals to a more general and efficient swapping method, namely n-fusion based on Greenberger-Horne-Zeilinger measurements that can fuse n successful entanglement links, to maximize the entanglement rate for multiple quantum-user pairs over a quantum network. We propose efficient entanglement routing algorithms that utilize the properties of n-fusion for quantum networks with general topologies. Evaluation results highlight that our proposed algorithm under n-fusion can greatly improve the network performance compared with existing ones.
Abstract We develop a protocol for entanglement generation in the quantum internet that allows a repeater node to use n-qubit Greenberger-Horne-Zeilinger (GHZ) projective measurements that can fuse n successfully-entangled links, i.e., two-qubit entangled Bell pairs shared across n network edges, incident at that node. Implementing n-fusion, for n≥3, is in principle not much harder than 2-fusions (Bell-basis measurements) in solid-state qubit memories. If we allow even 3-fusions at the nodes, we find---by developing a connection to a modified version of the site-bond percolation problem---that despite lossy (hence probabilistic) link-level entanglement generation, and probabilistic success of the fusion measurements at nodes, one can generate entanglement between end parties Alice and Bob at a rate that stays constant as the distance between them increases. We prove that this powerful network property is not possible to attain with any quantum networking protocol built with Bell measurements and multiplexing alone. We also design a two-party quantum key distribution protocol that converts the entangled states shared between two nodes into a shared secret, at a key generation rate that is independent of the distance between the two parties.
This paper investigates the scalability and transmission efficiency of entanglement swapping protocols within multi-node quantum networks. As the realization of a global quantum internet relies heavily on long-distance entanglement distribution, quantum repeaters utilizing entanglement swapping serve as a critical backbone. However, scalability remains a bottleneck due to photon loss, operational infidelities, and quantum memory coherence times. In this study, we analytically model a multi-node quantum chain and evaluate how the end-to-end entanglement fidelity degrades as the number of intermediate nodes scales up. Our analysis highlights the critical thresholds for Bell state measurement (BSM) success rates required to maintain quantum state integrity across large distances. The findings provide optimization constraints for designing scalable and fault-tolerant routing protocols in future quantum information networks.
Quantum Internet has potential capabilities far beyond the traditional Internet and is thus a promising future platform for communication and computation. Entanglement is a cornerstone of quantum mechanics and forms the basis of numerous quantum applications in the quantum Internet. While existing studies primarily focus on two-user entanglement, a plethora of applications necessitates the leap to multi-user entanglement. This paper tackles the fundamental problem of multi-user entanglement routing in the quantum Internet, aiming to entangle multiple quantum users with a high entanglement rate. We abstract the problem as a novel graph routing problem, which is not readily addressed by existing graph problem solutions due to the unique characteristics of the quantum Internet. To address this problem, we first consider a sufficient condition ensuring a feasible solution's existence and design an algorithm with the optimal solution. Given the NP-Completeness and NP- Hardness of determining a feasible solution's existence and deriving an optimal solution in general cases, respectively, we propose two heuristic algorithms to offer efficient solutions, which are shown, via extensive simulations, to outperform the existing algorithms in terms of entanglement rates.
Abstract Remote quantum entanglement can enable numerous applications including distributed quantum computation, secure communication, and precision sensing. We consider how a quantum network—nodes equipped with limited quantum processing capabilities connected via lossy optical links—can distribute high-rate entanglement simultaneously between multiple pairs of users. We develop protocols for such quantum “repeater” nodes, which enable a pair of users to achieve large gains in entanglement rates over using a linear chain of quantum repeaters, by exploiting the diversity of multiple paths in the network. Additionally, we develop repeater protocols that enable multiple user pairs to generate entanglement simultaneously at rates that can far exceed what is possible with repeaters time sharing among assisting individual entanglement flows. Our results suggest that the early-stage development of quantum memories with short coherence times and implementations of probabilistic Bell-state measurements can have a much more profound impact on quantum networks than may be apparent from analyzing linear repeater chains. This framework should spur the development of a general quantum network theory, bringing together quantum memory physics, quantum information theory, quantum error correction, and computer network theory.