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:1912.08985 · Physical Review A

Separability discrimination and decomposition of m -partite quantum mixed states

Ying Li, Guyan Ni

Published Jul 6, 2020• 15 citations
arXivHTMLPDF

Abstract

We propose an $E$-truncated $K$-moment and semidefinite relaxations (ETKM-SDR) method to check whether an $m$-partite quantum mixed state is separable and give a decomposition for it if it is. We first convert the separability discrimination problem of mixed states to the positive Hermitian decomposition problem of Hermitian tensors. Then, employing the $E$-truncated $K$-moment method, we obtain an optimization model for discriminating separability. Moreover, by applying the semidefinite relaxation method, we get a hierarchy of semidefinite relaxation optimization models and propose an algorithm for detecting the separability of mixed states. The algorithm can also be used for symmetric and nonsymmetric decomposition of separable mixed states. By numerical examples, we find that not all symmetric separable states have symmetric decompositions.

DOI
10.1103/physreva.102.012402

Related papers

Separability discrimination and decomposition of quantum mixed states based on the Broyden-Fletcher-Goldfarb-Shanno algorithm

Bo Yang, Ying Li, Guyan Ni

In this paper, we consider separability discrimination and decomposition problems of quantum mixed states based on the tensor optimization method. We first convert the separability determination problem of quantum mixed states to the positive Hermitian decomposition problem of Hermitian tensors. Then we study a rank-$R$ positive Hermitian approximation model of Hermitian tensors and introduce a Broyden--Fletcher--Goldfarb--Shanno (BFGS) algorithm for rank-$R$ positive Hermitian approximation. We prove that the BFGS algorithm can be used to compute a decomposition of a mixed state if it is separable. Finally, we propose a BFGS algorithm for separability determination and decomposition of quantum mixed states. Numerical examples show the effectiveness of the algorithm.

Physical Review A•Nov 16, 2023•6 citations

Quantum entanglement and separable matrices

Jiawang Nie

A real symmetric matrix is separable if it can be written as a sum of Kronecker products of positive semidefinite matrices. This talk concerns how to check if a matrix is separable or not. We propose a numerical algorithm, based on Lasserre type semidefinite relaxations, for solving the question. To check the separability of a matrix, we construct a hierarchy of semidefinite relaxations. If it is not separable, we can get a mathematical certificate for that; if it is, we can get a decomposition for the separability. This is a joint work with Xinzhen Zhang.

•Jan 1, 2016•0 citations

Separability of symmetric states and vandermonde decomposition

Lilong Qian, Lin Chen, Delin Chu

Abstract Symmetry is one of the central mysteries of quantum mechanics and plays an essential role in multipartite entanglement. In this paper, we consider the separability problem of quantum states in the symmetric space. We establish the relation between the separability of multiqubit symmetric states and the decomposability of Hermitian positive semidefinite matrices. This relation allows us to exchange concepts and ideas between quantum entanglement and Vandermonde decomposition. As an application, we build a suite of tools to investigate the decomposability and show the power of this relation both in theoretical and numerical aspects. For theoretical results, we establish the witness for the decomposability similar to the entanglement witness and characterize the decomposability of some subclasses of matrices. Furthermore, we provide the necessary conditions for the decomposability. Besides, we suggest a numerical algorithm to check whether a given matrix is decomposable. The numerical examples are tested to show the effectiveness.

New Journal of Physics•Feb 10, 2020•4 citations

Degree of separability of bipartite quantum states

Guo Chuan Thiang

We investigate the problem of finding the optimal convex decomposition of a bipartite quantum state into a separable part and a positive remainder, in which the weight of the separable part is maximal. This weight is naturally identified with the degree of separability of the state. In a recent work, the problem was solved for two-qubit states using semidefinite programming. In this paper, we describe a procedure to obtain the optimal decomposition of a bipartite state of any finite dimension via a sequence of semidefinite relaxations. The sequence of decompositions thus obtained is shown to converge to the optimal one. This provides a systematic method to determine the so-called optimal Lewenstein-Sanpera decomposition of any bipartite state. Numerical results are provided to illustrate this procedure, and the special case of rank-2 states is also discussed.

arXiv:1005.3675•Physical Review A•Jul 26, 2010•4 citations

Entanglement and the truncated moment problem

Fabian Bohnet-Waldraff, Daniel Braun, O. Giraud

We map the quantum entanglement problem onto the mathematically well-studied truncated moment problem. This yields a necessary and sufficient condition for separability that can be checked by a hierarchy of semidefinite programs. The algorithm always gives a certificate of entanglement if the state is entangled. If the state is separable, typically a certificate of separability is obtained in a finite number of steps and an explicit decomposition into separable pure states can be extracted.

arXiv:1704.02277•Physical Review A•Sep 11, 2017•22 citations

Rank-bmRpositive Hermitian approximation algorithms and positive Hermitian decompositions of Hermitian tensors

Bo Yang, Ying Li, Guyan Ni +1 more

