1999/02/28 by Guifre Vidal, Guifré Vidal · 433 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Bipartite graph #Computer science #Finite set #LOCC #Mathematical analysis #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #Set (abstract data type) #State (computer science) #Statistical physics #Theoretical computer science #quant-ph
paper · pdf · doi:10.1103/physrevlett.83.1046
published in Physical Review Letters 83(5), 1046-1049 (American Physical Society) · Revtex, 4 pages, no figures. Minor changes. Appendix removed
arxiv created 1999/03/26 · openalex publication_date 1999/08/02 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06
An optimal local conversion strategy between any two pure states of a bipartite system is presented. It is optimal in that the probability of success is the largest achievable if the parties which share the system, and which can communicate classically, are only allowed to act locally on it. The study of optimal local conversions sheds some light on the entanglement of a single copy of a pure state. We propose a quantification of such an entanglement by means of a finite minimal set of new measures from which the optimal probability of conversion follows.