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

arXiv:quant-ph/0006132 · Physical Review A

Entanglement-swapping chains for general pure states

Lucién Hardy, David D. Song

Published Oct 18, 2000• 59 citations
arXivHTMLPDF

Abstract

We consider entanglement-swapping schemes with general (rather than maximally) entangled bipartite states of arbitary dimension shared pairwise between three or more parties in a chain. The intermediate parties perform generalized Bell measurements with the result that the two end parties end up sharing an entangled state which can be converted into maximally entangled states. We obtain an expression for the average amount of maximal entanglement concentrated in such a scheme and show that in a certain reasonably broad class of cases this scheme is provably optimal and that, in these cases, the amount of entanglement concentrated between the two ends is equal to that which could be concentrated from the weakest link in the chain.

DOI
10.1103/physreva.62.052315

Related papers

Entanglement swapping theory and beyond

Zhaoxu Ji, Huanguo Zhang

We focus on the general theory of entanglement swapping, including entanglement swapping of pure and mixed states. We also study the theory of entangled swapping chains, which can be regarded as an application of entangled swapping. For maximally entangled states, we consider the entanglement swapping of 2-level maximally entangled states without limiting each subsystem to be in the same basis. We further consider the entanglement swapping between d-level maximally entangled states, which is realized by performing a joint measurement on the particles that contain the first particle of the selected entangled states and the particles without involving the first particle in other entangled states. For the entanglement swapping of general pure state, we generalize the case of two bipartite general pure states to multi-state cases. Besides, we propose the entanglement swapping between bipartite general pure states and maximally entangled states. For entanglement swapping chains, we propose the entanglement swapping chains for maximally entangled states, which is realized by performing joint measurements on multiple particles in each state, we use mathematical induction to prove the results of entanglement swapping chains of maximally entangled states and that of general pure states. Moreover, we study the entanglement swapping and entanglement swapping chains of mixed states, including X states and mixed maximally entangled states. Finally, we provide a new proof for our previous work [2022, Physica A, 585, 126400].

arXiv:2009.02555•Sep 5, 2020•10 citations

Remarks on entanglement swapping

Daegene Song

In two partially entangled states, entanglement swapping by Bell measurement will yield the weaker entanglement of the two. This scheme is optimal because the average entanglement cannot increase under local operation and classical communication. However, for more than two states, this scheme does not always yield the weakest link. We consider projective measurements other than Bell-type measurement and show, numerically, that while Bell measurement may not be unique, it is indeed optimal among these projective measurements. We also discuss the non-uniqueness of Bell measurements.

Journal of Optics B Quantum and Semiclassical Optics•Oct 1, 2003•2 citations

Entanglement-swapping measurements for deterministic entanglement distribution

Mir Alimuddin, Jaemin Kim, Antonio Acín +1 more

Entanglement swapping is a key primitive for distributing entanglement over quantum networks, but different measurement outcomes can produce end-to-end states with different entanglement, requiring branch-dependent processing or the rejection of unfavorable outcomes. We characterize all projective swapping measurements with full-Schmidt-rank vectors such that, for every pair of pure input links, all outcomes yield the same end-to-end state up to local-unitary corrections. Within this family, the measurements that maximize the average G-concurrence for every input pair are built from complex Hadamard operators, and every outcome individually attains the optimum. Classifying the underlying complex Hadamard operators that preserve optimal deterministic swapping gives one class for $d=2,3$, exactly $72$ classes for $d=5$, and uncountably many whenever $d=4k$. We show further that for $d=2,3$, the corrected end-to-end state in a swapping chain is independent of the swapping order, and discuss noise robustness under depolarizing noise and arbitrary convex input contamination. For pure inputs, these schemes retain every outcome while achieving optimal G-concurrence and therefore eliminate outcome-based postselection.

quant-pharXiv:2601.08581•Quantum Science and Technology•Jan 14, 2026•1 citation

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 Society•Mar 1, 2019•0 citations

Optimal High-Dimensional Entanglement Concentration for Pure Bipartite Systems

Lukas Palma Torres, M. A. Solís-Prosser, O. Jiménez +2 more

Considering pure quantum states, entanglement concentration is the procedure where, from N copies of a partially entangled state, a single state with higher entanglement can be obtained. Obtaining a maximally entangled state is possible for N=1. However, the associated success probability can be extremely low when increasing the system’s dimensionality. In this work, we study two methods to achieve a probabilistic entanglement concentration for bipartite quantum systems with a large dimensionality for N=1, regarding a reasonably good probability of success at the expense of having a non-maximal entanglement. Firstly, we define an efficiency function Q considering a tradeoff between the amount of entanglement (quantified by the I-Concurrence) of the final state after the concentration procedure and its success probability, which leads to solving a quadratic optimization problem. We found an analytical solution, ensuring that an optimal scheme for entanglement concentration can always be found in terms of Q. Finally, a second method was explored, which is based on fixing the success probability and searching for the maximum amount of entanglement attainable. Both ways resemble the Procrustean method applied to a subset of the most significant Schmidt coefficients but obtaining non-maximally entangled states.

arXiv:2304.04890•Micromachines•Jun 7, 2023•1 citation

Absolutely Maximally Entangled States: Existence and Applications

Wolfram Helwig, Wei Cui

