2000/06/29 by Lucien Hardy, Lucién Hardy, David D. Song +1
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Bipartite graph #Chain (unit) #Class (philosophy) #Combinatorics #Computer science #Dimension (graph theory) #Discrete mathematics #Mathematical analysis #Mathematics #Multipartite entanglement #Pairwise comparison #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #Scheme (mathematics) #Squashed entanglement #State (computer science) #Statistics #Topology (electrical circuits) #W state #quant-ph
paper · pdf · doi:10.1103/physreva.62.052315
published as Phys. Rev. A 62, 052315 (2000) · 18 pages, 5 figures
arxiv created 2000/06/29 · openalex publication_date 2000/10/18 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
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.