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:0804.1661 · Journal of Mathematical Physics

On polynomial invariants of several qubits

D. Ž. Ðoković, A. Osterloh

Published Mar 1, 2009• 92 citations
arXivHTMLPDF

Abstract

It is a recent observation that entanglement classification for qubits is closely related to local SL(2,C)-invariants including the invariance under qubit permutations [Dür, et al., Phys. Rev. A 62, 062314 (2000); Osterloh, A. and Siewert, J., Phys. Rev. A 72, 012337 (2005); O. Chterental and D. Ž. Ðoković, Linear Algebra Research Advances (Nova Science, Hauppauge, N.Y., 2007), Chap. 4, p. 133], which has been termed SL∗ invariance. In order to single out the SL∗ invariants, we analyze the SL(2,C)-invariants of four (five) qubits and decompose them into irreducible modules for the symmetric group S4 (S5) of qubit permutations. A classifying set of measures of genuine multipartite entanglement is given by the ideal of the algebra of SL∗-invariants vanishing on arbitrary product states. We find that low degree homogeneous components of this ideal can be constructed in full by using the approach introduced by Osterloh and Siewert [Phys. Rev. A 72, 012337 (2005); Int. J. Quant. Inf. 4, 531 (2006)]. Our analysis highlights an intimate connection between this latter procedure and the standard methods to create invariants, such as the Ω-process [Luque, J.-G. and Thibon, J.-Y., J. Phys. A 39, 371 (2005)]. As the degrees of invariants increase, the alternative method proves to be particularly efficient.

DOI
10.1063/1.3075830

Related papers

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•66 citations

Classification of Four-Qubit States by Means of a Stochastic Local Operation and the Classical Communication Invariant

Xin-Wei Zha, Ma Gang-Long

It is a recent observation that entanglement classification for qubits is closely related to stochastic local operations and classical communication (SLOCC) invariants. Verstraete et al.[ Phys. Rev. A 65 (2002) 052112 ] showed that for pure states of four qubits there are nine different degenerate SLOCC entanglement classes. Li et al.[ Phys. Rev. A 76 (2007) 052311 ] showed that there are at feast 28 distinct true SLOCC entanglement classes for four qubits by means of the SLOCC invariant and semi-invariant. We give 16 different entanglement classes for four qubits by means of basic SLOCC invariants.

Chinese Physics Letters•Feb 1, 2011•7 citations

INVARIANT POLYNOMIALS WITH APPLICATIONS TO QUANTUM COMPUTING

Alimzhan Amanov

In quantum information theory, understanding the complexity of entangled states within the context of SLOCC (stochastic local operations and classical communications) involving d qubits (or qudits) is essential for advancing our knowledge of quantum systems. This complexity is often analyzed by classifying the states via local symmetry groups. The resulting classes can be distinguished using invariant polynomials, which serve as a measure of entanglement. This paper introduces a novel method for obtaining invariant polynomials of the smallest degrees, which significantly enhances the efficiency of characterizing SLOCC classes of entangled quantum states. Our method not only simplifies the process of identifying these classes but also provides a robust tool for analyzing the entanglement properties of complex quantum systems. As a practical application, we demonstrate the derivation of minimal degree invariants in specific cases, illustrating the effectiveness of our approach in real-world scenarios. This advancement has the potential to streamline various processes in quantum information theory, making it easier to understand, classify, and utilize entangled states effectively.

Herald of Kazakh-British technical university•Jul 1, 2024•1 citation

Polynomial invariants of four qubits

Jean-Gabriel Luque, Jean‐Yves Thibon

We describe explicitly the algebra of polynomial functions on the Hilbert space of four-qubit states that are invariant under the group $\mathrm{SL}(2,C{)}^{4}$ of stochastic local quantum operations assisted by classical communication. From this description, we obtain a closed formula for the hyperdeterminant in terms of low degree invariants.

arXiv:quant-ph/0212069•Physical Review A•Apr 2, 2003•189 citations

COMPUTING THE DEGREE-4 INVARIANT POLYNOMIAL BASIS FOR 7 QUBITS

Alimzhan Amanov

Understanding the complexity of entangled states within the context of SLOCC (stochastic local operations and classical communications) involving several number qubits is essential for advancing our knowledge of quantum systems. This complexity is often analyzed by classifying the states via local symmetry groups. Practically, tthe resulting classes can be distinguished using invariant polynomials, but the size of these polynomials grows rapidly. Hence, it is crucial to obtain the smallest possible invariants. In this short note, we compute the basis of invariant polynomials of 7 qubits of degree 4, which are the smallest degree invariants. We obtain these polynomials using the representation theory and algebraic combinatorics.

Herald of Kazakh-British technical university•Oct 1, 2024•0 citations

Entanglement classification and invariant-based entanglement measures

Xiangrong Li, Dafa Li

