Quantum entanglement is a key property of quantum information theory, that is at the heart of numerous promising applications in fields such as quantum cryptography, quantum computing or quantum sensing. In the past decades, the advent of such innovative technologies has reinforced the need for a better understanding of entanglement. The aim of this thesis is to contribute to this effort through the development of new tools targeting the characterization of several features of entanglement. Concerning the issue of entanglement detection, we present an optimization of the approach that exploits the concept of generalized concurrences to solve the separability problem for pure states. We then reformulate the separability question of mixed states into a matrix analysis problem, from which we obtain general separability criteria for multipartite states of ranks two and three. We also briefly discuss some properties of separable states. In particular, we characterize optimal separable decompositions of symmetric (i.e. permutation invariant) states of two and three qubits with maximal rank properties. Regarding the quantification of entanglement, we propose a function to quantify the entanglement of symmetric multiqubit states within classes of entangled states gathering states that are stochastically equivalent through local operations assisted with classical communication. This function establishes a link between the amount of entanglement of a symmetric state and the distribution of its Majorana points on the Bloch sphere. We finally investigate the robustness of entanglement with respect to particle loss and provide a full description of all multiqubit states that are fragile for the loss of one of their qubits. For symmetric states, the fragility for the loss of one qubit is shown to be related to a particular symmetry of the Majorana points.
Quantum entanglement is a key property of quantum information theory, that is at the heart of numerous promising applications in fields such as quantum cryptography, quantum computing or quantum sensing. In the past decades, the advent of such innovative technologies has reinforced the need for a better understanding of entanglement. The aim of this thesis is to contribute to this effort through the development of new tools targeting the characterization of several features of entanglement. Concerning the issue of entanglement detection, we present an optimization of the approach that exploits the concept of generalized concurrences to solve the separability problem for pure states. We then reformulate the separability question of mixed states into a matrix analysis problem, from which we obtain general separability criteria for multipartite states of ranks two and three. We also briefly discuss some properties of separable states. In particular, we characterize optimal separable decompositions of symmetric (i.e. permutation invariant) states of two and three qubits with maximal rank properties. Regarding the quantification of entanglement, we propose a function to quantify the entanglement of symmetric multiqubit states within classes of entangled states gathering states that are stochastically equivalent through local operations assisted with classical communication. This function establishes a link between the amount of entanglement of a symmetric state and the distribution of its Majorana points on the Bloch sphere. We finally investigate the robustness of entanglement with respect to particle loss and provide a full description of all multiqubit states that are fragile for the loss of one of their qubits. For symmetric states, the fragility for the loss of one qubit is shown to be related to a particular symmetry of the Majorana points.
The main topic of this compilation thesis is the investigation of multipartite entanglement of finite dimensional systems. We developed a numerical algorithm that detects if a multipartite state is entangled or separable in a finite number of steps of a semi-definite optimization task. This method is an extension of previously known semi-definite methods, which are inconclusive when the state is separable. In our case, if the state is separable, an explicit decomposition into a mixture of separable states can be extracted. This was achieved by mapping the entanglement problem onto the mathematically well studied truncated moment problem. Additionally, a new way of writing the partially transposed state for symmetric multi-qubit states was developed which simplifies many results previously known in entanglement theory. This new way of writing the partial transpose criterion unifies different interpretations and alternative formulations of the partial transpose criterion and it is also a part in the aforementioned semi-definite algorithm. The geometric properties of entangled symmetric states of two qubits were studied in detail: We could answer the question of how far a given pure state is from the convex hull of symmetric separable states, as measured by the Hilbert-Schmidt distance, by giving an explicit formula for the closest separable symmetric state. For mixed states we could provide a numerical upper and analytical lower bound for this distance. For a larger number of qubits we investigated the ball of absolutely classical states, i.e. symmetric multi-qubit states that stay separable under any unitary transformation. We found an analytical lower bound for the radius of this ball around the maximally mixed symmetric state and gave a numerical upper bound on this radius, by searching for an entangled state as close as possible to the maximally mixed symmetric state. The tensor representation of a symmetric multi-qubit state, or spin-j state, allowed us to study entanglement properties based on the spectrum of the tensor via tensor eigenvalues. The definiteness of this tensor relates to the entanglement of the state it represents and, hence, the smallest tensor eigenvalue can be used to detect entanglement. However, the tensor eigenvalues are more difficult to determine than the familiar matrix eigenvalues which made the investigation computationally more challenging. The relationship between the value of the smallest tensor eigenvalue and the amount of entanglement in the state was also investigated. It turned out that they are strongly correlated for small system sizes, i.e. for up to six qubits. However, to investigate this correlation we needed an independent way to gauge the amount of entanglement of a state and in order to do so we improved existing numerical methods to determine the distance of a state to the set of separable symmetric states, using a combination of linear and quadratic programming. The tensor representation of symmetric multi-qubit states was also used to formally define a new tensor class of regularly decomposable tensors that corresponds to the set of separable symmetric multi-qubit states.
This thesis is an attempt to enhance understanding of the following questions A- Given a multipartite quantum state (possibly mixed), how to find out whether it is entangled or separable? (Detection of entanglement.) B- Given an entangled state, how to decide how much entangled it is? (Measure of entanglement.), in the context of multipartite quantum states. We have explored two approaches. In the first approach, we assign a weighted graph with multipartite quantum state and address the question of separability in terms of these graphs and various operations involving them. In the second approach we use the so called Bloch representation of multipartite quantum states to establish new criteria for detection of multipartite entangled states. We further give a new measure for entanglement in N-qubit entangled pure state and formally extend it to cover N-qubit mixed states.
In this thesis, we discuss several aspects of the characterization of entanglement in multipartite quantum systems, including detection, classification and quantification of entanglement. First, we discuss triqubit pure entanglement and propose a special true tripartite entanglement, the mixed entanglement, besides the Greenberger-Horne-Zeilinger (GHZ) entanglement and the W entanglement. Then, based on quantitative complementarity relations, we draw entanglement Venn diagrams for triqubit pure states with different entanglements and introduce the total tangle Tau sup(T) to quantify total entanglement of triqubit pure states by defining the union I that is equivalent to the total tangle Tau sup(T) from the mathematical point of view. The generalizations of entanglement Venn diagrams and the union I to N-qubit pure states are also discussed. Finally, based on the ranks of reduced density matrices, we discuss the separability of multiparticle arbitrary -dimensional pure and mixed states, respectively.
This thesis deals with methods of the detection of entanglement.After recalling some facts and definitions concerning entanglement and separability, we investigate two methods of the detection of entanglement.In the first part of this thesis we consider so-called entanglement witnesses, mainly in view of the detection of multipartite entanglement.Entanglement witnesses are observables for which a negative expectation value indicates entanglement.We first present a simple method to construct these witnesses.Since witnesses are nonlocal observables, they are not easy to measure in a real experiment.However, as we will show, one can circumvent this problem by decomposing the witness into several local observables which can be measured separately.We calculate the local decompositions for several interesting witnesses for two, three and four qubits.Local decompositions can be optimized in the number of measurement settings which are needed for an experimental implementation.We present a method to prove that a given local decomposition is optimal and discuss with this the optimality of our decompositions.Then we present another method of designing witnesses which are by construction measurable with local measurements.Finally, we shortly report on experiments where some of the witnesses derived in this part have been used to detect three-and four-partite entanglement of polarized photons.The second part of this thesis deals with separability criteria which are written in terms of uncertainty relations.There are two different formulations of uncertainty relations since one can measure the uncertainty of an observable by its variance as well as by entropic quantities.We show that both formulations are useful tools for the derivation of separability criteria for finite-dimensional systems and investigate the resulting criteria.Our results in this part exhibit also some more fundamental properties of entanglement: We show how known separability criteria for infinitedimensional systems can be translated to finite-dimensional systems.Furthermore, we prove that any entropic uncertainty relation on one part of the system gives rise to a separability criterion on the composite system.
One of the key manifestations of quantum mechanics is the phenomenon of quantum entanglement. While the entanglement of bipartite systems is already well understood, our knowledge of entanglement in multipartite systems is still limited. This dissertation covers various aspects of the quantification of entanglement in multipartite states and the role of symmetry in such systems. Firstly, we establish a connection between the classification of multipartite entanglement and knot theory and investigate the family of states that are resistant to particle loss. Furthermore, we construct several examples of such states using the Majorana representation as well as some combinatorial methods. Secondly, we introduce classes of highly-symmetric but not fully-symmetric states and investigate their entanglement properties. Thirdly, we study the well-established class of Absolutely Maximally Entangled (AME) quantum states. On one hand, we provide construction of new states belonging to this family, for instance, an AME state of 4 subsystems with six levels each, on the other, we tackle the problem of equivalence of such states. Finally, we present a novel approach for the general problem of verification of the equivalence between any pair of arbitrary quantum states based on a single polynomial entanglement measure.
In the past decades, quantum entanglement has been recognized to be the basic resource in quantum information theory. A fundamental need is then the understanding its qualification and its quantification: Is the quantum state entangled, and if it is, then how much entanglement is carried by that? These questions introduce the topics of separability criteria and entanglement measures, both of which are based on the issue of classification of multipartite entanglement. In this dissertation, after reviewing these three fundamental topics for finite dimensional Hilbert spaces, I present my contribution to knowledge. My main result is the elaboration of the partial separability classification of mixed states of quantum systems composed of arbitrary number of subsystems of Hilbert spaces of arbitrary dimensions. This problem is simple for pure states, however, for mixed states it has not been considered in full detail yet. I give not only the classification but also necessary and sufficient criteria for the classes, which make it possible to determine to which class a mixed state belongs. Moreover, these criteria are given by the vanishing of quantities measuring entanglement. Apart from these, I present some side results related to the entanglement of mixed states. These results are obtained in the learning phase of my studies and give some illustrations and examples.