The study of multipartite entanglement is not only interesting but also important due to its wide application in quantum information processing. However, the complicated structure of the Hilbert space for many parties makes multipartite entanglement extremely complicated. It is then worth studying the structure of the Hilbert space itself. In this work, we provide a way to study the structure of SLOCC-equivalence and to determine the number free parameters for SLOCC-equivalent classes. Additionally, two different entanglement witnesses are introduced. The method matches well the existing results, and can make predictions for more-qubit systems.
The study of multipartite entanglement is not only interesting but also important due to its wide application in quantum information processing. However, the complicated structure of the Hilbert space for many parties makes multipartite entanglement extremely complicated. It is then worth studying the structure of the Hilbert space itself. In this work, we provide a way to study the structure of SLOCC-equivalence and to determine the number free parameters for SLOCC-equivalent classes. Additionally, two different entanglement witnesses are introduced. The method matches well the existing results, and can make predictions for more-qubit systems.
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.
Quantum states that are symmetric with respect to permutations of their subsystems appear in a wide range of physical settings, and they have a variety of promising applications in quantum information science. In this thesis, the entanglement of symmetric multipartite states is categorized, with a particular focus on the pure multi-qubit case and the geometric measure of entanglement. An essential tool for this analysis is the Majorana representation, a generalization of the single-qubit Bloch sphere representation, which allows for a unique representation of symmetric n-qubit states by n points on the surface of a sphere. Here this representation is employed to search for the maximally entangled symmetric states of up to 12 qubits in terms of the geometric measure, and an intuitive visual understanding of the upper bound on the maximal symmetric entanglement is given. Furthermore, it will be seen that the Majorana representation facilitates the characterization of entanglement equivalence classes such as stochastic local operations and classical communication (SLOCC) and the degeneracy configuration (DC). It is found that SLOCC operations between symmetric states can be described by the Möbius transformations of complex analysis, which allows for a clear visualization of the SLOCC freedoms and facilitates the understanding of SLOCC invariants and equivalence classes. In particular, explicit forms of representative states for all symmetric SLOCC classes of up to five qubits are derived. Well-known entanglement classification schemes such as the four qubit entanglement families or polynomial invariants are reviewed in the light of the results gathered here, which leads to sometimes surprising connections. Some interesting links and applications of the Majorana representation to related fields of mathematics and physics are also discussed.
1. For mathematical point of view, Quantum Information Theory deals with finite dimensional Hilbert spaces, the state spaces of finite k-bipartite systems. In the case of pure k-bipartite systems, this space has the special form 2. H=V1 ⊗ ... ⊗ Vk, 3. where Vi denotes a finite dimensional state space of the ith particle of the system (most of the time, one assumes that it is a qubit, i.e. dim Vi = 2). The interesting non-classical behavior already occurs for two-qubit systems, for the so-called entangled states: the states which cannot be written in the form v1 ⊗ v2. There is no general agreement on the definition of entanglement for system with more than two parts. Klyachko has proposed to regard as entangled the states which are semi-stable for the action of the SLOCC group (G=SL(V1) × ... × SL(Vk)) in the sense of geometric invariant theory. Geometric invariant theory provides 4. methods for characterizing such states without explicitly computing the invariants. In order to test the significance of this property, we have explicitly computed the invariants in the simplest cases. 5. The non-locality properties of an entangled states does not change under unitary operations acting independently on each of its subsystem. The idea to construct entanglement measure by means of unitary invariant have been explored for example by Grassl et al. (1998), Schlienz and Mahler (1996). We have proved in 2006, that such invariants can be deduced from SLOCC-covariants. The knowledge of all the covariants and hence, the classification of the SLOCC orbits seems to be relevant in this context. However, except for simplest systems there are far too many orbits and the complete classification is out of reach. 6. 7. The aim of the series of four lectures given by Jean-Gabriel Luque and Jean-Yves Thibon is to explain a subproblem: how to compute the Hilbert series of the algebraic invariants for the pure k-qubit systems. 8. 9. In the two first lectures, Jean-Gabriel Luque will give a brief account on the symmetric functions and the characters of the symmetric groups. The first two talks will be meant for an audience of beginner in the area of symmetric functions. In the 10. two remaining lectures, Jean-Yves Thibon will explore the links between symmetric functions and Kronecker product (Lecture 3) in order to explain how to compute the Hilbert series (Lecture 4).
Local unitary invariants allow one to test whether multipartite states are equivalent up to local basis changes. Equivalently, they specify the geometry of the "orbit space" obtained by factoring out local unitary action from the state space. This space is of interest because of its intimate relationship to entanglement. Unfortunately, the dimension of the orbit space grows exponentially with the number of subsystems, and the number of invariants needed to characterise orbits grows at least as fast. This makes the study of entanglement via local unitary invariants seem very daunting. I point out here that there is a simplifying principle: Invariants fall into families related by the tracing-out of subsystems, and these families grow exponentially with the number of subsystems. In particular, in the case of pure qubit systems, there is a family whose size is about half the dimension of orbit space. These invariants are closely related to cumulants and to multipartite separability. Members of the family have been repeatedly discovered in the literature, but the fact that they are related to cumulants and constitute a family has apparently not been observed.
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.
Quantum entanglement plays a central role in quantum information processing. A main objective of the theory of quantum entanglement is to classify different types of entanglement according to their inter-convertibility through manipulations that do not require quantum communication. While bipartite entanglement is well understood in this framework, the classification of entangle-ments among three or more subsystems is inherently much more difficult. In this paper, we study pure state entanglement in systems of dimension 2 ⊗ m ⊗ n. Two states are considered equivalent if they can be reversibly converted from one to the other with a nonzero probability using only local quantum resources and classical communication (SLOCC). We introduce a connection between entanglement manipulations in these systems and the well-studied theory of matrix pencils. All previous attempts to study general SLOCC equivalence in such systems have relied on somewhat contrived techniques which fail to reveal the elegant structure of the problem that can be seen from the matrix pencil approach. Based on this method, we report the first polynomial-time algorithm for deciding when two 2⊗m ⊗ n states are SLOCC equivalent. Besides recovering the previously known 26 distinct SLOCC equivalence classes in 2 ⊗ 3 ⊗ n systems, we also determine the hierarchy between these classes.