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

Cosmic Quantum Network

Zhaoxu Ji, Huanguo Zhang

Published May 19, 2026• 0 citations
Publisher

Abstract

Entanglement swapping can connect segmented quantum channels to form long-distance quantum channels, which is a key mechanism for realizing large-scale quantum networks and remote quantum communication. In this paper, we show the basic principles of entanglement swapping and propose a new calculation method to derive entanglement swapping results, which is demonstrated through the entanglement swapping between two bipartite entangled states. In addition, we propose an infinitely scalable star-shaped quantum network, which is composed of quantum computers connected through quantum channels. These computers interact with an observable universe: obtaining observational information from it and automatically providing feedback after processing the information.

DOI
10.20944/preprints202605.1256.v1

Related papers

New Algorithm for Entanglement Swapping

Zhaoxu Ji, Huanguo Zhang

Entanglement swapping is a key technology to realize long-distance quantum communication and build quantum networks, and has extensive and important applications in quantum information processing. In this paper, we propose a new algorithm to obtain entanglement swapping results, which is based on the idea of constructing new entangled states after entanglement swapping from all possible observation outcomes. We demonstrate the algorithm by the entanglement swapping between two bipartite entangled states, and derive the results of entanglement swapping between two 2-level Bell states, which are consistent with those obtained through algebraic calculations. Our work can provide new perspectives for thinking about the principles of quantum mechanics and trigger in-depth exploration of quantum mechanics principles and natural mysteries.

•Mar 18, 2025•0 citations

New Algorithm for Entanglement Swapping

Zhaoxu Ji, Huanguo Zhang

Entanglement swapping is one of the most peculiar quantum mechanical phenomena, which is a key technology to realize long-distance quantum communication and build quantum networks, and has extensive and important applications in quantum information processing. In this paper, we combine some principles of classical physics with those of quantum mechanics to propose a new theoretical framework and design a new algorithm for entanglement swapping based on it, the basic idea of which is to construct two entangled states after entanglement swapping from all possible observations. We demonstrate the algorithm by the entanglement swapping between two bipartite entangled states, and derive the results of entanglement swapping between two Bell states, which are consistent with those obtained through algebraic calculations. Our work not only provide new perspectives for exploring quantum mechanical phenomena and the principles behind them, but also can trigger in-depth exploration of the mysteries of nature.

•May 6, 2025•0 citations

Anonymous Computation in Quantum Networks

Zhaoxu Ji, Huanguo Zhang

Entanglement swapping is not only one of the core resources of quantum information processing, but also the backbone of long-distance quantum communication and quantum networks. Naturally, quantum information processing schemes based on entanglement swapping, such as quantum cryptography protocols and quantum algorithms, are more adaptable to quantum network environments. In this paper, we achieve quantum anonymous computation through entanglement swapping, the basic idea of which comes from our previous work [2019, Quantum Information Processing, 18(6), 168]. We propose two quantum anonymous computation protocols, in which entanglement swapping plays a crucial role in transmitting information and enhancing information security.

•Jun 29, 2026•0 citations

Efficient Entanglement Swapping in Quantum Networks for Multi-User Scenarios

Binjie He, Seng W. Loke, Luke Lu +1 more

Entanglement swapping is a crucial step in quantum communication, generating long-distance entanglements between quantum users for quantum network applications, such as distributed quantum computing. This study focuses on the efficiency of entanglement swapping strategies in quantum networks, particularly in multi-user concurrent quantum communication. Since multi-user concurrent quantum communication consists of multiple point-to-point quantum communications, we first analyze the challenges faced by existing entanglement swapping strategies in this scenario and then propose Parallel Segment Entanglement Swapping (PSES) to address them. PSES utilizes a tree-like model to divide the path into segments and execute entanglement swapping in parallel across them, thereby enhancing the generation rate of long-distance entanglement. Furthermore, we analyze the impact of resource contention on entanglement swapping in multi-user concurrent quantum communication and propose Multi-user PSES (M-PSES) to alleviate this negative impact. M-PSES leverages the entanglement swapping trigger signal and resource locking mechanisms to mitigate resource contention. The simulation results show that PSES performs superiorly to existing entanglement swapping strategies in point-to-point quantum communication, and M-PSES can achieve better performance than PSES in multi-user concurrent quantum communication.

Entropy•Jun 9, 2025•2 citations

New Algorithm for Entanglement Swapping

Zhaoxu Ji, Huanguo Zhang

Entanglement swapping has important applications in various fields such as quantum information processingand the preparation of entangled states. In this paper, we propose a new algorithm for deriving entanglement swapping results. The basic idea of our algorithm is to deduce the entanglement swapping results from all possible observation results, which is simpler than existing algorithms. We demonstrate the algorithm by the entanglement swapping between two bipartite entangled states, and derive the results of entanglement swapping between two 2-level Bell states, which are consistent with those obtained through algebraic calculations.

•Feb 17, 2025•0 citations

Practical long-distance quantum communication using concatenated entanglement swapping

Aeysha Khalique, Wolfgang Tittel, Barry C. Sanders

