2009/12/28 by Yangjia Li, Runyao Duan, Mingsheng Ying
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Artificial intelligence #Bipartite graph #Class (philosophy) #Computer science #Entanglement witness #Law #Mathematics #Multipartite entanglement #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum channel #Quantum entanglement #Quantum mechanics #Quantum state #Quantum teleportation #Set (abstract data type) #Squashed entanglement #State (computer science) #Statistical physics #Theoretical computer science #Unitary state #W state #quant-ph
paper · pdf · doi:10.1103/physreva.82.032339
7 pages. Comments are welcome
arxiv created 2009/12/28 · openalex publication_date 2010/09/30 · arxiv updated 2015/05/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
A bipartite state, which is secretly chosen from a finite set of known entangled pure states, cannot immediately be useful in standard quantum information processing tasks. To effectively make use of the entanglement contained in this unknown state, we introduce a way to locally manipulate the original quantum system: either identify the state successfully or distill some pure entanglement. Remarkably, if many copies are available, we show that any finite set of entangled pure states, whether orthogonal or not, can be locally distinguished in this way, which further implies that pure entanglement can be deterministically extracted from unknown entanglement. These results make it clear why a large class of entangled bipartite quantum operations including unitary operations and measurements that are globally distinguishable can also be locally distinguishable: They can generate pure entanglement consistently.