2020/06/05 by Wen Xu, Chuan-Jie Zhu, Zhu-Jun Zheng +1
Computer Science · Mathematics · Physics and Astronomy · #LOCC #Mathematical Analysis and Transform Methods #Multipartite #Multipartite entanglement #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum computer #Quantum entanglement #Upper and lower bounds #quant-ph
paper · pdf · doi:10.1007/s11128-020-02705-6
published as Quantum Information Processing, (2020) 19:200 · 14 pages
openalex publication_date 2020/06/05 · openalex created_date 2020/06/12 · arxiv created 2020/06/17 · arxiv updated 2020/08/07 · openalex updated_date 2026/08/05
We study the norms of the Bloch vectors for arbitrary n-partite quantum states. A tight upper bound of the norms is derived for n-partite systems with different individual dimensions. These upper bounds are used to deal with the separability problems. Necessary conditions are presented for \mathbf m-separable states in n-partite quantum systems. Based on the upper bounds, classification of multipartite entanglement is illustrated with detailed examples.