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

Entanglement and Quantumness - New Numerical Approaches -

Fabian Bohnet-Waldraff

Published Sep 29, 2017• 0 citations
Publisher

Abstract

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.

DOI
10.15496/publikation-19434

Related papers

Detection and Classification of Bipartite and Multipartite Entangled States

Anu Kumari

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.

arXiv:2305.16643•May 26, 2023•0 citations

Tensor eigenvalues and entanglement of symmetric states

Fabian Bohnet-Waldraff, Daniel Braun, O. Giraud

Tensor eigenvalues and eigenvectors have been introduced in the recent mathematical literature as a generalization of the usual matrix eigenvalues and eigenvectors. We apply this formalism to a tensor that describes a multipartite symmetric state or a spin state, and we investigate to what extent the corresponding tensor eigenvalues contain information about the multipartite entanglement (or, equivalently, the quantumness) of the state. This extends previous results connecting entanglement to spectral properties related to the state. We show that if the smallest tensor eigenvalue is negative, the state is detected as entangled. While for spin-1 states the positivity of the smallest tensor eigenvalue is equivalent to separability, we show that for higher values of the angular momentum there is a correlation between entanglement and the value of the smallest tensor eigenvalue.

arXiv:1608.03537•Physical Review A•Oct 17, 2016•13 citations

Development of new tools to detect, characterize and quantify quantum entanglement in multipartite systems

Antoine Neven

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.

•Oct 10, 2018•0 citations

Geometric Measure of Entanglement and Schmidt Decomposition of Multipartite Systems

Levon Tamaryan

The thesis includes the original results of our articles [30, 37, 40, 42, 51, 53, 75]. A method is developed to compute analytically entanglement measures of three-qubit pure states. Owing to it closed-form expressions are presented for the geometric measure of entanglement for three-qubit states that are linear combinations of four orthogonal product states. It turns out that the geometric measure for these states has three different expressions depending on the range of definition in parameter space and the Hilbert space of three-qubits consists of three different entangled regions. The states that lie on joint surfaces separating different entangled regions, designated as shared states, have particularly interesting features and are dual quantum channels for the perfect teleportation and superdense coding [42]. A powerful method is developed to compute analytically multipartite entanglement measures. The method uses the duality concept and creates a bijection between highly entangled quantum states and their nearest separable states. The bijection gives explicitly the geometric entanglement measure of arbitrary generalized W states of n qubits [30, 75]. Additionaly, the behavior of the geometric entanglement measure of many-qubit W states is analyzed and an interpolating formula is derived [51]. Generalized Schmidt decomposition of pure three-qubit states has four positive and one complex coefficients. In contrast to the bipartite case, they are not arbitrary and the largest Schmidt coefficient restricts severely other coefficients. It is derived a non-strict inequality between three-qubit Schmidt coefficients, where the largest coefficient defines the least upper bound for the three nondiagonal coefficients or, equivalently, the three nondiagonal coefficients together define the greatest lower bound for the largest coefficient [53].

arXiv:1311.5994•Nov 23, 2013•0 citations

Quantum Correlations:Geometry and Applications

Shreya Banerjee

In the studies of quantum information and computation, the quantum correlations present in a non-classical system are seen as natural resources. In this thesis, we present a detailed study on quantification and characterization of multipartite quantum entanglement from a geometric perspective. Furthermore, we present protocols and algorithms where quantum correlations such as entanglement, quantum Fisher information, and quantum superposition have been used to provide advantages as well securities in quantum communication tasks, quantum speed-up, and protection against the decoherence in an open quantum system. First, we use a geometric measure of entanglement quantification based on Euclidean distance of the Hermitian matrices to obtain the minimum distance between the set of bipartite n- qudit density matrices with a positive partial transpose and the maximally mixed state. This minimum distance coincides with the radius of the largest separable ball. We present the interior geometry of the set of all positive semidefinite matrices and identify a particular class of Werner states for which the Peres-Horodecki criterion is both necessary and sufficient for separability even in the dimensions greater than six.

•Mar 1, 2021•0 citations

Best separable approximation of N-qubit symmetric states

Ruben Quesada, Anna Sanpera

