2015/03/27 by Christopher Eltschka, Geza Toth, G. Tóth +1 · 28 citations
Computer Science · Engineering · Mathematics · Physics and Astronomy · Psychology · #Algorithm #Artificial intelligence #Bipartite graph #Combinatorics #Computer science #Concurrence #Engineering #Link (geometry) #Mathematics #Negativity effect #Physics #Psychology #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #Social psychology #State (computer science) #Task (project management) #Theoretical computer science #Transpose #Transposition (logic) #quant-ph
paper · pdf · doi:10.1103/physreva.91.032327
published in Physical Review A 91(3) (American Physical Society) · 10 pages, 3 figures
openalex publication_date 2015/03/27 · arxiv created 2015/05/07 · arxiv updated 2015/05/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Detection of entanglement in bipartite states is a fundamental task in quantum information. The first method to verify entanglement in mixed states was the partial-transpose criterion. Subsequently, numerous quantifiers for bipartite entanglement were introduced, among them concurrence and negativity. Surprisingly, these quantities are often treated as distinct or independent of each other. The aim of this contribution is to highlight the close relations between these concepts, to show the connections between seemingly independent results, and to present various estimates for the mixed-state concurrence within the same framework.