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

arXiv: https://arxiv.org/abs/1901.09510 · HTML: https://mlsanity.com/paper/1901.09510/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 28 Jan 2019.

## Built on by (most cited first, 1 of 1)

- [Detecting quantum entanglement with unsupervised learning](https://mlsanity.com/paper/2103.04804/) (2021)

## Abstract (arXiv)

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 refalgo:1) is given to compute the U-eigenvalues of non-symmetric complex tensors by means of symmetric embedding. Another algorithm, Algorithm refalgo: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.