The structural study of entanglement in multipartite systems is hindered by the lack of necessary and sufficient operational criteria able to discriminate among the various entanglement properties of a given mixed state. Here, we pursue a different route to the study of multipartite entanglement based on the closeness of a multipartite state to the set of separable ones. In particular, we analyze multipartite diagonal symmetric N qubit states and provide the analytical expression for their Best Separable Approximation (BSA [Phys. Rev. Lett. 80, 2261 (1998)]), that is, their unique convex decomposition into a separable part and an entangled one with maximal weight of the separable one.

•Jun 26, 2013•0 citations
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.
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.
Tensor eigenvalues and eigenvectors have been introduced in the recent mathematical literature as a generalization of the usual matrix eigenvalues and eigenvectors. We apply this formalism to a tensor that describes a multipartite symmetric state or a spin state, and we investigate to what extent the corresponding tensor eigenvalues contain information about the multipartite entanglement (or, equivalently, the quantumness) of the state. This extends previous results connecting entanglement to spectral properties related to the state. We show that if the smallest tensor eigenvalue is negative, the state is detected as entangled. While for spin-1 states the positivity of the smallest tensor eigenvalue is equivalent to separability, we show that for higher values of the angular momentum there is a correlation between entanglement and the value of the smallest tensor eigenvalue.
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 thesis includes the original results of our articles [30, 37, 40, 42, 51, 53, 75]. A method is developed to compute analytically entanglement measures of three-qubit pure states. Owing to it closed-form expressions are presented for the geometric measure of entanglement for three-qubit states that are linear combinations of four orthogonal product states. It turns out that the geometric measure for these states has three different expressions depending on the range of definition in parameter space and the Hilbert space of three-qubits consists of three different entangled regions. The states that lie on joint surfaces separating different entangled regions, designated as shared states, have particularly interesting features and are dual quantum channels for the perfect teleportation and superdense coding [42]. A powerful method is developed to compute analytically multipartite entanglement measures. The method uses the duality concept and creates a bijection between highly entangled quantum states and their nearest separable states. The bijection gives explicitly the geometric entanglement measure of arbitrary generalized W states of n qubits [30, 75]. Additionaly, the behavior of the geometric entanglement measure of many-qubit W states is analyzed and an interpolating formula is derived [51]. Generalized Schmidt decomposition of pure three-qubit states has four positive and one complex coefficients. In contrast to the bipartite case, they are not arbitrary and the largest Schmidt coefficient restricts severely other coefficients. It is derived a non-strict inequality between three-qubit Schmidt coefficients, where the largest coefficient defines the least upper bound for the three nondiagonal coefficients or, equivalently, the three nondiagonal coefficients together define the greatest lower bound for the largest coefficient [53].
In the studies of quantum information and computation, the quantum correlations present in a non-classical system are seen as natural resources. In this thesis, we present a detailed study on quantification and characterization of multipartite quantum entanglement from a geometric perspective. Furthermore, we present protocols and algorithms where quantum correlations such as entanglement, quantum Fisher information, and quantum superposition have been used to provide advantages as well securities in quantum communication tasks, quantum speed-up, and protection against the decoherence in an open quantum system. First, we use a geometric measure of entanglement quantification based on Euclidean distance of the Hermitian matrices to obtain the minimum distance between the set of bipartite n- qudit density matrices with a positive partial transpose and the maximally mixed state. This minimum distance coincides with the radius of the largest separable ball. We present the interior geometry of the set of all positive semidefinite matrices and identify a particular class of Werner states for which the Peres-Horodecki criterion is both necessary and sufficient for separability even in the dimensions greater than six.
The structural study of entanglement in multipartite systems is hindered by the lack of necessary and sufficient operational criteria able to discriminate among the various entanglement properties of a given mixed state. Here, we pursue a different route to the study of multipartite entanglement based on the closeness of a multipartite state to the set of separable ones. In particular, we analyze multipartite diagonal symmetric N qubit states and provide the analytical expression for their Best Separable Approximation (BSA [Phys. Rev. Lett. 80, 2261 (1998)]), that is, their unique convex decomposition into a separable part and an entangled one with maximal weight of the separable one.