We propose a method of classifying $n$-qubit states into stochastic local operations and classical communication inequivalent families in terms of the rank of the square matrix $C{(i{\ensuremath{\sigma}}_{y})}^{\ensuremath{\bigotimes}k}{C}^{T}$, where $C$ is the rectangular coefficient matrix of the state and ${\ensuremath{\sigma}}_{y}$ is the Pauli operator. The rank of the square matrix $C{(i{\ensuremath{\sigma}}_{y})}^{\ensuremath{\bigotimes}k}{C}^{T}$ is capable of distinguishing between $n$-qubit Greenberger-Horne-Zeilinger and $W$ states. The determinant of the matrix gives rise to a family of polynomial invariants for $n$ qubits which include as special cases well-known polynomial invariants in the literature. In addition, explicit expressions can be given for these polynomial invariants and this allows us to investigate the properties of entanglement measures built upon the absolute values of polynomial invariants for product states.

Physical Review A•Jan 7, 2015•6 citations
It is a recent observation that entanglement classification for qubits is closely related to local SL(2,C)-invariants including the invariance under qubit permutations [Dür, et al., Phys. Rev. A 62, 062314 (2000); Osterloh, A. and Siewert, J., Phys. Rev. A 72, 012337 (2005); O. Chterental and D. Ž. Ðoković, Linear Algebra Research Advances (Nova Science, Hauppauge, N.Y., 2007), Chap. 4, p. 133], which has been termed SL∗ invariance. In order to single out the SL∗ invariants, we analyze the SL(2,C)-invariants of four (five) qubits and decompose them into irreducible modules for the symmetric group S4 (S5) of qubit permutations. A classifying set of measures of genuine multipartite entanglement is given by the ideal of the algebra of SL∗-invariants vanishing on arbitrary product states. We find that low degree homogeneous components of this ideal can be constructed in full by using the approach introduced by Osterloh and Siewert [Phys. Rev. A 72, 012337 (2005); Int. J. Quant. Inf. 4, 531 (2006)]. Our analysis highlights an intimate connection between this latter procedure and the standard methods to create invariants, such as the Ω-process [Luque, J.-G. and Thibon, J.-Y., J. Phys. A 39, 371 (2005)]. As the degrees of invariants increase, the alternative method proves to be particularly efficient.
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.
It is a recent observation that entanglement classification for qubits is closely related to stochastic local operations and classical communication (SLOCC) invariants. Verstraete et al.[ Phys. Rev. A 65 (2002) 052112 ] showed that for pure states of four qubits there are nine different degenerate SLOCC entanglement classes. Li et al.[ Phys. Rev. A 76 (2007) 052311 ] showed that there are at feast 28 distinct true SLOCC entanglement classes for four qubits by means of the SLOCC invariant and semi-invariant. We give 16 different entanglement classes for four qubits by means of basic SLOCC invariants.
In quantum information theory, understanding the complexity of entangled states within the context of SLOCC (stochastic local operations and classical communications) involving d qubits (or qudits) is essential for advancing our knowledge of quantum systems. This complexity is often analyzed by classifying the states via local symmetry groups. The resulting classes can be distinguished using invariant polynomials, which serve as a measure of entanglement. This paper introduces a novel method for obtaining invariant polynomials of the smallest degrees, which significantly enhances the efficiency of characterizing SLOCC classes of entangled quantum states. Our method not only simplifies the process of identifying these classes but also provides a robust tool for analyzing the entanglement properties of complex quantum systems. As a practical application, we demonstrate the derivation of minimal degree invariants in specific cases, illustrating the effectiveness of our approach in real-world scenarios. This advancement has the potential to streamline various processes in quantum information theory, making it easier to understand, classify, and utilize entangled states effectively.
We describe explicitly the algebra of polynomial functions on the Hilbert space of four-qubit states that are invariant under the group SL(2,C)4\mathrm{SL}(2,C{)}^{4}SL(2,C)4 of stochastic local quantum operations assisted by classical communication. From this description, we obtain a closed formula for the hyperdeterminant in terms of low degree invariants.
Understanding the complexity of entangled states within the context of SLOCC (stochastic local operations and classical communications) involving several number qubits is essential for advancing our knowledge of quantum systems. This complexity is often analyzed by classifying the states via local symmetry groups. Practically, tthe resulting classes can be distinguished using invariant polynomials, but the size of these polynomials grows rapidly. Hence, it is crucial to obtain the smallest possible invariants. In this short note, we compute the basis of invariant polynomials of 7 qubits of degree 4, which are the smallest degree invariants. We obtain these polynomials using the representation theory and algebraic combinatorics.
We propose a method of classifying nnn-qubit states into stochastic local operations and classical communication inequivalent families in terms of the rank of the square matrix $C{(i{\ensuremath{\sigma}}_{y})}^{\ensuremath{\bigotimes}k}{C}^{T}$, where CCC is the rectangular coefficient matrix of the state and ${\ensuremath{\sigma}}_{y}$ is the Pauli operator. The rank of the square matrix $C{(i{\ensuremath{\sigma}}_{y})}^{\ensuremath{\bigotimes}k}{C}^{T}$ is capable of distinguishing between nnn-qubit Greenberger-Horne-Zeilinger and WWW states. The determinant of the matrix gives rise to a family of polynomial invariants for nnn qubits which include as special cases well-known polynomial invariants in the literature. In addition, explicit expressions can be given for these polynomial invariants and this allows us to investigate the properties of entanglement measures built upon the absolute values of polynomial invariants for product states.