Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement
Preprint
Abstract
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 (Algorithm \ref{algo:1}) is given to compute the U-eigenvalues of non-symmetric complex tensors by means of symmetric embedding. Another algorithm, Algorithm \ref{algo: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.Keywords
All Related Versions
This publication has 37 references indexed in Scilit:
- On decompositions and approximations of conjugate partial-symmetric tensorsCalcolo, 2021
- Numerical computation methods of welding deformation and their application in bogie frame for high-speed trainsJournal of Manufacturing Processes, 2019
- Calculating Entanglement Eigenvalues for Nonsymmetric Quantum Pure States Based on the Jacobian Semidefinite Programming Relaxation MethodJournal of Optimization Theory and Applications, 2018
- Iterative algorithms for computing US- and U-eigenpairs of complex tensorsJournal of Computational and Applied Mathematics, 2017
- Computing Geometric Measure of Entanglement for Symmetric Pure States via the Jacobian SDP Relaxation TechniqueJournal of the Operations Research Society of China, 2016
- Spherical optimization with complex variablesfor computing US-eigenpairsComputational Optimization and Applications, 2016
- An adaptive gradient method for computing generalized tensor eigenpairsComputational Optimization and Applications, 2016
- A sequential subspace projection method for extreme Z‐eigenvalues of supersymmetric tensorsNumerical Linear Algebra with Applications, 2014
- Z-eigenvalue methods for a global polynomial optimization problemMathematical Programming, 2007
- Die gegenw rtige Situation in der QuantenmechanikThe Science of Nature, 1935