2007/08/31 by Bing He, János A. Bergou · 15 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Bipartite graph #Boson #Combinatorics #Computer science #Discrete mathematics #Extension (predicate logic) #LOCC #Mathematical analysis #Mathematics #Multipartite entanglement #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #Scheme (mathematics) #Squashed entanglement #State (computer science) #Topology (electrical circuits) #Transformation (genetics) #W state #quant-ph
paper · pdf · doi:10.1103/physreva.78.062328
published in Physical Review A 78(6) (American Physical Society) · published version
arxiv created 2008/11/27 · openalex publication_date 2008/12/16 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We present an optimal scheme to realize the transformations between single copies of two bipartite entangled states without classical communication between the sharing parties. The scheme achieves the upper bound for the success probabilities [Phys. Rev. A 63, 022301 (2001); Phys. Rev. Lett. 83, 1455 (1999)] of generating maximally entangled states if applied to entanglement concentration. Such a strategy also dispenses with the interaction with an ancilla system in the implementation. We also show that classical communications are indispensable in realizing the deterministic transformations of a single bipartite entangled state. With a finite number of identical pairs of two entangled bosons, on the other hand, we can realize the deterministic transformation to any target entangled state of equal or less Schmidt rank through an extension of the scheme.