1999/11/30 by Somshubhro Bandyopadhyay
Computer Science · Physics and Astronomy · #Multipartite entanglement #Peres–Horodecki criterion #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #Qubit #Squashed entanglement #Statistical physics #W state #quant-ph
paper · pdf · doi:10.1103/physreva.62.032308
published as Phys. Rev. A 62, 032308 (2000) · Latex, 12 pages: Enlarged version: To appear in Phys. Rev. A. Changes made: another protocol added, practical implementation of the proposals discussed
arxiv created 2000/04/27 · openalex publication_date 2000/08/17 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We present two methods for optimal entanglement concentration from pure entangled states by local actions only. However, a prior knowledge of the Schmidt coefficients is required. The first method is optimally efficient only when a finite ensemble of pure entangled states are available, whereas the second method realizes the single pair optimal concentration probability. We also propose an entanglement-assisted method that is again optimally efficient even for a single pair. We also discuss concentrating entanglement from N-partite catlike states.