Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1306.3539 · Physical Review A

Entanglement classification of 2×2×2×d quantum systems via the ranks of the multiple coefficient matrices

Shuhao Wang, Yao Lu, Gui‐Lu Long

Published Jun 5, 2013• 17 citations
arXivHTMLPDF

Abstract

The coefficient matrix is an efficient tool in entanglement classification under stochastic local operation and classical communication. In this work, we take all the ranks of the coefficient matrices into account in the method of entanglement classification, and give the entanglement classification procedure for arbitrary-dimensional multipartite pure states under stochastic local operation and classical communication. As a main application, we study the entanglement classification for quantum systems in the Hilbert space $\mathcal{H}={\mathbb{C}}^{2}\ensuremath{\bigotimes}{\mathbb{C}}^{2}\ensuremath{\bigotimes}{\mathbb{C}}^{2}\ensuremath{\bigotimes}{\mathbb{C}}^{d}$ in terms of the ranks of the coefficient matrices.

DOI
10.1103/physreva.87.062305

Related papers

Entanglement Classification of Arbitrary-Dimensional Multipartite Pure States under Stochastic Local Operations and Classical Communication via the Ranks of the Coefficient Matrices

Wang Shuhao, Yao Lu, Jianlian Cui +2 more

The coefficient matrix is an efficient tool in entanglement classification under stochastic local operation and classical communication (SLOCC). In this work, we take all the ranks of the coefficient matrices into account in the method of entanglement classification, and give the entanglement classification procedure for arbitrary-dimensional multipartite pure states under SLOCC. As a main application, we study the entanglement classification for quantum systems in the Hilbert space H = C2 ⊗ C2 ⊗ C2 ⊗ Cd in terms of the ranks of the coefficient matrices.

Asia Pacific Physics Conference (APPC)•Mar 19, 2014•0 citations

Classification of arbitrary-dimensional multipartite pure states under stochastic local operations and classical communication using the rank of coefficient matrix

Shuhao Wang, Yao Lu, Ming Yuan Gao +2 more

We study multipartite entanglement under stochastic local operations and classical communication (SLOCC) and propose the entanglement classification under SLOCC for arbitrary-dimensional multipartite ($n$-qudit) pure states via the rank of coefficient matrix, together with the permutation of qudits. The ranks of the coefficient matrices have been proved to be entanglement monotones. The entanglement classification of the $2 \otimes 2 \otimes 2 \otimes 4$ system is discussed in terms of the generalized method, and 22 different SLOCC families are found.

arXiv:1209.0063•Journal of Physics A Mathematical and Theoretical•Feb 21, 2013•13 citations

Classification of General n -Qubit States under Stochastic Local Operations and Classical Communication in Terms of the Rank of Coefficient Matrix

Xiangrong Li, Dafa Li

We solve the entanglement classification under stochastic local operations and classical communication (SLOCC) for general n-qubit states. For two arbitrary pure n-qubit states connected via local operations, we establish an equation between the two coefficient matrices associated with the states. The rank of the coefficient matrix is preserved under SLOCC and gives rise to a simple way of partitioning all the pure states of n qubits into different families of entanglement classes, as exemplified here. When applied to the symmetric states, this approach reveals that all the Dicke states |ℓ,n> with ℓ=1,…,[n/2] are inequivalent under SLOCC.

arXiv:1106.6105•Physical Review Letters•May 3, 2012•54 citations

Method for classifying multiqubit states via the rank of the coefficient matrix and its application to four-qubit states

Xiangrong Li, Dafa Li

We construct coefficient matrices of size ${2}^{\ensuremath{\ell}}$ by ${2}^{n\ensuremath{-}\ensuremath{\ell}}$ associated with pure $n$-qubit states and prove the invariance of the ranks of the coefficient matrices under stochastic local operations and classical communication (SLOCC). The ranks give rise to a simple way of partitioning pure $n$-qubit states into inequivalent families and distinguishing degenerate families from one another under SLOCC. Moreover, the classification scheme via the ranks of coefficient matrices can be combined with other schemes to build a more refined classification scheme. To exemplify we classify the nine families of four qubits introduced by Verstraete et al. [Phys. Rev. A 65, 052112 (2002)] further into inequivalent subfamilies via the ranks of coefficient matrices, and as a result, we find 28 genuinely entangled families and all the degenerate classes can be distinguished up to permutations of the four qubits. We also discuss the completeness of the classification of four qubits into nine families.

