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

arXiv:quant-ph/0109056

Quantum entanglement without eigenvalue spectra:multipartite case

Hao Chen

Published Sep 13, 2001• 2 citations
arXivHTMLPDF

Abstract

We introduce algebriac sets in the products of complex projective spaces for multipartite mixed states, which are independent of their eigenvalues and only measure the "position" of their eigenvectors, as their non-local invariants (ie. remaining invariant after local untary transformations). These invariants are naturally arised from the physical consideration of checking multipartite mixed states by measuring them with multipartite separable pure states. The algebraic sets have to be the sum of linear subspaces if the multipartite mixed state is separable, and thus we give a new separability criterion of multipartite mixed states. A continuous family of 4-party mixed states, whose members are separable for any 2:2 cut and entangled for any 1:3 cut (thus bound entanglement if 4 parties are isolated), is constructed and studied from our invariants and separability criterion. Examples of LOCC-incomparable entangled tripartite pure states are given to show it is hopeless to characterize the entanglement properties of tripartite pure states by only using the eigenvalue speactra of their partial traces. We also prove that at least $n^2+n-1$ terms of separable pure states, which are "orthogonal" in some sence, are needed to write a generic pure state in $H_A^{n^2} \otimes H_B^{n^2} \otimes H_C^{n^2}$ as a linear combination of them.

DOI
10.48550/arxiv.quant-ph/0109056

Related papers

Quantum entanglement without eigenvalue spectra

Hao Chen

From the consideration of measuring bipartite mixed states by separable pure states, we introduce algebraic sets in complex projective spaces for bipartite mixed states as the degenerating locus of the measurement. These algebraic sets are independent of the eigenvalues and only measure the "position" of eigenvectors of bipartite mixed states. They are nonlocal invariants ie., remaining invariant after local unitary transformations. The algebraic sets have to be the sum of the linear subspaces if the mixed states are separable, and thus we give a "eigenvalue-free" criterion of separability.Based on our criterion, examples are given to illustrate that entangled mixed states which are invariant under partial transposition or fufill entropy and disorder criterion of separability can be constructed systematically.We reveal that a large part of quantum entanglement is independent of eigenvalue spectra and develop a method to measure this part of quantum enatnglement.The results are extended to multipartite case.

arXiv:quant-ph/0108093•Aug 21, 2001•2 citations

New Invariants and Separability Criterion of the Mixed States: Multipartite Case

Chen, Hao

We introduce algebraic sets in the products of complex projective spaces for the mixed states in multipartite quantum systems as their invariants under local unitary operations. The algebraic sets have to be the union of the linear subspaces if the state is separable. Some examples are studied based on our criterion

arXiv:quant-ph/0107112•Jul 23, 2001•0 citations

Quantum entanglement and geometry of determinantal varieties

Hao Chen

Quantum entanglement was first recognized as a feature of quantum mechanics in the famous paper of Einstein, Podolsky, and Rosen. Recently it has been realized that quantum entanglement is a key ingredient in quantum computation, quantum communication, and quantum cryptography. In this paper, we introduce algebraic sets, which are determinantal varieties in the complex projective spaces or the products of complex projective spaces, for the mixed states on bipartite or multipartite quantum systems as their invariants under local unitary transformations. These invariants are naturally arised from the physical consideration of measuring mixed states by separable pure states. Our construction has applications in the following important topics in quantum information theory: (1) separability criterion, it is proved that the algebraic sets must be a union of the linear subspaces if the mixed states are separable; (2) simulation of Hamiltonians, it is proved that the simulation of semipositive Hamiltonians of the same rank implies the projective isomorphisms of the corresponding algebraic sets; (3) construction of bound entangled mixed states, examples of the entangled mixed states which are invariant under partial transpositions (thus PPT bound entanglement) are constructed systematically from our new separability criterion.

arXiv:quant-ph/0110103•Journal of Mathematical Physics•May 1, 2006•10 citations

New Invariants and Separability criterion of the Mixed States: Bipartite Case

Hao Chen

We introduce algebraic sets in the complex projective spaces for the mixed states in bipartite quantum systems as their invariants under local unitary operations. The algebraic sets of the mixed state have to be the union of the linear subspaces if the mixed state is separable. Some examples are given and studied based on our criterion

arXiv:quant-ph/0107111•Jul 23, 2001•1 citation