The Hermitian tensor is regarded as an extension of the Hermitian matrix and can be used to represent a quantum mixed state. In quantum information, the problem of separability discrimination and decomposition of a quantum mixed state is still important and hard. In this paper, we deduce the gradient of the approximation function, and propose three algorithms: A negative gradient algorithm and a BFGS algorithm for rank-$R$ positive Hermitian approximation of Hermitian tensors, and a separability discrimination and decomposition algorithm for Hermitian tensors. According to the Taylor formula and the convexity analysis, we prove the effectiveness of the algorithm. Numerical examples also verify the correctness of the theoretical analysis and the effectiveness of algorithms. They show that the BFGS algorithm can be used for the separability discrimination and the positive Hermitian decomposition, as well as to obtain a rank-positive Hermitian decomposition. Compared with the semidefinite relaxation algorithm, the BFGS algorithm has the advantages of less running time and solving the decomposition of higher-order or higher-dimensional Hermitian tensors.

Scientia Sinica Mathematica•May 30, 2023•1 citation
We propose an EEE-truncated KKK-moment and semidefinite relaxations (ETKM-SDR) method to check whether an mmm-partite quantum mixed state is separable and give a decomposition for it if it is. We first convert the separability discrimination problem of mixed states to the positive Hermitian decomposition problem of Hermitian tensors. Then, employing the EEE-truncated KKK-moment method, we obtain an optimization model for discriminating separability. Moreover, by applying the semidefinite relaxation method, we get a hierarchy of semidefinite relaxation optimization models and propose an algorithm for detecting the separability of mixed states. The algorithm can also be used for symmetric and nonsymmetric decomposition of separable mixed states. By numerical examples, we find that not all symmetric separable states have symmetric decompositions.
In this paper, we consider separability discrimination and decomposition problems of quantum mixed states based on the tensor optimization method. We first convert the separability determination problem of quantum mixed states to the positive Hermitian decomposition problem of Hermitian tensors. Then we study a rank-RRR positive Hermitian approximation model of Hermitian tensors and introduce a Broyden--Fletcher--Goldfarb--Shanno (BFGS) algorithm for rank-RRR positive Hermitian approximation. We prove that the BFGS algorithm can be used to compute a decomposition of a mixed state if it is separable. Finally, we propose a BFGS algorithm for separability determination and decomposition of quantum mixed states. Numerical examples show the effectiveness of the algorithm.
A real symmetric matrix is separable if it can be written as a sum of Kronecker products of positive semidefinite matrices. This talk concerns how to check if a matrix is separable or not. We propose a numerical algorithm, based on Lasserre type semidefinite relaxations, for solving the question. To check the separability of a matrix, we construct a hierarchy of semidefinite relaxations. If it is not separable, we can get a mathematical certificate for that; if it is, we can get a decomposition for the separability. This is a joint work with Xinzhen Zhang.
Abstract Symmetry is one of the central mysteries of quantum mechanics and plays an essential role in multipartite entanglement. In this paper, we consider the separability problem of quantum states in the symmetric space. We establish the relation between the separability of multiqubit symmetric states and the decomposability of Hermitian positive semidefinite matrices. This relation allows us to exchange concepts and ideas between quantum entanglement and Vandermonde decomposition. As an application, we build a suite of tools to investigate the decomposability and show the power of this relation both in theoretical and numerical aspects. For theoretical results, we establish the witness for the decomposability similar to the entanglement witness and characterize the decomposability of some subclasses of matrices. Furthermore, we provide the necessary conditions for the decomposability. Besides, we suggest a numerical algorithm to check whether a given matrix is decomposable. The numerical examples are tested to show the effectiveness.
We investigate the problem of finding the optimal convex decomposition of a bipartite quantum state into a separable part and a positive remainder, in which the weight of the separable part is maximal. This weight is naturally identified with the degree of separability of the state. In a recent work, the problem was solved for two-qubit states using semidefinite programming. In this paper, we describe a procedure to obtain the optimal decomposition of a bipartite state of any finite dimension via a sequence of semidefinite relaxations. The sequence of decompositions thus obtained is shown to converge to the optimal one. This provides a systematic method to determine the so-called optimal Lewenstein-Sanpera decomposition of any bipartite state. Numerical results are provided to illustrate this procedure, and the special case of rank-2 states is also discussed.
The Hermitian tensor is regarded as an extension of the Hermitian matrix and can be used to represent a quantum mixed state. In quantum information, the problem of separability discrimination and decomposition of a quantum mixed state is still important and hard. In this paper, we deduce the gradient of the approximation function, and propose three algorithms: A negative gradient algorithm and a BFGS algorithm for rank-RRR positive Hermitian approximation of Hermitian tensors, and a separability discrimination and decomposition algorithm for Hermitian tensors. According to the Taylor formula and the convexity analysis, we prove the effectiveness of the algorithm. Numerical examples also verify the correctness of the theoretical analysis and the effectiveness of algorithms. They show that the BFGS algorithm can be used for the separability discrimination and the positive Hermitian decomposition, as well as to obtain a rank-positive Hermitian decomposition. Compared with the semidefinite relaxation algorithm, the BFGS algorithm has the advantages of less running time and solving the decomposition of higher-order or higher-dimensional Hermitian tensors.