© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

arXiv:2408.12265 · International Journal of Quantum Information

Classifying entanglement by algebraic geometry

Masoud Gharahi

Published Dec 3, 2023• 2 citations

Abstract

Quantum Entanglement is one of the key manifestations of quantum mechanics that separate the quantum realm from the classical one. Characterization of entanglement as a physical resource for quantum technology became of uppermost importance. While the entanglement of bipartite systems is already well understood, the ultimate goal to cope with the properties of entanglement of multipartite systems is still far from being realized. This paper covers characterization of multipartite entanglement using algebraic-geometric tools. First, we establish an algorithm to classify multipartite entanglement by [Formula: see text]-secant varieties of the Segre variety and [Formula: see text]-multilinear ranks that are invariant under Stochastic Local Operations with Classical Communication (SLOCC). We present a fine-structure classification of multiqubit and tripartite entanglement based on this algorithm. Another fundamental problem in quantum information theory is entanglement transformation that is quite challenging regarding to multipartite systems. It is captivating that the proposed entanglement classification by algebraic geometry can be considered as a reference to study SLOCC and asymptotic SLOCC interconversions among different resources based on tensor rank and border rank, respectively. In this regard, we also introduce a new class of tensors that we call persistent tensors and construct a lower bound for their tensor rank. We further cover SLOCC convertibility of multipartite systems considering several families of persistent tensors.

DOI: 10.1142/s0219749923500478

Related papers

Fine-structure classification of multiqubit entanglement by algebraic geometry

Masoud Gharahi, Stefano Mancini, Giorgio Ottaviani

The authors use algebraic-geometry tools, secant varieties, and l-multilinear ranks, to present an entanglement classification of generic n-qubit pure states under stochastic local operation and classical communication that is based on a finite number of families and subfamilies.

arXiv:1910.09665•Physical Review Research•Oct 1, 2020•22 citations

Multipartite Entanglement

Gilad Gour

Chapter 14 transitions the focus to multipartite entanglement, a realm that broadens the discussion from bipartite systems to those involving multiple parties. This complex form of entanglement plays a crucial role in quantum computing, cryptography, and communication networks. The chapter introduces the foundational concepts of multipartite entanglement, including its characterization and the challenges associated with its classification. Significant attention is given to the classification of multipartite entangled states through SL-invariant polynomials, which provide tools for understanding the structure and properties of these states. Stochastic Local Operations and Classical Communication (SLOCC) are introduced as a means to classify entanglement. Furthermore, the chapter explores the entanglement of assistance and the monogamy of entanglement, two concepts that illustrate the limitations and potential for distributing entanglement among multiple parties. Through detailed explanations and examples in three and four qubits, this chapter offers insights into the intricate world of multipartite entanglement, revealing both its potential and challenges.

Cambridge University Press eBooks•Apr 10, 2025•23 citations

Tensor invariants for multipartite entanglement classification

Sylvain Carrozza, Johann Chevrier, Luca Lionni

Organising the space of entanglement structures of a multipartite quantum system is a much more challenging task than its bipartite version: while the local unitary (LU) orbit of a bipartite pure state can be conveniently characterized by its entanglement spectrum, invariants of multipartite entanglement structures are comparatively difficult to define and work with. The root cause of this difference is that the bipartite problem can be reduced to the analysis of matrix invariants, while its multipartite version is governed by a much richer space of tensor invariants. The present work explores the latter through the lens of so-called trace-invariants, which are in one-to-one correspondence with combinatorial objects known as colored graphs. We first explain why trace-invariant evaluations can serve as labels of LU-orbits of multipartite pure states, how this strategy extends to random states, and how the effect of local operations (LO) can be analyzed through such data. We then focus on entanglement classification within an (infinite-dimensional) subspace of reference states, whose basic building blocks are GHZ states of various dimensions. We show that relatively simple subclasses of trace-invariants are sufficient to separate the LU-orbits of reference states, and enable a complete (resp. an incomplete) characterization of their relations in the LO (resp. LOCC) resource theory of entanglement. Finally, we investigate how a (still infinite) subclass of reference states of local dimension N can be efficiently distinguished at leading and subleading orders in an asymptotic large-N expansion (among themselves, or from Haar-random states). This analysis relies crucially on combinatorial quantities associated to colored graphs, some of which have already played instrumental roles in the recent literature on random tensors. Results of broader relevance are reported along the way.

