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

Entanglement Classification of Four-partite States

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

Published Jan 16, 2017• 0 citations
OpenAlex

Related papers

A genuine four-partite entangled state

Ming-Yong Ye, Xiu‐Min Lin

arXiv:0801.0908•Physics Letters A•Mar 31, 2008•10 citations

Multi-partite Quantum Entanglement

이혁재

•Jan 1, 2006•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

Polynomial invariants for discrimination and classification of four-qubit entanglement

Oliver Viehmann, Christopher Eltschka, Jens Siewert

The number of entanglement classes in stochastic local operations and classical communication (SLOCC) classifications increases with the number of qubits and is already infinite for four qubits. Criteria for explicitly discriminating and classifying pure states of four and more qubits are highly desirable and therefore at the focus of intense theoretical research. We develop a general criterion for the discrimination of pure $N\text{\ensuremath{-}}$partite entangled states in terms of polynomial $\mathrm{SL}(d,\mathrm{C}){}^{\ensuremath{\bigotimes}N}$ invariants. By means of this criterion, existing SLOCC classifications of four-qubit entanglement are reproduced. Based on this we propose a polynomial classification scheme in which entanglement types are identified through ``tangle patterns.'' This scheme provides a practicable way to classify states of arbitrary multipartite systems. Moreover, the use of polynomials induces a corresponding quantification of the different types of entanglement.

arXiv:1101.5558•Physical Review A•May 31, 2011•65 citations

GENERALIZED ENTANGLEMENT AND ITS CLASSIFICATION

Takahiro Matsuoka

Stochastic Analysis: Classical and Quantum•Oct 1, 2005•0 citations

The norms of Bloch vectors and classification of four-qudits quantum states

Ming Li, Zong Wang, Jing Wang +2 more

We investigate the norms of the Bloch vectors for any quantum state with subsystems less than or equal to four. Tight upper bounds of the norms are obtained, which can be used to derive tight upper bounds for entanglement measures defined by the norms of Bloch vectors. By using these bounds a trade-off relation of the norms of Bloch vectors is discussed. These upper bounds are then applied on separability. Necessary conditions are presented for different kinds of separable states in four-partite quantum systems. We further present a complete classification of quantum states for four-qudits quantum systems.

arXiv:1903.04336•Europhysics Letters (EPL)•Feb 18, 2019•16 citations
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.
The number of entanglement classes in stochastic local operations and classical communication (SLOCC) classifications increases with the number of qubits and is already infinite for four qubits. Criteria for explicitly discriminating and classifying pure states of four and more qubits are highly desirable and therefore at the focus of intense theoretical research. We develop a general criterion for the discrimination of pure $N\text{\ensuremath{-}}$partite entangled states in terms of polynomial $\mathrm{SL}(d,\mathrm{C}){}^{\ensuremath{\bigotimes}N}$ invariants. By means of this criterion, existing SLOCC classifications of four-qubit entanglement are reproduced. Based on this we propose a polynomial classification scheme in which entanglement types are identified through ``tangle patterns.'' This scheme provides a practicable way to classify states of arbitrary multipartite systems. Moreover, the use of polynomials induces a corresponding quantification of the different types of entanglement.
We investigate the norms of the Bloch vectors for any quantum state with subsystems less than or equal to four. Tight upper bounds of the norms are obtained, which can be used to derive tight upper bounds for entanglement measures defined by the norms of Bloch vectors. By using these bounds a trade-off relation of the norms of Bloch vectors is discussed. These upper bounds are then applied on separability. Necessary conditions are presented for different kinds of separable states in four-partite quantum systems. We further present a complete classification of quantum states for four-qudits quantum systems.