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

Polynomial invariants of degree 4 for even- n qubits and their applications in entanglement classification

Xiangrong Li, Dafa Li

Published Aug 8, 2013• 9 citations
arXivHTMLPDF

Abstract

We develop a simple method for constructing polynomial invariants of degree 4 for even-$n$ qubits and give explicit expressions for these polynomial invariants. We demonstrate the invariance of the polynomials under stochastic local operations and classical communication and exemplify the use of the invariance in classifying entangled states. The absolute values of these polynomial invariants are entanglement monotones, thereby allowing entanglement measures to be built. Finally, we discuss the properties of these entanglement measures.

DOI
10.1103/physreva.88.022306

Related papers

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

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

SLOCC polynomial invariants of degree 6 for evennqubits

Xiangrong Li, Dafa Li

We give a practical, necessary and sufficient condition for two pure n -qubit states to be stochastic local operations and classical communication (SLOCC) equivalent. We also construct the SLOCC polynomial invariants of degree 6 for even n -qubit ( n ⩾ 4) states. The polynomials are in the explicit form of 3 × 3 determinants whose entries are polynomials of degree 2 in the coefficients of the states. Further, the polynomials satisfy an SLOCC equation and therefore are invariant under SLOCC. The SLOCC equations can be used for the SLOCC classification of even n qubits.

Journal of Physics A Mathematical and Theoretical•Mar 13, 2013•5 citations

Stochastic local operations and classical communication equations and classification of evennqubits

Xiangrong Li, Dafa Li

For any even n qubits, we establish four stochastic local operations and classical communication (SLOCC) equations and construct four SLOCC polynomials (not complete) of degree 2 n /2 , which can be exploited for the SLOCC classification (not complete) of any even n qubits. In light of the SLOCC equations, we propose several different genuine entangled states of even n qubits and show that they are inequivalent to the | GHZ ⟩, | W ⟩, or | l , n ⟩ (the symmetric Dicke states with l excitations) under SLOCC via the vanishing or not of the polynomials. The absolute values of the polynomials can be considered as entanglement measures.

arXiv:0910.4276•Journal of Physics A Mathematical and Theoretical•Mar 21, 2011•8 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

Multipartite-entanglement monotones and polynomial invariants

Christopher Eltschka, Thierry Bastin, Andreas Osterloh +1 more

We show that a positive homogeneous function that is invariant under determinant-1 stochastic local operations and classical communication (SLOCC) transformations defines an $N$-qubit entanglement monotone if and only if the homogeneous degree is not larger than 4. We then describe a common basis and formalism for the $N$-tangle and other known invariant polynomials of degree 4. This allows us to elucidate the relation of the four-qubit invariants defined by Luque and Thibon [Phys. Rev. A 67, 042303 (2003)] and the reduced two-qubit density matrices of the states under consideration, thus giving a physical interpretation for those invariants. We demonstrate that this is a special case of a completely general law that holds for any multipartite system with bipartitions of equal dimension, e.g., for an even number of qudits.

arXiv:1105.1556•Physical Review A•Feb 3, 2012•38 citations
We develop a simple method for constructing polynomial invariants of degree 4 for even-nnn qubits and give explicit expressions for these polynomial invariants. We demonstrate the invariance of the polynomials under stochastic local operations and classical communication and exemplify the use of the invariance in classifying entangled states. The absolute values of these polynomial invariants are entanglement monotones, thereby allowing entanglement measures to be built. Finally, we discuss the properties of these entanglement measures.
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.
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 give a practical, necessary and sufficient condition for two pure n -qubit states to be stochastic local operations and classical communication (SLOCC) equivalent. We also construct the SLOCC polynomial invariants of degree 6 for even n -qubit ( n ⩾ 4) states. The polynomials are in the explicit form of 3 × 3 determinants whose entries are polynomials of degree 2 in the coefficients of the states. Further, the polynomials satisfy an SLOCC equation and therefore are invariant under SLOCC. The SLOCC equations can be used for the SLOCC classification of even n qubits.
For any even n qubits, we establish four stochastic local operations and classical communication (SLOCC) equations and construct four SLOCC polynomials (not complete) of degree 2 n /2 , which can be exploited for the SLOCC classification (not complete) of any even n qubits. In light of the SLOCC equations, we propose several different genuine entangled states of even n qubits and show that they are inequivalent to the | GHZ ⟩, | W ⟩, or | l , n ⟩ (the symmetric Dicke states with l excitations) under SLOCC via the vanishing or not of the polynomials. The absolute values of the polynomials can be considered as entanglement measures.
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 show that a positive homogeneous function that is invariant under determinant-1 stochastic local operations and classical communication (SLOCC) transformations defines an NNN-qubit entanglement monotone if and only if the homogeneous degree is not larger than 4. We then describe a common basis and formalism for the NNN-tangle and other known invariant polynomials of degree 4. This allows us to elucidate the relation of the four-qubit invariants defined by Luque and Thibon [Phys. Rev. A 67, 042303 (2003)] and the reduced two-qubit density matrices of the states under consideration, thus giving a physical interpretation for those invariants. We demonstrate that this is a special case of a completely general law that holds for any multipartite system with bipartitions of equal dimension, e.g., for an even number of qudits.