We construct a theory for long-distance quantum communication based on sharing entanglement through a linear chain of $N$ elementary swapping segments of length $L=Nl$ where $l$ is the length of each elementary swap setup. Entanglement swapping is achieved by linear optics, photon counting, and postselection, and we include effects due to multiphoton sources, transmission loss, and detector inefficiencies and dark counts. Specifically we calculate the resultant four-mode state shared by the two parties at the two ends of the chain, and we derive the two-photon coincidence rate expected for this state and thereby the visibility of this long-range-entangled state. The expression is a nested sum with each sum extending from zero to infinite photons, and we solve the case $N=2$ exactly for the ideal case (zero dark counts, unit-efficiency detectors, and no transmission loss) and numerically for $N=2$ in the nonideal case with truncation at ${n}_{\mathrm{max}}=3$ photons in each mode. For the general case, we show that the computational complexity for the numerical solution is ${n}_{\mathrm{max}}^{12N}$.

arXiv:1305.3946•Physical Review A•Aug 28, 2013•19 citations
Entanglement swapping can connect segmented quantum channels to form long-distance quantum channels, which is a key mechanism for realizing large-scale quantum networks and remote quantum communication. In this paper, we show the basic principles of entanglement swapping and propose a new calculation method to derive entanglement swapping results, which is demonstrated through the entanglement swapping between two bipartite entangled states. In addition, we propose an infinitely scalable star-shaped quantum network, which is composed of quantum computers connected through quantum channels. These computers interact with an observable universe: obtaining observational information from it and automatically providing feedback after processing the information.
Entanglement swapping is a key technology to realize long-distance quantum communication and build quantum networks, and has extensive and important applications in quantum information processing. In this paper, we propose a new algorithm to obtain entanglement swapping results, which is based on the idea of constructing new entangled states after entanglement swapping from all possible observation outcomes. We demonstrate the algorithm by the entanglement swapping between two bipartite entangled states, and derive the results of entanglement swapping between two 2-level Bell states, which are consistent with those obtained through algebraic calculations. Our work can provide new perspectives for thinking about the principles of quantum mechanics and trigger in-depth exploration of quantum mechanics principles and natural mysteries.
Entanglement swapping is one of the most peculiar quantum mechanical phenomena, which is a key technology to realize long-distance quantum communication and build quantum networks, and has extensive and important applications in quantum information processing. In this paper, we combine some principles of classical physics with those of quantum mechanics to propose a new theoretical framework and design a new algorithm for entanglement swapping based on it, the basic idea of which is to construct two entangled states after entanglement swapping from all possible observations. We demonstrate the algorithm by the entanglement swapping between two bipartite entangled states, and derive the results of entanglement swapping between two Bell states, which are consistent with those obtained through algebraic calculations. Our work not only provide new perspectives for exploring quantum mechanical phenomena and the principles behind them, but also can trigger in-depth exploration of the mysteries of nature.
Entanglement swapping is not only one of the core resources of quantum information processing, but also the backbone of long-distance quantum communication and quantum networks. Naturally, quantum information processing schemes based on entanglement swapping, such as quantum cryptography protocols and quantum algorithms, are more adaptable to quantum network environments. In this paper, we achieve quantum anonymous computation through entanglement swapping, the basic idea of which comes from our previous work [2019, Quantum Information Processing, 18(6), 168]. We propose two quantum anonymous computation protocols, in which entanglement swapping plays a crucial role in transmitting information and enhancing information security.
Entanglement swapping is a crucial step in quantum communication, generating long-distance entanglements between quantum users for quantum network applications, such as distributed quantum computing. This study focuses on the efficiency of entanglement swapping strategies in quantum networks, particularly in multi-user concurrent quantum communication. Since multi-user concurrent quantum communication consists of multiple point-to-point quantum communications, we first analyze the challenges faced by existing entanglement swapping strategies in this scenario and then propose Parallel Segment Entanglement Swapping (PSES) to address them. PSES utilizes a tree-like model to divide the path into segments and execute entanglement swapping in parallel across them, thereby enhancing the generation rate of long-distance entanglement. Furthermore, we analyze the impact of resource contention on entanglement swapping in multi-user concurrent quantum communication and propose Multi-user PSES (M-PSES) to alleviate this negative impact. M-PSES leverages the entanglement swapping trigger signal and resource locking mechanisms to mitigate resource contention. The simulation results show that PSES performs superiorly to existing entanglement swapping strategies in point-to-point quantum communication, and M-PSES can achieve better performance than PSES in multi-user concurrent quantum communication.
Entanglement swapping has important applications in various fields such as quantum information processingand the preparation of entangled states. In this paper, we propose a new algorithm for deriving entanglement swapping results. The basic idea of our algorithm is to deduce the entanglement swapping results from all possible observation results, which is simpler than existing algorithms. We demonstrate the algorithm by the entanglement swapping between two bipartite entangled states, and derive the results of entanglement swapping between two 2-level Bell states, which are consistent with those obtained through algebraic calculations.
We construct a theory for long-distance quantum communication based on sharing entanglement through a linear chain of NNN elementary swapping segments of length L=NlL=NlL=Nl where lll is the length of each elementary swap setup. Entanglement swapping is achieved by linear optics, photon counting, and postselection, and we include effects due to multiphoton sources, transmission loss, and detector inefficiencies and dark counts. Specifically we calculate the resultant four-mode state shared by the two parties at the two ends of the chain, and we derive the two-photon coincidence rate expected for this state and thereby the visibility of this long-range-entangled state. The expression is a nested sum with each sum extending from zero to infinite photons, and we solve the case N=2N=2N=2 exactly for the ideal case (zero dark counts, unit-efficiency detectors, and no transmission loss) and numerically for N=2N=2N=2 in the nonideal case with truncation at nmax=3{n}_{\mathrm{max}}=3nmax​=3 photons in each mode. For the general case, we show that the computational complexity for the numerical solution is nmax12N{n}_{\mathrm{max}}^{12N}nmax12N​.