New Algorithm for Entanglement Swapping

Zhaoxu Ji, Huanguo Zhang

Published Feb 17, 2025• 0 citations

Abstract

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.

DOI: 10.20944/preprints202502.1244.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, 20250 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, 20250 citations

The utility of entanglement swapping in quantum communications

Brian T. Kirby, Siddhartha Santra, Vladimir S. Malinovsky +1 more

The nonlocal correlations between quantum states in an entangled system are essential to many quantum communications applications. A basic quantum operation, which permits the distribution of entanglement between two initially uncorrelated systems, is entanglement swapping. Here we present a rigorous formulation of entanglement swapping of any two partially mixed two-qubit states without limiting ourselves to any specific type of state or noise. Further, for two important classes of the input states, Bell diagonal and pure states, we describe how the concurrence of the final state is related to the concurrence of the initial states. First, we consider Bell diagonal states, and find bounds on the concurrence of the final state in terms of the concurrences of the initial states. These bounds are important for communications applications because polarization mode dispersion in fibers produces Bell diagonal states up to a local unitary rotation. Second, we show that swapping pure states occasionally results in a state of higher concurrence than either of the initial states. In addition, we find that two pure states are most likely to be capable of swapping to a state of increased concurrence when the two initial states have similar concurrences. Our analysis offers a completely general framework for investigating the behavior of any pair of two-qubit states when used for entanglement swapping.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIESep 13, 20160 citations

Entanglement swapping of two arbitrarily degraded entangled states

Brian T. Kirby, Siddhartha Santra, Vladimir S. Malinovsky +1 more

We consider entanglement swapping, a key component of quantum network operations and entanglement distribution. Pure entangled states, which are the desired input to the swapping protocol, are typically mixed by environmental interactions, causing a reduction in their degree of entanglement. Thus an understanding of entanglement swapping with partially mixed states is of importance. Here we present a general analytical solution for entanglement swapping of arbitrary two-qubit states. Our result provides a comprehensive method for analyzing entanglement swapping in quantum networks. First, we show that the concurrence of a partially mixed state is conserved when this state is swapped with a Bell state. Then, we find upper and lower bounds on the concurrence of the state resulting from entanglement swapping for various classes of input states. Finally, we determine a general relationship between the ranks of the initial states and the rank of the final state after swapping.

arXiv:1512.06093Physical Review AJul 20, 201649 citations

Some Numerical Cases of Entanglement Concentration Using Entanglement Swapping

Daegene Song

The quantum information network is important in establishing next-generation technology. In particular, maximal and long-distance entangled states are important in realizing a number of quantum information technologies, such as teleportation, key distribution and so forth. Entanglement swapping is a scheme that creates a long-distance network by using multiple short ones. Entanglement swapping protocols applied to non-maximal correlations have been thoroughly investigated by various people. Rather than providing any new analytic results, some examples of a numerical approach will be provided in this paper. In particular, the paper reveals the existence of different classes of coefficients that approximate the optimal outcome ( i.e. , the weaker average maximal entanglement between the two initial states). The new class of states is non-trivial in the sense that their coefficients are just as widely distributed as the coefficients of states satisfying optimality conditions are. Moreover, we will numerically examine entanglement swapping methods and show the distribution of optimal and general coefficients for three and four 2-level correlations.

Journal of the Korean Physical SocietyMar 1, 20190 citations

Entanglement Swapping for Quantum Information Masking

Zhaoxu Ji, Huanguo Zhang

Entanglement swapping is the cornerstone of quantum networks,while quantum information masking is a method to ensure data privacy. The combination of the two can open new perspectives for ensuring information security in quantum network environments. In this paper, we study entanglement swapping with information masking. We consider the entanglement swapping that combines several quantum information masking methods, including the entanglement swapping of two-particle entangled states and multi-particle ones. Based on our previous work [2025, arXiv, 2009.02555v11], we derive the entanglement swapping formulas. Besides, we put forward some hypotheses about observers, which, although not the main focus of this paper, can inspire people to rethink quantum mechanics phenomena and the relationship between humans and nature.

Jul 29, 20260 citations