© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

Classification of the Entangled States of 2×N ×N

Shuo Cheng, Junli Li, Cong‐Feng Qiao

Published Aug 4, 2013• 11 citations

Abstract

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

Related papers

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 operation and classical communication. In this method, all inequivalent classes of true entangled state can be sorted directly without knowing the classification information of lower dimension ones for any given dimension N .

arXiv:0804.2291•Journal of Physics A Mathematical and Theoretical•Jan 12, 2010•9 citations

Classification of the Entangled States of $2\times L\times M\times N\times H$

Jia, Kang-Kang, Junli Li, Cong‐Feng Qiao

In this work we propose a practical entanglement classification scheme for pure states of $2\times L\times M\times N\times H$, under the stochastic local operation and classical communication (SLOCC), which generalizes the method explored in the entanglement classification of $2\times L\times M\times N$ to the five-partite system. The entangled states of $2\times L\times M\times N\times H$ system are first classified into different coarse-grained standard forms using matrix decompositions, and then fine-grained identification of two inequivalent entangled states with the same standard form are completed by using the matrix realignment technique. As an practical example, entanglement classes of the five-qubit system of $2\times 2\times 2\times 2\times 2$ are presented.

arXiv:1505.02007•May 8, 2015•0 citations

Classification of the Entangled States of $2 \times L \times M \times N$

Liang-Liang Sun, Junli Li, Cong‐Feng Qiao

We present a practical entanglement classification scheme for pure state in form of $2\times L\times M\times N$ under the stochastic local operation and classical communication (SLOCC), where every inequivalent class of the entangled quantum states may be sorted out according to its standard form and the corresponding transformation matrix. This provides a practical method for determining the interconverting matrix between two SLOCC equivalent entangled states, and classification examples for some $2\times 4\times M\times N$ systems are also presented.

arXiv:1401.6609•Jan 26, 2014•0 citations

Entanglement classification from a topological perspective

Dmitry Melnikov

Classification of entanglement is an important problem in quantum resource theory. In this paper we discuss an embedding of this problem in the context of topological quantum field theories (TQFTs). This approach allows classifying entanglement patterns in terms of topological equivalence classes. In the bipartite case a classification equivalent to the one by stochastic local operations and classical communication (SLOCC) is constructed by restricting to a simple class of connectivity diagrams. Such diagrams characterize quantum states of TQFT up to braiding and tangling of the ``connectome.'' In the multipartite case the same restricted topological classification only captures a part of the SLOCC classes, in particular, it does not see the $W$ entanglement of three qubits. Nonlocal braiding of connections may solve the problem, but no finite classification is attempted in this case. Despite incompleteness, the connectome classification has a straightforward generalization to any number and dimension of parties and has a very intuitive interpretation, which might be useful for understanding specific properties of entanglement and for design of new quantum resources.

arXiv:2208.13901•Physical review. D/Physical review. D.•Jun 12, 2023•9 citations

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

Classifying entanglement by algebraic geometry

Masoud Gharahi

Quantum Entanglement is one of the key manifestations of quantum mechanics that separate the quantum realm from the classical one. Characterization of entanglement as a physical resource for quantum technology became of uppermost importance. While the entanglement of bipartite systems is already well understood, the ultimate goal to cope with the properties of entanglement of multipartite systems is still far from being realized. This paper covers characterization of multipartite entanglement using algebraic-geometric tools. First, we establish an algorithm to classify multipartite entanglement by [Formula: see text]-secant varieties of the Segre variety and [Formula: see text]-multilinear ranks that are invariant under Stochastic Local Operations with Classical Communication (SLOCC). We present a fine-structure classification of multiqubit and tripartite entanglement based on this algorithm. Another fundamental problem in quantum information theory is entanglement transformation that is quite challenging regarding to multipartite systems. It is captivating that the proposed entanglement classification by algebraic geometry can be considered as a reference to study SLOCC and asymptotic SLOCC interconversions among different resources based on tensor rank and border rank, respectively. In this regard, we also introduce a new class of tensors that we call persistent tensors and construct a lower bound for their tensor rank. We further cover SLOCC convertibility of multipartite systems considering several families of persistent tensors.

arXiv:2408.12265•International Journal of Quantum Information•Dec 3, 2023•2 citations

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

Classification of the Entangled States of

2\times L\times M\times N\times H

In this work we propose a practical entanglement classification scheme for pure states of

2\times L\times M\times N\times H

, under the stochastic local operation and classical communication (SLOCC), which generalizes the method explored in the entanglement classification of

2\times L\times M\times N

to the five-partite system. The entangled states of

2\times L\times M\times N\times H

system are first classified into different coarse-grained standard forms using matrix decompositions, and then fine-grained identification of two inequivalent entangled states with the same standard form are completed by using the matrix realignment technique. As an practical example, entanglement classes of the five-qubit system of

2\times 2\times 2\times 2\times 2

are presented.

Classification of the Entangled States of

2 \times L \times M \times N

We present a practical entanglement classification scheme for pure state in form of

2\times L\times M\times N

under the stochastic local operation and classical communication (SLOCC), where every inequivalent class of the entangled quantum states may be sorted out according to its standard form and the corresponding transformation matrix. This provides a practical method for determining the interconverting matrix between two SLOCC equivalent entangled states, and classification examples for some

2\times 4\times M\times N

systems are also presented.

Classification of entanglement is an important problem in quantum resource theory. In this paper we discuss an embedding of this problem in the context of topological quantum field theories (TQFTs). This approach allows classifying entanglement patterns in terms of topological equivalence classes. In the bipartite case a classification equivalent to the one by stochastic local operations and classical communication (SLOCC) is constructed by restricting to a simple class of connectivity diagrams. Such diagrams characterize quantum states of TQFT up to braiding and tangling of the ``connectome.'' In the multipartite case the same restricted topological classification only captures a part of the SLOCC classes, in particular, it does not see the

W

entanglement of three qubits. Nonlocal braiding of connections may solve the problem, but no finite classification is attempted in this case. Despite incompleteness, the connectome classification has a straightforward generalization to any number and dimension of parties and has a very intuitive interpretation, which might be useful for understanding specific properties of entanglement and for design of new quantum resources.

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.

Quantum Entanglement is one of the key manifestations of quantum mechanics that separate the quantum realm from the classical one. Characterization of entanglement as a physical resource for quantum technology became of uppermost importance. While the entanglement of bipartite systems is already well understood, the ultimate goal to cope with the properties of entanglement of multipartite systems is still far from being realized. This paper covers characterization of multipartite entanglement using algebraic-geometric tools. First, we establish an algorithm to classify multipartite entanglement by [Formula: see text]-secant varieties of the Segre variety and [Formula: see text]-multilinear ranks that are invariant under Stochastic Local Operations with Classical Communication (SLOCC). We present a fine-structure classification of multiqubit and tripartite entanglement based on this algorithm. Another fundamental problem in quantum information theory is entanglement transformation that is quite challenging regarding to multipartite systems. It is captivating that the proposed entanglement classification by algebraic geometry can be considered as a reference to study SLOCC and asymptotic SLOCC interconversions among different resources based on tensor rank and border rank, respectively. In this regard, we also introduce a new class of tensors that we call persistent tensors and construct a lower bound for their tensor rank. We further cover SLOCC convertibility of multipartite systems considering several families of persistent tensors.