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

Hermitian Tensors

Guyan Ni

Published Feb 5, 2019• 0 citations
OpenAlex

Abstract

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.

Related papers

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

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

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

Tensor Fields on Orbits of Quantum States and Applications

G. F. Volkert

On classical Lie groups, which act by means of a unitary representation on finite dimensional Hilbert spaces H, we identify two classes of tensor field constructions. First, as pull-back tensor fields of order two from modified Hermitian tensor fields, constructed on Hilbert spaces by means of the property of having the vertical distributions of the C_0-principal bundle H_0 over the projective Hilbert space P(H) in the kernel. And second, directly constructed on the Lie group, as left-invariant representation-dependent operator-valued tensor fields (LIROVTs) of arbitrary order being evaluated on a quantum state. Within the NP-hard problem of deciding whether a given state in a n-level bi-partite quantum system is entangled or separable (Gurvits, 2003), we show that both tensor field constructions admit a geometric approach to this problem, which evades the traditional ambiguity on defining metrical structures on the convex set of mixed states. In particular by considering manifolds associated to orbits passing through a selected state when acted upon by the local unitary group U(n)xU(n) of Schmidt coefficient decomposition inducing transformations, we find the following results: In the case of pure states we show that Schmidt-equivalence classes which are Lagrangian submanifolds define maximal entangled states. This implies a stronger statement as the one proposed by Bengtsson (2007). Moreover, Riemannian pull-back tensor fields split on orbits of separable states and provide a quantitative characterization of entanglement which recover the entanglement measure proposed by Schlienz and Mahler (1995). In the case of mixed states we highlight a relation between LIROVTs of order two and a class of computable separability criteria based on the Bloch-representation (de Vicente, 2007).

•Jan 1, 2010•3 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

The Role of Tensor-Generated Matrices in Analyzing Spin State Classicality and Tensor H-Eigenvalue Distributions

Liang Xiong, Jianzhou Liu

Multipartite quantum scenarios are a significant and challenging resource in quantum information science. Tensors provide a powerful framework for representing multipartite quantum systems. In this work, we introduce the role of tensor-generated matrices that can broadly be defined as the relationships between an $m$-th order $n$-dimensional tensor and an $n$-dimensional square matrix. Through these established connections, we demonstrate that the classification of the tensor-generated matrix as an $H$-matrix implies the original tensor is also an $H$-tensor. We also explore various similar properties exhibited by both the original tensor and the tensor-generated matrix, including weak irreducibility, weakly chained diagonal dominance, and (strong) symmetry. These findings provide a method to transform intricate tensor problems into matrices in specific contexts, which is especially pertinent due to the NP-hard complexity of the majority of tensor problems. Subsequently, we explore the application of tensor-generated matrices in analyzing the classicality of spin states. Leveraging the tensor representation, we introduce classicality criteria for (strongly) symmetric spin-$j$ states, which potentially provide fresh perspectives on the study of multipartite quantum resources. Finally, we extend classical matrix eigenvalue inclusion sets to higher-order tensor $H$-eigenvalues, a task that is typically challenging for higher-order tensors. Consequently, we propose representative tensor $H$-eigenvalue inclusion sets, such as modified Brauer's Ovals of Cassini sets, Ostrowski sets, and $S$-type inclusion sets.

arXiv:2410.18592•Oct 24, 2024•1 citation
An order 2m2m2m complex tensor \cH\cH\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.
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.
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.
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.
On classical Lie groups, which act by means of a unitary representation on finite dimensional Hilbert spaces H, we identify two classes of tensor field constructions. First, as pull-back tensor fields of order two from modified Hermitian tensor fields, constructed on Hilbert spaces by means of the property of having the vertical distributions of the C_0-principal bundle H_0 over the projective Hilbert space P(H) in the kernel. And second, directly constructed on the Lie group, as left-invariant representation-dependent operator-valued tensor fields (LIROVTs) of arbitrary order being evaluated on a quantum state. Within the NP-hard problem of deciding whether a given state in a n-level bi-partite quantum system is entangled or separable (Gurvits, 2003), we show that both tensor field constructions admit a geometric approach to this problem, which evades the traditional ambiguity on defining metrical structures on the convex set of mixed states. In particular by considering manifolds associated to orbits passing through a selected state when acted upon by the local unitary group U(n)xU(n) of Schmidt coefficient decomposition inducing transformations, we find the following results: In the case of pure states we show that Schmidt-equivalence classes which are Lagrangian submanifolds define maximal entangled states. This implies a stronger statement as the one proposed by Bengtsson (2007). Moreover, Riemannian pull-back tensor fields split on orbits of separable states and provide a quantitative characterization of entanglement which recover the entanglement measure proposed by Schlienz and Mahler (1995). In the case of mixed states we highlight a relation between LIROVTs of order two and a class of computable separability criteria based on the Bloch-representation (de Vicente, 2007).
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.
Multipartite quantum scenarios are a significant and challenging resource in quantum information science. Tensors provide a powerful framework for representing multipartite quantum systems. In this work, we introduce the role of tensor-generated matrices that can broadly be defined as the relationships between an mmm-th order nnn-dimensional tensor and an nnn-dimensional square matrix. Through these established connections, we demonstrate that the classification of the tensor-generated matrix as an HHH-matrix implies the original tensor is also an HHH-tensor. We also explore various similar properties exhibited by both the original tensor and the tensor-generated matrix, including weak irreducibility, weakly chained diagonal dominance, and (strong) symmetry. These findings provide a method to transform intricate tensor problems into matrices in specific contexts, which is especially pertinent due to the NP-hard complexity of the majority of tensor problems. Subsequently, we explore the application of tensor-generated matrices in analyzing the classicality of spin states. Leveraging the tensor representation, we introduce classicality criteria for (strongly) symmetric spin-jjj states, which potentially provide fresh perspectives on the study of multipartite quantum resources. Finally, we extend classical matrix eigenvalue inclusion sets to higher-order tensor HHH-eigenvalues, a task that is typically challenging for higher-order tensors. Consequently, we propose representative tensor HHH-eigenvalue inclusion sets, such as modified Brauer's Ovals of Cassini sets, Ostrowski sets, and SSS-type inclusion sets.