math-phCross-listedarXiv:2604.02269•Apr 3, 2026•0 citations

Entanglement classification from a topological perspective

Dmitry Melnikov

Classification of entanglement is an important problem in quantum resource theory. In this paper we discuss an embedding of this problem in the context of topological quantum field theories (TQFTs). This approach allows classifying entanglement patterns in terms of topological equivalence classes. In the bipartite case a classification equivalent to the one by stochastic local operations and classical communication (SLOCC) is constructed by restricting to a simple class of connectivity diagrams. Such diagrams characterize quantum states of TQFT up to braiding and tangling of the ``connectome.'' In the multipartite case the same restricted topological classification only captures a part of the SLOCC classes, in particular, it does not see the $W$ entanglement of three qubits. Nonlocal braiding of connections may solve the problem, but no finite classification is attempted in this case. Despite incompleteness, the connectome classification has a straightforward generalization to any number and dimension of parties and has a very intuitive interpretation, which might be useful for understanding specific properties of entanglement and for design of new quantum resources.

arXiv:2208.13901•Physical review. D/Physical review. D.•Jun 12, 2023•9 citations

Quantifying the dimensionality of multiparticle entanglement via partition rank

Sophia Denker, Ismaël Septembre, Robin Krebs +1 more

The usefulness of entanglement as a resource in quantum technologies increases for larger systems, that is, if more particles or higher-dimensional quantum systems are considered. Yet, the interplay between dimensionality and multiparticle entanglement is not well understood. Only for two-particle systems an unambiguous and coherent notion of entanglement dimensionality, based on the Schmidt decomposition, is known. We introduce a concept to characterize the entanglement dimensionality of multiparticle states based on decompositions of pure states into superpositions of states without genuine multiparticle entanglement. We provide constructive methods to characterize the resulting partition rank for pure and mixed states. This allows the identification of novel maximally correlated states as well as a discrete classification of quantum states under stochastic local operations and classical communication. From a mathematical perspective, our approach can be formulated in terms of the slice rank and partition rank of tensors and our results allow to characterize these by connecting them to a generalized injective tensor norm.

quant-pharXiv:2608.23399•Aug 25, 2026•0 citations

Computing Entanglement Polytopes

Konstantin Wernli

In arXiv:1208.0365 entanglement polytopes where introduced as a coarsening of the SLOCC classification of multipartite entanglement. The advantages of classifying entanglement by entanglement polytopes are a finite hierarchy for all dimensions and a number of parameters linear in system size. In arXiv:1208.0365 a method to compute entanglement polytopes using geometric invariant theory is presented. In this thesis we consider alternative methods to compute them. Some geometrical and algebraical tools are presented that can be used to compute inequalities giving an outer approximation of the entanglement polytopes. Furthermore we present a numerical method which, in theory, can compute the entanglement polytope of any given SLOCC class given a representative. Using it we classify the entanglement polytopes of $2 \times 3 \times N$ systems.

arXiv:1808.03382•Aug 9, 2018•0 citations

Quantum Entanglement is one of the key manifestations of quantum mechanics that separate the quantum realm from the classical one. Characterization of entanglement as a physical resource for quantum technology became of uppermost importance. While the entanglement of bipartite systems is already well understood, the ultimate goal to cope with the properties of entanglement of multipartite systems is still far from being realized. This paper covers characterization of multipartite entanglement using algebraic-geometric tools. First, we establish an algorithm to classify multipartite entanglement by [Formula: see text]-secant varieties of the Segre variety and [Formula: see text]-multilinear ranks that are invariant under Stochastic Local Operations with Classical Communication (SLOCC). We present a fine-structure classification of multiqubit and tripartite entanglement based on this algorithm. Another fundamental problem in quantum information theory is entanglement transformation that is quite challenging regarding to multipartite systems. It is captivating that the proposed entanglement classification by algebraic geometry can be considered as a reference to study SLOCC and asymptotic SLOCC interconversions among different resources based on tensor rank and border rank, respectively. In this regard, we also introduce a new class of tensors that we call persistent tensors and construct a lower bound for their tensor rank. We further cover SLOCC convertibility of multipartite systems considering several families of persistent tensors.