arXiv:1201.2229•Physical Review A•Oct 23, 2012•25 citations

Inductive classification of multipartite entanglement under stochastic local operations and classical communication

Lucas Lamata, Juan León, David Cienfuegos Salgado +1 more

We propose an inductive procedure to classify $N$-partite entanglement under stochastic local operations and classical communication provided such a classification is known for $N\ensuremath{-}1$ qubits. The method is based upon the analysis of the coefficient matrix of the state in an arbitrary product basis. We illustrate this approach in detail with the well-known bipartite and tripartite systems, obtaining as a by-product a systematic criterion to establish the entanglement class of a given pure state without resourcing to any entanglement measure. The general case is proved by induction, allowing us to find an upper bound for the number of $N$-partite entanglement classes in terms of the number of entanglement classes for $N\ensuremath{-}1$ qubits.

arXiv:quant-ph/0603243•Physical Review A•Nov 28, 2006•77 citations

Classification of the Entangled States of 2×N ×N

Shuo Cheng, Junli Li, Cong‐Feng Qiao

We develop a novel method in classifying the multipartite entanglement state of 2×N ×N under stochastic local operations and classical communication (SLOCC). In this method, all inequivalent classes of a genuine entangled state can be assorted directly without knowing the classification information of lower dimension ones for any given dimension N. It also gives a nature explanation for the non-local parameters remaining in the entanglement classes when N ≥ 4. Entanglement is at the heart of the quantum information theory (QIT) and is now thought as a physical resource to realize quantum information tasks, such as quantum cryptography [1, 2], superdense coding [3, 4], and quantum computation [5]. The study of entanglement improves our further understanding of quantum non-locality [6] and also is of particular interest in QIT. One such case is the classification of multipartite entanglement. Two quantum states can be employed to implement the same tasks in QIT and are thought to be equivalent while they are mutually convertible by Stochastic Local Operations and Classical Communication (SLOCC) [7]. Nevertheless, in practice the classification of multipartite entanglement and in high dimensions in the Hilbert space seems to be a formidable task [8]. Matrix decomposition keeps to be a useful tool as in the two-partite case [9, 10]. A widely adopted philosophy in dealing with this issue is first to know the classification of the state in lower dimension (or less partite) and then extend to the higher dimension case [11, 12] (or more partite [13, 14]) in an inductive way. However, nontrivial aspect emerges as the dimension increases, i.e. some non-local parameters may nest in the entangled states [15, 16]. In literature, in

