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

IEEE Network

Entanglement Management Through Swapping Over Quantum Internets

Yiming Zeng, Jiarui Zhang, Ji yin Liu, Zhenhua Liu, Yuanyuan Yang

Published Oct 24, 2023• 4 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 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.

DOI
10.1109/mnet.2023.3327232

Related papers

Entanglement Management through Swapping over Quantum Internets

Yiming Zeng, Jiarui Zhang, Zhenhua Liu +1 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 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.

ACM SIGMETRICS Performance Evaluation Review•Sep 28, 2023•2 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

Multi-system entanglement swapping for Bell states and Greenberger-Horne-Zeilinger states

Zhaoxu Ji, Peiru Fan, Huanguo Zhang

We introduce a class of multi-particle Greenberger-Horne-Zeilinger (GHZ) states, and study entanglement swapping between two qubit systems for Bell states and for the class of GHZ states, respectively. We generalize the bi-system entanglement swapping of Bell states and multi-particle GHZ states to any number of qubit systems. We further study the entanglement swapping schemes between any number of Bell states and between any number of the introduced GHZ states in a detailed way, and propose the schemes that can generate two identical GHZ states. We illustrate the applications of such schemes in quantum information processing by proposing quantum protocols for quantum key distribution, quantum secret sharing and quantum private comparison.

•Nov 22, 2019•2 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

Routing Entanglement in Complex Quantum Networks Using GHZ States

Xin-An Chen, Caitao Zhan, Joaquin Chung +1 more

Distributing entanglement to distant parties in a network is a central task in quantum information processing and quantum networking. The sensitivity of entangled states to loss necessitates the use of entanglement routing strategies. Recently, a routing strategy using Greenberger-Horne-Zeilinger (GHZ) measurements instead of Bell state measurements (BSM) has been proposed. We further this direction of research by explicitly considering the varying measurement success probabilities of GHZ measurements. Moreover, we extend the analysis beyond square grid networks to complex network models such as Waxman networks and scale-free networks, as well as SURFnet, a real-world network topology in the Netherlands. Taking into account the varying success probabilities, naive application of GHZ routing achieves rates much lower than the conventional BSM routing. Instead, we propose a hybrid GHZ-BSM routing strategy. The hybrid GHZ-BSM routing strategy outperforms BSM routing in square grid networks. In other networks, however, more sophisticated adaptations using global information are required.

quant-pharXiv:2604.03155•International Conference on Quantum Communications, Networking, and Computing (QCNC)•Apr 6, 2026•0 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 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.
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.
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.
We introduce a class of multi-particle Greenberger-Horne-Zeilinger (GHZ) states, and study entanglement swapping between two qubit systems for Bell states and for the class of GHZ states, respectively. We generalize the bi-system entanglement swapping of Bell states and multi-particle GHZ states to any number of qubit systems. We further study the entanglement swapping schemes between any number of Bell states and between any number of the introduced GHZ states in a detailed way, and propose the schemes that can generate two identical GHZ states. We illustrate the applications of such schemes in quantum information processing by proposing quantum protocols for quantum key distribution, quantum secret sharing and quantum private comparison.
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.
Distributing entanglement to distant parties in a network is a central task in quantum information processing and quantum networking. The sensitivity of entangled states to loss necessitates the use of entanglement routing strategies. Recently, a routing strategy using Greenberger-Horne-Zeilinger (GHZ) measurements instead of Bell state measurements (BSM) has been proposed. We further this direction of research by explicitly considering the varying measurement success probabilities of GHZ measurements. Moreover, we extend the analysis beyond square grid networks to complex network models such as Waxman networks and scale-free networks, as well as SURFnet, a real-world network topology in the Netherlands. Taking into account the varying success probabilities, naive application of GHZ routing achieves rates much lower than the conventional BSM routing. Instead, we propose a hybrid GHZ-BSM routing strategy. The hybrid GHZ-BSM routing strategy outperforms BSM routing in square grid networks. In other networks, however, more sophisticated adaptations using global information are required.
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.