2008/12/31 by Geza Toth, G. Tóth, Otfried Gühne · 2 citations
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph
paper · pdf · doi:10.1103/physrevlett.102.170503
published as Phys. Rev. Lett. 102, 170503 (2009) · 5 pages, no figures, revtex4; v3: published version
openalex publication_date 2009/05/01 · arxiv created 2009/05/12 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study the separability of permutationally symmetric quantum states. We show that for bipartite symmetric systems most of the relevant entanglement criteria coincide. However, we provide a method to generate examples of bound entangled states in symmetric systems, for the bipartite and the multipartite case. These states shed some new light on the nature of bound entanglement.