Entanglement classification of four-partite states under the SLOCC

2017/01/31 by S. M. Zangi, Junli Li, Jun-Li Li +2
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Bipartite graph #Character (mathematics) #Computer science #Discrete mathematics #LOCC #Mathematical analysis #Mathematics #Multipartite entanglement #Neural Networks and Reservoir Computing #Physics #Pure mathematics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum entanglement #Quantum mechanics #Reduction (mathematics) #Scheme (mathematics) #Set (abstract data type) #Squashed entanglement #State (computer science) #quant-ph

paper · pdf · doi:10.1088/1751-8121/aa7a2d

published as J. Phys. A: Math. Theor. 50, 325301 (2017) · 17 pages, 1 figure; published in J. Phys. A: Math. Theor

openalex publication_date 2017/06/19 · arxiv created 2017/07/17 · arxiv updated 2017/08/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

Abstract

Abstract We present a practical classification scheme for the four-partite entangled states under stochastic local operations and classical communication (SLOCC). By transforming a four-partite state into a triple-state set composed of two tripartite states and a bipartite state, the entanglement classification is reduced to the classification of tripartite and bipartite entanglements. This reduction method has the merit of involving only the linear constrains, and meanwhile provides an insight into the entanglement character of the subsystems.

Citations

• Classification of Multipartite Entanglement of All Finite Dimensionality
• Three qubits can be entangled in two inequivalent ways
• Classification of Generaln-Qubit States under Stochastic Local Operations and Classical Communication in Terms of the Rank of Coefficient Matrix
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Quantum cryptography based on Bell’s theorem
• The ubiquitous Kronecker product