•Aug 4, 2013•11 citations
The coefficient matrix is an efficient tool in entanglement classification under stochastic local operation and classical communication. In this work, we take all the ranks of the coefficient matrices into account in the method of entanglement classification, and give the entanglement classification procedure for arbitrary-dimensional multipartite pure states under stochastic local operation and classical communication. As a main application, we study the entanglement classification for quantum systems in the Hilbert space H=C2\ensuremath⨂C2\ensuremath⨂C2\ensuremath⨂Cd\mathcal{H}={\mathbb{C}}^{2}\ensuremath{\bigotimes}{\mathbb{C}}^{2}\ensuremath{\bigotimes}{\mathbb{C}}^{2}\ensuremath{\bigotimes}{\mathbb{C}}^{d}H=C2\ensuremath⨂C2\ensuremath⨂C2\ensuremath⨂Cd in terms of the ranks of the coefficient matrices.
The coefficient matrix is an efficient tool in entanglement classification under stochastic local operation and classical communication (SLOCC). In this work, we take all the ranks of the coefficient matrices into account in the method of entanglement classification, and give the entanglement classification procedure for arbitrary-dimensional multipartite pure states under SLOCC. As a main application, we study the entanglement classification for quantum systems in the Hilbert space H = C2 ⊗ C2 ⊗ C2 ⊗ Cd in terms of the ranks of the coefficient matrices.
We study multipartite entanglement under stochastic local operations and classical communication (SLOCC) and propose the entanglement classification under SLOCC for arbitrary-dimensional multipartite (nnn-qudit) pure states via the rank of coefficient matrix, together with the permutation of qudits. The ranks of the coefficient matrices have been proved to be entanglement monotones. The entanglement classification of the 2⊗2⊗2⊗42 \otimes 2 \otimes 2 \otimes 42⊗2⊗2⊗4 system is discussed in terms of the generalized method, and 22 different SLOCC families are found.
We solve the entanglement classification under stochastic local operations and classical communication (SLOCC) for general n-qubit states. For two arbitrary pure n-qubit states connected via local operations, we establish an equation between the two coefficient matrices associated with the states. The rank of the coefficient matrix is preserved under SLOCC and gives rise to a simple way of partitioning all the pure states of n qubits into different families of entanglement classes, as exemplified here. When applied to the symmetric states, this approach reveals that all the Dicke states |ℓ,n> with ℓ=1,…,[n/2] are inequivalent under SLOCC.
We construct coefficient matrices of size ${2}^{\ensuremath{\ell}}$ by ${2}^{n\ensuremath{-}\ensuremath{\ell}}$ associated with pure nnn-qubit states and prove the invariance of the ranks of the coefficient matrices under stochastic local operations and classical communication (SLOCC). The ranks give rise to a simple way of partitioning pure nnn-qubit states into inequivalent families and distinguishing degenerate families from one another under SLOCC. Moreover, the classification scheme via the ranks of coefficient matrices can be combined with other schemes to build a more refined classification scheme. To exemplify we classify the nine families of four qubits introduced by Verstraete et al. [Phys. Rev. A 65, 052112 (2002)] further into inequivalent subfamilies via the ranks of coefficient matrices, and as a result, we find 28 genuinely entangled families and all the degenerate classes can be distinguished up to permutations of the four qubits. We also discuss the completeness of the classification of four qubits into nine families.
We propose an inductive procedure to classify NNN-partite entanglement under stochastic local operations and classical communication provided such a classification is known for $N\ensuremath{-}1$ qubits. The method is based upon the analysis of the coefficient matrix of the state in an arbitrary product basis. We illustrate this approach in detail with the well-known bipartite and tripartite systems, obtaining as a by-product a systematic criterion to establish the entanglement class of a given pure state without resourcing to any entanglement measure. The general case is proved by induction, allowing us to find an upper bound for the number of NNN-partite entanglement classes in terms of the number of entanglement classes for $N\ensuremath{-}1$ qubits.
We develop a novel method in classifying the multipartite entanglement state of 2×N ×N under stochastic local operations and classical communication (SLOCC). In this method, all inequivalent classes of a genuine entangled state can be assorted directly without knowing the classification information of lower dimension ones for any given dimension N. It also gives a nature explanation for the non-local parameters remaining in the entanglement classes when N ≥ 4. Entanglement is at the heart of the quantum information theory (QIT) and is now thought as a physical resource to realize quantum information tasks, such as quantum cryptography [1, 2], superdense coding [3, 4], and quantum computation [5]. The study of entanglement improves our further understanding of quantum non-locality [6] and also is of particular interest in QIT. One such case is the classification of multipartite entanglement. Two quantum states can be employed to implement the same tasks in QIT and are thought to be equivalent while they are mutually convertible by Stochastic Local Operations and Classical Communication (SLOCC) [7]. Nevertheless, in practice the classification of multipartite entanglement and in high dimensions in the Hilbert space seems to be a formidable task [8]. Matrix decomposition keeps to be a useful tool as in the two-partite case [9, 10]. A widely adopted philosophy in dealing with this issue is first to know the classification of the state in lower dimension (or less partite) and then extend to the higher dimension case [11, 12] (or more partite [13, 14]) in an inductive way. However, nontrivial aspect emerges as the dimension increases, i.e. some non-local parameters may nest in the entangled states [15, 16]. In literature, in