Entanglement and Quantumness - New Numerical Approaches -

Fabian Bohnet-Waldraff

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.

•Sep 29, 2017•0 citations

Geometric measure of quantum entanglement for multipartite mixed states

Shenglong Hu, Liqun Qi, Yisheng Song +1 more

The geometric measure of quantum entanglement of a pure state, defined by its distance to the set of pure separable states, is extended to multipartite mixed states. We characterize the nearest disentangled mixed state to a given mixed state with respect to the geometric measure by means of a system of equations. The entanglement eigenvalue for a mixed state is introduced. And we show that, for a given mixed state, its nearest disentangled mixed state is associated with its entanglement eigenvalue. Two numerical examples are used to demonstrate the effectiveness of the proposed method.

International Journal of Software and Informatics•Jan 1, 2014•3 citations
We introduce algebriac sets in the products of complex projective spaces for multipartite mixed states, which are independent of their eigenvalues and only measure the "position" of their eigenvectors, as their non-local invariants (ie. remaining invariant after local untary transformations). These invariants are naturally arised from the physical consideration of checking multipartite mixed states by measuring them with multipartite separable pure states. The algebraic sets have to be the sum of linear subspaces if the multipartite mixed state is separable, and thus we give a new separability criterion of multipartite mixed states. A continuous family of 4-party mixed states, whose members are separable for any 2:2 cut and entangled for any 1:3 cut (thus bound entanglement if 4 parties are isolated), is constructed and studied from our invariants and separability criterion. Examples of LOCC-incomparable entangled tripartite pure states are given to show it is hopeless to characterize the entanglement properties of tripartite pure states by only using the eigenvalue speactra of their partial traces. We also prove that at least n2+n−1n^2+n-1n2+n−1 terms of separable pure states, which are "orthogonal" in some sence, are needed to write a generic pure state in HAn2⊗HBn2⊗HCn2H_A^{n^2} \otimes H_B^{n^2} \otimes H_C^{n^2}HAn2​⊗HBn2​⊗HCn2​ as a linear combination of them.
From the consideration of measuring bipartite mixed states by separable pure states, we introduce algebraic sets in complex projective spaces for bipartite mixed states as the degenerating locus of the measurement. These algebraic sets are independent of the eigenvalues and only measure the "position" of eigenvectors of bipartite mixed states. They are nonlocal invariants ie., remaining invariant after local unitary transformations. The algebraic sets have to be the sum of the linear subspaces if the mixed states are separable, and thus we give a "eigenvalue-free" criterion of separability.Based on our criterion, examples are given to illustrate that entangled mixed states which are invariant under partial transposition or fufill entropy and disorder criterion of separability can be constructed systematically.We reveal that a large part of quantum entanglement is independent of eigenvalue spectra and develop a method to measure this part of quantum enatnglement.The results are extended to multipartite case.
Quantum entanglement was first recognized as a feature of quantum mechanics in the famous paper of Einstein, Podolsky, and Rosen. Recently it has been realized that quantum entanglement is a key ingredient in quantum computation, quantum communication, and quantum cryptography. In this paper, we introduce algebraic sets, which are determinantal varieties in the complex projective spaces or the products of complex projective spaces, for the mixed states on bipartite or multipartite quantum systems as their invariants under local unitary transformations. These invariants are naturally arised from the physical consideration of measuring mixed states by separable pure states. Our construction has applications in the following important topics in quantum information theory: (1) separability criterion, it is proved that the algebraic sets must be a union of the linear subspaces if the mixed states are separable; (2) simulation of Hamiltonians, it is proved that the simulation of semipositive Hamiltonians of the same rank implies the projective isomorphisms of the corresponding algebraic sets; (3) construction of bound entangled mixed states, examples of the entangled mixed states which are invariant under partial transpositions (thus PPT bound entanglement) are constructed systematically from our new separability criterion.
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 geometric measure of quantum entanglement of a pure state, defined by its distance to the set of pure separable states, is extended to multipartite mixed states. We characterize the nearest disentangled mixed state to a given mixed state with respect to the geometric measure by means of a system of equations. The entanglement eigenvalue for a mixed state is introduced. And we show that, for a given mixed state, its nearest disentangled mixed state is associated with its entanglement eigenvalue. Two numerical examples are used to demonstrate the effectiveness of the proposed method.