2009/06/30 by Francesco Buscemi, Nilanjana Datta · 5 citations
Computer Science · Physics and Astronomy · #Algorithm #Artificial intelligence #Bipartite graph #Computer science #Contrast (vision) #Data mining #LOCC #Law #Multipartite entanglement #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #Relation (database) #Relevance (law) #Squashed entanglement #State (computer science) #Statistical physics #Theoretical computer science #quant-ph
paper · pdf · doi:10.1103/physrevlett.106.130503
published as Physical Review Letters 106, 130503 (2011) · 4+4 pages. See also arXiv:0704.1957; v2: minor typos corrected; v3: final version to appear on PRL
arxiv created 2011/03/03 · openalex publication_date 2011/03/30 · arxiv updated 2011/04/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We quantify the one-shot entanglement cost of an arbitrary bipartite state, that is, the minimum number of singlets needed by two distant parties to create a single copy of the state up to a finite accuracy, by using local operations and classical communication only. This analysis, in contrast to the traditional one, pertains to scenarios of practical relevance, in which resources are finite and transformations can be achieved only approximately. Moreover, it unveils a fundamental relation between two well-known entanglement measures, namely, the Schmidt number and the entanglement of formation. Using this relation, we are able to recover the usual expression of the entanglement cost as a special case.