Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement

• Published in: Computational optimization and applications Vol. 75; no. 3; pp. 779 - 798
• Main Authors: Zhang, Mengshi, Ni, Guyan, Zhang, Guofeng
• Format: Journal Article
• Language: English
• Published: New York Springer US 01-04-2020; Springer Nature B.V
• Subjects: Algorithms; Computation; Convex and Discrete Geometry; Eigenvalues; Embedding; Gauss-Seidel method; Iterative methods; Management Science; Mathematical analysis; Mathematics; Mathematics and Statistics; Operations Research; Operations Research/Decision Theory; Optimization; Quantum entanglement; Quantum mechanics; Statistics; Tensors; Geometric measure of entanglement; Unitary eigenvalue; Iterative method; Complex tensor; 15A69; 15A18; 81P40
• ISSN: 0926-6003; 1573-2894
• DOI: 10.1007/s10589-019-00126-5

The purpose of this paper is to study the problem of computing unitary eigenvalues (U-eigenvalues) of non-symmetric complex tensors. By means of symmetric embedding of complex tensors, the relationship between U-eigenpairs of a non-symmetric complex tensor and unitary symmetric eigenpairs (US-eigenpairs) of its symmetric embedding tensor is established. An Algorithm 
3.1
is given to compute the U-eigenvalues of non-symmetric complex tensors by means of symmetric embedding. Another Algorithm 
3.2
, is proposed to directly compute the U-eigenvalues of non-symmetric complex tensors, without the aid of symmetric embedding. Finally, a tensor version of the well-known Gauss–Seidel method is developed. Efficiency of these three algorithms are compared by means of various numerical examples. These algorithms are applied to compute the geometric measure of entanglement of quantum multipartite non-symmetric pure states.