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.
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.
Quantum entanglement is a fundamental resource in quantum information, but its characterization becomes increasingly challenging as the size of multipartite systems grows. This thesis investigates machine learning methods to detect and quantify entanglement in pure multiqubit states using only single qubit Pauli expectation values. Two complementary tasks are considered: the distinction between fully separable and entangled states, with particular attention to weakly entangled states close to the separability boundary, and the regression of normalized multipartite classical squashed entanglement. Several machine learning models are evaluated for detection, while multilayer perceptrons are employed for quantification. The low entanglement regime is investigated through dedicated datasets and targeted data augmentation strategies. The proposed approaches are studied for systems of 5, 10, 15, and 20 qubits and are further evaluated under realistic measurement conditions, including finite shot noise, asymmetric readout errors, calibration drift, and data acquired from real quantum processors. The study assesses the scalability, robustness, and practical limitations of data-driven entanglement characterization based on a linearly scaling set of local observables.
The detection and classification of entanglement properties in a two-qubit and a multi-qubit system is a topic of great interest. This topic has been extensively studied, and as a result, we discovered various approaches for detecting and classifying multi-qubit, in particular three-qubit entangled states. The emphasis of this work is on a formalism of methods for the detection and classification of bipartite as well as multipartite quantum systems. We have used the method of structural physical approximation of partially transposed matrix (SPA-PT) for the detection of entangled states in arbitrary dimensional bipartite quantum systems. Also, we have proposed criteria for the classification of all possible stochastic local operations and classical communication (SLOCC) inequivalent classes of a pure and mixed three-qubit state using the SPA-PT map. To quantify entanglement, we have defined a new measure of entanglement based on the method of SPA-PT, which we named as "structured negativity". We have shown that this measure can be used to quantify entanglement for negative partial transposed entangled states (NPTES). Since the methods for detection, classification and quantification of entanglement, defined in this thesis are based on SPA-PT, they may be realized in an experiment.
Entanglement is one of the most fascinating features of quantum theory, as it fundamentally distinguishes quantum systems from classical systems. It not only might play a role in natural processes, but provides an especially powerful resource for a plethora of quantum information protocols, including quantum state teleportation, superdense coding as well as quantum computation schemes. However, for larger systems involving more than two parties, it is a challenging task to verify and characterize entanglement. In this thesis, efficient means for detecting genuine multipartite entanglement in multiqubit quantum systems will be derived, demonstrated, and discussed. Beyond that, methods for quantum state and process tomography will be introduced, which allow to analyze and investigate prepared multipartite states or even the performance of whole setups. Some typical obstacles for reliable state tomography will be pointed out, together with new means to understand experimentally obtained data. Finally, the measurement problem, which describes the unavoidable backaction of a measurement process to the quantum state under investigation, will be illustrated. Together with the discussion of different methods of quantum measurements, the optimal measurement instruments for binary qubit measurements will be derived. These optimal measurement instruments allow to perform a quantum measurement, providing a tunable amount of information about the quantum state, while avoiding any unnecessary disturbance to the state. This set of optimal instruments will be compared to other measurement schemes, such as measurements based on the optimal quantum cloning protocol.
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.