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

Scientia Sinica Mathematica

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

Bo Yang, Ying Li, Guyan Ni, Mengshi Zhang

Published May 30, 2023• 1 citation
Publisher

Abstract

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.

DOI
10.1360/scm-2022-0045

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•7 citations

Hermitian tensor and quantum mixed state

Guyan Ni

An order $2m$ complex tensor $\cH$ is said to be Hermitian if \[\mathcal{H}_\ijm=\mathcal{H}_\jim ^*\mathrm{\ for\ all\ }\ijm .\] It can be regarded as an extension of Hermitian matrix to higher order. A Hermitian tensor is also seen as a representation of a quantum mixed state. Motivated by the separability discrimination of quantum states, we investigate properties of Hermitian tensors including: unitary similarity relation, partial traces, nonnegative Hermitian tensors, Hermitian eigenvalues, rank-one Hermitian decomposition and positive Hermitian decomposition, and their applications to quantum states.

arXiv:1902.02640•Feb 5, 2019•25 citations

Separability discrimination and decomposition of m -partite quantum mixed states

Ying Li, Guyan Ni

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.

arXiv:1912.08985•Physical Review A•Jul 6, 2020•15 citations

Hermitian Tensors

Guyan Ni

An order $2m$ complex tensor $\cH$ is said to be Hermitian if \[\mathcal{H}_\ijm=\mathcal{H}_\jim ^*\mathrm{ for all }\ijm .\] It can be regarded as an extension of Hermitian matrix to higher order. A Hermitian tensor is also seen as a representation of a quantum mixed state. Motivated by the separability discrimination of quantum states, we investigate properties of Hermitian tensors including: unitary similarity relation, partial traces, nonnegative Hermitian tensors, Hermitian eigenvalues, rank-one Hermitian decomposition and positive Hermitian decomposition, and their applications to quantum states.

•Feb 5, 2019•0 citations

Separability of Hermitian tensors and PSD decompositions

Mareike Dressler, Jiawang Nie, Zi Yang

Hermitian tensors are natural generalizations of Hermitian matrices, while possessing rather different properties. A Hermitian tensor is separable if it has a Hermitian decomposition with only positive coefficients, i.e. it is a sum of rank-1 psd Hermitian tensors. This paper studies how to detect the separability of Hermitian tensors. It is equivalent to the long-standing quantum separability problem in quantum physics, which asks to tell if a given quantum state is entangled or not. We formulate this as a truncated moment problem and then provide a semidefinite relaxation algorithm to solve it. Moreover, we study psd decompositions of separable Hermitian tensors. When the psd rank is low, we first flatten them into cubic order tensors and then apply tensor decomposition methods to compute psd decompositions. We prove that this method works well if the psd rank is low. In computation, this flattening approach can detect the separability for much larger-sized Hermitian tensors. This method is a good starting point to determine psd ranks of separable Hermitian tensors.

arXiv:2011.08132•Linear and Multilinear Algebra•Aug 27, 2021•11 citations

Approximate tensor decompositions: Disappearance of many separations

Gemma De las Cuevas, Andreas Klingler, Tim Netzer

It is well known that tensor decompositions show separations, that is, constraints on local terms (such as positivity) may entail an arbitrarily high cost in their representation. Here, we show that many of these separations disappear in the approximate case. Specifically, for every approximation error ɛ and norm, we define the approximate rank as the minimum rank of an element in the ɛ-ball with respect to that norm. For positive semidefinite matrices, we show that the separations between rank, purification rank, and separable rank disappear for a large class of Schatten p-norms. For non-negative tensors, we show that the separations between rank, positive semidefinite rank, and non-negative rank disappear for all ℓp-norms with p > 1. For the trace norm (p = 1), we obtain upper bounds that depend on the ambient dimension. We also provide a deterministic algorithm to obtain the approximate decomposition attaining our bounds. Our main tool is an approximate version of the Carathéodory theorem. Our results imply that many separations are not robust under small perturbations of the tensor, with implications in quantum many-body systems and communication complexity.

arXiv:2004.10219•Journal of Mathematical Physics•Sep 1, 2021•10 citations
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.
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.
An order 2m2m2m complex tensor $\cH$ is said to be Hermitian if \[\mathcal{H}_\ijm=\mathcal{H}_\jim ^*\mathrm{\ for\ all\ }\ijm .\] It can be regarded as an extension of Hermitian matrix to higher order. A Hermitian tensor is also seen as a representation of a quantum mixed state. Motivated by the separability discrimination of quantum states, we investigate properties of Hermitian tensors including: unitary similarity relation, partial traces, nonnegative Hermitian tensors, Hermitian eigenvalues, rank-one Hermitian decomposition and positive Hermitian decomposition, and their applications to quantum states.
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.
An order 2m2m2m complex tensor $\cH$ is said to be Hermitian if \[\mathcal{H}_\ijm=\mathcal{H}_\jim ^*\mathrm{ for all }\ijm .\] It can be regarded as an extension of Hermitian matrix to higher order. A Hermitian tensor is also seen as a representation of a quantum mixed state. Motivated by the separability discrimination of quantum states, we investigate properties of Hermitian tensors including: unitary similarity relation, partial traces, nonnegative Hermitian tensors, Hermitian eigenvalues, rank-one Hermitian decomposition and positive Hermitian decomposition, and their applications to quantum states.
Hermitian tensors are natural generalizations of Hermitian matrices, while possessing rather different properties. A Hermitian tensor is separable if it has a Hermitian decomposition with only positive coefficients, i.e. it is a sum of rank-1 psd Hermitian tensors. This paper studies how to detect the separability of Hermitian tensors. It is equivalent to the long-standing quantum separability problem in quantum physics, which asks to tell if a given quantum state is entangled or not. We formulate this as a truncated moment problem and then provide a semidefinite relaxation algorithm to solve it. Moreover, we study psd decompositions of separable Hermitian tensors. When the psd rank is low, we first flatten them into cubic order tensors and then apply tensor decomposition methods to compute psd decompositions. We prove that this method works well if the psd rank is low. In computation, this flattening approach can detect the separability for much larger-sized Hermitian tensors. This method is a good starting point to determine psd ranks of separable Hermitian tensors.
It is well known that tensor decompositions show separations, that is, constraints on local terms (such as positivity) may entail an arbitrarily high cost in their representation. Here, we show that many of these separations disappear in the approximate case. Specifically, for every approximation error ɛ and norm, we define the approximate rank as the minimum rank of an element in the ɛ-ball with respect to that norm. For positive semidefinite matrices, we show that the separations between rank, purification rank, and separable rank disappear for a large class of Schatten p-norms. For non-negative tensors, we show that the separations between rank, positive semidefinite rank, and non-negative rank disappear for all ℓp-norms with p > 1. For the trace norm (p = 1), we obtain upper bounds that depend on the ambient dimension. We also provide a deterministic algorithm to obtain the approximate decomposition attaining our bounds. Our main tool is an approximate version of the Carathéodory theorem. Our results imply that many separations are not robust under small perturbations of the tensor, with implications in quantum many-body systems and communication complexity.