We investigate absolutely maximally entangled (AME) states, which are multipartite quantum states that are maximally entangled with respect to any possible bipartition. These strong entanglement properties make them a powerful resource for a variety of quantum information protocols. In this paper, we show the existence of AME states for any number of parties, given that the dimension of the involved systems is chosen appropriately. We prove the equivalence of AME states shared between an even number of parties and pure state threshold quantum secret sharing (QSS) schemes, and prove necessary and sufficient entanglement properties for a wider class of ramp QSS schemes. We further show how AME states can be used as a valuable resource for open-destination teleportation protocols and to what extend entanglement swapping generalizes to AME states.

arXiv:1306.2536•Jun 11, 2013•88 citations
We consider entanglement-swapping schemes with general (rather than maximally) entangled bipartite states of arbitary dimension shared pairwise between three or more parties in a chain. The intermediate parties perform generalized Bell measurements with the result that the two end parties end up sharing an entangled state which can be converted into maximally entangled states. We obtain an expression for the average amount of maximal entanglement concentrated in such a scheme and show that in a certain reasonably broad class of cases this scheme is provably optimal and that, in these cases, the amount of entanglement concentrated between the two ends is equal to that which could be concentrated from the weakest link in the chain.
We focus on the general theory of entanglement swapping, including entanglement swapping of pure and mixed states. We also study the theory of entangled swapping chains, which can be regarded as an application of entangled swapping. For maximally entangled states, we consider the entanglement swapping of 2-level maximally entangled states without limiting each subsystem to be in the same basis. We further consider the entanglement swapping between d-level maximally entangled states, which is realized by performing a joint measurement on the particles that contain the first particle of the selected entangled states and the particles without involving the first particle in other entangled states. For the entanglement swapping of general pure state, we generalize the case of two bipartite general pure states to multi-state cases. Besides, we propose the entanglement swapping between bipartite general pure states and maximally entangled states. For entanglement swapping chains, we propose the entanglement swapping chains for maximally entangled states, which is realized by performing joint measurements on multiple particles in each state, we use mathematical induction to prove the results of entanglement swapping chains of maximally entangled states and that of general pure states. Moreover, we study the entanglement swapping and entanglement swapping chains of mixed states, including X states and mixed maximally entangled states. Finally, we provide a new proof for our previous work [2022, Physica A, 585, 126400].
In two partially entangled states, entanglement swapping by Bell measurement will yield the weaker entanglement of the two. This scheme is optimal because the average entanglement cannot increase under local operation and classical communication. However, for more than two states, this scheme does not always yield the weakest link. We consider projective measurements other than Bell-type measurement and show, numerically, that while Bell measurement may not be unique, it is indeed optimal among these projective measurements. We also discuss the non-uniqueness of Bell measurements.
Entanglement swapping is a key primitive for distributing entanglement over quantum networks, but different measurement outcomes can produce end-to-end states with different entanglement, requiring branch-dependent processing or the rejection of unfavorable outcomes. We characterize all projective swapping measurements with full-Schmidt-rank vectors such that, for every pair of pure input links, all outcomes yield the same end-to-end state up to local-unitary corrections. Within this family, the measurements that maximize the average G-concurrence for every input pair are built from complex Hadamard operators, and every outcome individually attains the optimum. Classifying the underlying complex Hadamard operators that preserve optimal deterministic swapping gives one class for d=2,3d=2,3d=2,3, exactly 727272 classes for d=5d=5d=5, and uncountably many whenever d=4kd=4kd=4k. We show further that for d=2,3d=2,3d=2,3, the corrected end-to-end state in a swapping chain is independent of the swapping order, and discuss noise robustness under depolarizing noise and arbitrary convex input contamination. For pure inputs, these schemes retain every outcome while achieving optimal G-concurrence and therefore eliminate outcome-based postselection.
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.
Considering pure quantum states, entanglement concentration is the procedure where, from N copies of a partially entangled state, a single state with higher entanglement can be obtained. Obtaining a maximally entangled state is possible for N=1. However, the associated success probability can be extremely low when increasing the system’s dimensionality. In this work, we study two methods to achieve a probabilistic entanglement concentration for bipartite quantum systems with a large dimensionality for N=1, regarding a reasonably good probability of success at the expense of having a non-maximal entanglement. Firstly, we define an efficiency function Q considering a tradeoff between the amount of entanglement (quantified by the I-Concurrence) of the final state after the concentration procedure and its success probability, which leads to solving a quadratic optimization problem. We found an analytical solution, ensuring that an optimal scheme for entanglement concentration can always be found in terms of Q. Finally, a second method was explored, which is based on fixing the success probability and searching for the maximum amount of entanglement attainable. Both ways resemble the Procrustean method applied to a subset of the most significant Schmidt coefficients but obtaining non-maximally entangled states.
We investigate absolutely maximally entangled (AME) states, which are multipartite quantum states that are maximally entangled with respect to any possible bipartition. These strong entanglement properties make them a powerful resource for a variety of quantum information protocols. In this paper, we show the existence of AME states for any number of parties, given that the dimension of the involved systems is chosen appropriately. We prove the equivalence of AME states shared between an even number of parties and pure state threshold quantum secret sharing (QSS) schemes, and prove necessary and sufficient entanglement properties for a wider class of ramp QSS schemes. We further show how AME states can be used as a valuable resource for open-destination teleportation protocols and to what extend entanglement swapping generalizes to AME states.