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:quant-ph/0308008 · Physical Review A

Measuring polynomial invariants of multiparty quantum states

Matthew Leifer, Noah Linden, Andreas Winter

Published May 7, 2004• 68 citations
arXivHTMLPDF

Abstract

We present networks for directly estimating the polynomial invariants of multiparty quantum states under local transformations. The structure of these networks is closely related to the structure of the invariants themselves and this lends a physical interpretation to these otherwise abstract mathematical quantities. Specifically, our networks estimate the invariants under local unitary (LU) transformations and under stochastic local operations and classical communication (SLOCC). Our networks can estimate the LU invariants for multiparty states, where each party can have a Hilbert space of arbitrary dimension and the SLOCC invariants for multiqubit states. We analyze the statistical efficiency of our networks compared to methods based on estimating the state coefficients and calculating the invariants.

DOI
10.1103/physreva.69.052304

Related papers

Characterization of multipartite entanglement

Nengkun Yu, Youming Qiao, Xiudong Sun

In this paper, we provide a characterization of multipartite entanglement in terms of equivalence classes of states under local unitary transformation (LU) by demonstrating a simple method to construct all homogenous polynomials that are invariant under local unitary group(LUIPs) for any fixed degree. We give an upper bound on the degree of the LUIP such that the ring of LUIPs can be generated by LUIPs with degree lower than the bound. Our characterization can directly generate an algorithm whose output is a generating set of LUIPs. By employing the concept of LUIPs, we prove that multipartite entanglement is additive in the sense that two multipartite states are LU equivalent if and only if $n$-copies of these two states are LU equivalent for some $n$. The method for studying LU equivalence is also used to classify the different types of multipartite mixed entanglement according to equivalence classes of states under stochastic local operations and classical communication (SLOCC), where the pure states case was previously studied by Gour and Wallach using another approach.

•Jan 12, 2014•2 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

Stochastic local operations and classical communication invariants via square matrix

Xin-Wei Zha, Irfan Ahmed, Da Zhang +2 more

Abstract In this paper, we raise a few corrections from the Li et al paper (2015 Phys. Rev . A 91 012302). We obtain some stochastic local operations and classical communication (SLOCC) invariants from second degree to sixth degree by defining square matrices. The relation of SLOCC invariants and the character polynomial of the square matrix are defined for three and four qubit states. This method comes as a useful resource in determining SLOCC invariants for n-qubit states.

Laser Physics•Jan 4, 2019•3 citations

A new degree bound for local unitary and nnn-qubit SLOCC Invariants

Jacob Turner

Deep connections between invariant theory and entanglement have been known for some time and been the object of intense study. This includes the study of local unitary equivalence of density operators as well as entanglement that can be observed in stochastic local operations assisted by classical communication (SLOCC). An important aspect of both of these areas is the computation of complete sets of invariants polynomials. For local unitary equivalence as well as $n$-qubit SLOCC invariants, complete descriptions of these invariants exist. However, these descriptions give infinite sets; of great interest is finding generating sets of invariants. In this regard, degree bounds are highly sought after to limit the possible sizes of such generating sets. In this paper we give new upper bounds on the degrees of the invariants, both for a certain complete set of local unitary invariants as well as the $n$-qubit SLOCC invariants. We show that there exists a complete set of local unitary invariants of density operators in a Hilbert space $\mathcal{H}$, of dimension $d$, which are generated by invariants of degree at most $d^4$. This in turn allows us to show that the $n$-qubit SLOCC invariants are generated by invariants of degree at most $2^{4n}$.

arXiv:1706.00634•Jun 2, 2017•0 citations

Tensor network methods for invariant theory

Jacob Biamonte, Ville Bergholm, Marco Lanzagorta

Invariant theory is concerned with functions that do not change under the action of a given group. Here we communicate an approach based on tensor networks to represent polynomial local unitary invariants of quantum states. This graphical approach provides an alternative to the polynomial equations that describe invariants, which often contain a large number of terms with coefficients raised to high powers. This approach also enables one to use known methods from tensor network theory (such as the matrix product state (MPS) factorization) when studying polynomial invariants. As our main example, we consider invariants of MPSs. We generate a family of tensor contractions resulting in a complete set of local unitary invariants that can be used to express the Rényi entropies. We find that the graphical approach to representing invariants can provide structural insight into the invariants being contracted, as well as an alternative, and sometimes much simpler, means to study polynomial invariants of quantum states. In addition, many tensor network methods, such as MPSs, contain excellent tools that can be applied in the study of invariants.

