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:1108.5636 · Physical Review A

Classification of the entangled states L×N×N

Junli Li, Shi-Yuan Li, Cong‐Feng Qiao

Published Jan 3, 2012• 9 citations
arXivHTMLPDF

Abstract

We presented a general classification scheme for the tripartite $L\ifmmode\times\else\texttimes\fi{}N\ifmmode\times\else\texttimes\fi{}N$ entangled system under stochastic local operation and classical communication. The whole classification procedure consists of two correlated parts: the simultaneous similarity transformation of a commuting matrix pair into a canonical form and the study of internal symmetry of parameters in the canonical form. Based on this scheme, a concrete example of entanglement classification for a $3\ifmmode\times\else\texttimes\fi{}N\ifmmode\times\else\texttimes\fi{}N$ system is given.

DOI
10.1103/physreva.85.012301

Related papers

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

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 $2 \times M \times N$

Junli Li, Cong‐Feng Qiao

We extend the matrix decomposition method(MDM) in classifying the $2\times N\times N$ truly entangled states to $2\times M\times N$ system under the condition of stochastic local operations and classical communication. It is found that the MDM is quite practical and convenient in operation for the asymmetrical tripartite states, and an explicit example of the classification of $2\times 6\times 7$ quantum system is presented.

arXiv:1001.0078•Dec 31, 2009•0 citations

Entanglement classification of four-partite states under the SLOCC

S. M. Zangi, Junli Li, Cong‐Feng Qiao

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.

arXiv:1701.04155•Journal of Physics A Mathematical and Theoretical•Jun 19, 2017•19 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 tripartite entanglement with one qubit

Marcio F. Cornelio, A. F. R. de Toledo Piza

We present a method to find the decompositions of tripartite entangled pure states with one qubit which are smaller than two successive Schmidt decompositions. We use this method to get a classification of the entangled states according to their decompositions. Furthermore, we also use this method to classify the entangled states that can be interconverted through stochastic local operations and classical communication. More general tripartite systems are briefly discussed.

arXiv:quant-ph/0507041•Physical Review A•Mar 15, 2006•21 citations
We presented a general classification scheme for the tripartite L\ifmmode×\else\texttimes\fiN\ifmmode×\else\texttimes\fiNL\ifmmode\times\else\texttimes\fi{}N\ifmmode\times\else\texttimes\fi{}NL\ifmmode×\else\texttimes\fiN\ifmmode×\else\texttimes\fiN entangled system under stochastic local operation and classical communication. The whole classification procedure consists of two correlated parts: the simultaneous similarity transformation of a commuting matrix pair into a canonical form and the study of internal symmetry of parameters in the canonical form. Based on this scheme, a concrete example of entanglement classification for a 3\ifmmode×\else\texttimes\fiN\ifmmode×\else\texttimes\fiN3\ifmmode\times\else\texttimes\fi{}N\ifmmode\times\else\texttimes\fi{}N3\ifmmode×\else\texttimes\fiN\ifmmode×\else\texttimes\fiN system is given.
Classification of the Entangled States of 2×L×M×N2 \times L \times M \times N2×L×M×N
We present a practical entanglement classification scheme for pure state in form of 2×L×M×N2\times L\times M\times N2×L×M×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×4×M×N2\times 4\times M\times N2×4×M×N systems are also presented.
Classification of the Entangled States of 2×L×M×N×H2\times L\times M\times N\times H2×L×M×N×H
In this work we propose a practical entanglement classification scheme for pure states of 2×L×M×N×H2\times L\times M\times N\times H2×L×M×N×H, under the stochastic local operation and classical communication (SLOCC), which generalizes the method explored in the entanglement classification of 2×L×M×N2\times L\times M\times N2×L×M×N to the five-partite system. The entangled states of 2×L×M×N×H2\times L\times M\times N\times H2×L×M×N×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×2×2×2×22\times 2\times 2\times 2\times 22×2×2×2×2 are presented.
Classification of the Entangled States 2×M×N2 \times M \times N2×M×N
We extend the matrix decomposition method(MDM) in classifying the 2×N×N2\times N\times N2×N×N truly entangled states to 2×M×N2\times M\times N2×M×N system under the condition of stochastic local operations and classical communication. It is found that the MDM is quite practical and convenient in operation for the asymmetrical tripartite states, and an explicit example of the classification of 2×6×72\times 6\times 72×6×7 quantum system is presented.
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.
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.