Chapter 14 transitions the focus to multipartite entanglement, a realm that broadens the discussion from bipartite systems to those involving multiple parties. This complex form of entanglement plays a crucial role in quantum computing, cryptography, and communication networks. The chapter introduces the foundational concepts of multipartite entanglement, including its characterization and the challenges associated with its classification. Significant attention is given to the classification of multipartite entangled states through SL-invariant polynomials, which provide tools for understanding the structure and properties of these states. Stochastic Local Operations and Classical Communication (SLOCC) are introduced as a means to classify entanglement. Furthermore, the chapter explores the entanglement of assistance and the monogamy of entanglement, two concepts that illustrate the limitations and potential for distributing entanglement among multiple parties. Through detailed explanations and examples in three and four qubits, this chapter offers insights into the intricate world of multipartite entanglement, revealing both its potential and challenges.

Organising the space of entanglement structures of a multipartite quantum system is a much more challenging task than its bipartite version: while the local unitary (LU) orbit of a bipartite pure state can be conveniently characterized by its entanglement spectrum, invariants of multipartite entanglement structures are comparatively difficult to define and work with. The root cause of this difference is that the bipartite problem can be reduced to the analysis of matrix invariants, while its multipartite version is governed by a much richer space of tensor invariants. The present work explores the latter through the lens of so-called trace-invariants, which are in one-to-one correspondence with combinatorial objects known as colored graphs. We first explain why trace-invariant evaluations can serve as labels of LU-orbits of multipartite pure states, how this strategy extends to random states, and how the effect of local operations (LO) can be analyzed through such data. We then focus on entanglement classification within an (infinite-dimensional) subspace of reference states, whose basic building blocks are GHZ states of various dimensions. We show that relatively simple subclasses of trace-invariants are sufficient to separate the LU-orbits of reference states, and enable a complete (resp. an incomplete) characterization of their relations in the LO (resp. LOCC) resource theory of entanglement. Finally, we investigate how a (still infinite) subclass of reference states of local dimension N can be efficiently distinguished at leading and subleading orders in an asymptotic large-N expansion (among themselves, or from Haar-random states). This analysis relies crucially on combinatorial quantities associated to colored graphs, some of which have already played instrumental roles in the recent literature on random tensors. Results of broader relevance are reported along the way.

Classification of entanglement is an important problem in quantum resource theory. In this paper we discuss an embedding of this problem in the context of topological quantum field theories (TQFTs). This approach allows classifying entanglement patterns in terms of topological equivalence classes. In the bipartite case a classification equivalent to the one by stochastic local operations and classical communication (SLOCC) is constructed by restricting to a simple class of connectivity diagrams. Such diagrams characterize quantum states of TQFT up to braiding and tangling of the ``connectome.'' In the multipartite case the same restricted topological classification only captures a part of the SLOCC classes, in particular, it does not see the

W

entanglement of three qubits. Nonlocal braiding of connections may solve the problem, but no finite classification is attempted in this case. Despite incompleteness, the connectome classification has a straightforward generalization to any number and dimension of parties and has a very intuitive interpretation, which might be useful for understanding specific properties of entanglement and for design of new quantum resources.

The usefulness of entanglement as a resource in quantum technologies increases for larger systems, that is, if more particles or higher-dimensional quantum systems are considered. Yet, the interplay between dimensionality and multiparticle entanglement is not well understood. Only for two-particle systems an unambiguous and coherent notion of entanglement dimensionality, based on the Schmidt decomposition, is known. We introduce a concept to characterize the entanglement dimensionality of multiparticle states based on decompositions of pure states into superpositions of states without genuine multiparticle entanglement. We provide constructive methods to characterize the resulting partition rank for pure and mixed states. This allows the identification of novel maximally correlated states as well as a discrete classification of quantum states under stochastic local operations and classical communication. From a mathematical perspective, our approach can be formulated in terms of the slice rank and partition rank of tensors and our results allow to characterize these by connecting them to a generalized injective tensor norm.

In arXiv:1208.0365 entanglement polytopes where introduced as a coarsening of the SLOCC classification of multipartite entanglement. The advantages of classifying entanglement by entanglement polytopes are a finite hierarchy for all dimensions and a number of parameters linear in system size. In arXiv:1208.0365 a method to compute entanglement polytopes using geometric invariant theory is presented. In this thesis we consider alternative methods to compute them. Some geometrical and algebraical tools are presented that can be used to compute inequalities giving an outer approximation of the entanglement polytopes. Furthermore we present a numerical method which, in theory, can compute the entanglement polytope of any given SLOCC class given a representative. Using it we classify the entanglement polytopes of

2 \times 3 \times N

systems.