arXiv:1209.0631•Journal of Physics A Mathematical and Theoretical•Nov 11, 2013•23 citations

LU Invariants and Canonical Forms and SLOCC Classification of Pure 3-Qubit States

Di Yao-Min, Ya Cao

In this paper the entanglement of pure 3-qubit states is discussed. The local unitary (LU) polynomial invariants that are closely related to the canonical forms are constructed and the relations of the coefficients of the canonical forms are given. Then the stochastic local operations and classical communication (SLOCC) classification of the states are discussed on the basis of the canonical forms, and the symmetric canonical form of the states without 3-tangle is discussed. Finally, we give the relation between the LU polynomial invariants and SLOCC classification.

Communications in Theoretical Physics•Apr 1, 2006•3 citations
We present networks for directly estimating the polynomial invariants of multiparty quantum states under local transformations. The structure of these networks is closely related to the structure of the invariants themselves and this lends a physical interpretation to these otherwise abstract mathematical quantities. Specifically, our networks estimate the invariants under local unitary (LU) transformations and under stochastic local operations and classical communication (SLOCC). Our networks can estimate the LU invariants for multiparty states, where each party can have a Hilbert space of arbitrary dimension and the SLOCC invariants for multiqubit states. We analyze the statistical efficiency of our networks compared to methods based on estimating the state coefficients and calculating the invariants.
In this paper, we provide a characterization of multipartite entanglement in terms of equivalence classes of states under local unitary transformation (LU) by demonstrating a simple method to construct all homogenous polynomials that are invariant under local unitary group(LUIPs) for any fixed degree. We give an upper bound on the degree of the LUIP such that the ring of LUIPs can be generated by LUIPs with degree lower than the bound. Our characterization can directly generate an algorithm whose output is a generating set of LUIPs. By employing the concept of LUIPs, we prove that multipartite entanglement is additive in the sense that two multipartite states are LU equivalent if and only if nnn-copies of these two states are LU equivalent for some nnn. The method for studying LU equivalence is also used to classify the different types of multipartite mixed entanglement according to equivalence classes of states under stochastic local operations and classical communication (SLOCC), where the pure states case was previously studied by Gour and Wallach using another approach.
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.
Deep connections between invariant theory and entanglement have been known for some time and been the object of intense study. This includes the study of local unitary equivalence of density operators as well as entanglement that can be observed in stochastic local operations assisted by classical communication (SLOCC). An important aspect of both of these areas is the computation of complete sets of invariants polynomials. For local unitary equivalence as well as nnn-qubit SLOCC invariants, complete descriptions of these invariants exist. However, these descriptions give infinite sets; of great interest is finding generating sets of invariants. In this regard, degree bounds are highly sought after to limit the possible sizes of such generating sets. In this paper we give new upper bounds on the degrees of the invariants, both for a certain complete set of local unitary invariants as well as the nnn-qubit SLOCC invariants. We show that there exists a complete set of local unitary invariants of density operators in a Hilbert space H\mathcal{H}H, of dimension ddd, which are generated by invariants of degree at most d4d^4d4. This in turn allows us to show that the nnn-qubit SLOCC invariants are generated by invariants of degree at most 24n2^{4n}24n.
Invariant theory is concerned with functions that do not change under the action of a given group. Here we communicate an approach based on tensor networks to represent polynomial local unitary invariants of quantum states. This graphical approach provides an alternative to the polynomial equations that describe invariants, which often contain a large number of terms with coefficients raised to high powers. This approach also enables one to use known methods from tensor network theory (such as the matrix product state (MPS) factorization) when studying polynomial invariants. As our main example, we consider invariants of MPSs. We generate a family of tensor contractions resulting in a complete set of local unitary invariants that can be used to express the Rényi entropies. We find that the graphical approach to representing invariants can provide structural insight into the invariants being contracted, as well as an alternative, and sometimes much simpler, means to study polynomial invariants of quantum states. In addition, many tensor network methods, such as MPSs, contain excellent tools that can be applied in the study of invariants.
In this paper the entanglement of pure 3-qubit states is discussed. The local unitary (LU) polynomial invariants that are closely related to the canonical forms are constructed and the relations of the coefficients of the canonical forms are given. Then the stochastic local operations and classical communication (SLOCC) classification of the states are discussed on the basis of the canonical forms, and the symmetric canonical form of the states without 3-tangle is discussed. Finally, we give the relation between the LU polynomial invariants and SLOCC classification.