2012/02/13 by Yu‐Bo Sheng, Yu-Bo Sheng, Lan Zhou +5
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph) #quant-ph
paper · pdf · doi:10.48550/arxiv.1202.2616
10 pages, 8 figures
arxiv created 2012/02/13 · openalex publication_date 2012/02/13 · arxiv updated 2012/02/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We present an optimal entanglement concentration ECP for an arbitrary less-entangled W state. By two of the parties say Alice and Charlie performing one parity check measurements, they can obtain the maximally entangled W state with a certain probability. Otherwise, they can obtain another lesser-entangled W state with another probability, which can be used to reconcentrated into a maximally entangled W state. By iterating this ECP several times, it has the maximal success probability. This ECP maybe an optimal one and is useful in current quantum information processing.