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

arXiv:1808.03864 · Mathematics of Computation

Spectral norm of a symmetric tensor and its computation

Shmuel Friedland, Li Wang

Published May 7, 2020• 17 citations
arXivHTMLPDF

Abstract

We show that the spectral norm of a d d -mode real or complex symmetric tensor in n n variables can be computed by finding the fixed points of the corresponding polynomial map. For a generic complex symmetric tensor the number of fixed points is finite, and we give upper and lower bounds for the number of fixed points. For n = 2 n=2 we show that these fixed points are the roots of a corresponding univariate polynomial of degree at most ( d − 1 ) 2 + 1 (d-1)^2+1 , except certain cases, which are completely analyzed. In particular, for n = 2 n=2 the spectral norm of d d -symmetric tensor is polynomially computable in d d with a given relative precision. For a fixed n > 2 n>2 we show that the spectral norm of a d d -mode symmetric tensor is polynomially computable in d d with a given relative precision with respect to the Hilbert-Schmidt norm of the tensor. These results show that the geometric measure of entanglement of d d -mode symmetric qunits on C n \mathbb {C}^n are polynomially computable for a fixed n n .

DOI
10.1090/mcom/3525

Related papers

Geometric measure of entanglement of symmetric d-qubits is polynomial-time computable

Shmuel Friedland, Wang, Li

We give a simple formula for finding the spectral norm of d-mode symmetric tensor in two variables over the complex or real numbers in terms of the complex or real roots of a corresponding polynomial in one complex variable. This result implies that the geometric measure of entanglement of symmetric d-qubits is polynomial-time computable. We discuss a generalization to d-mode symmetric tensor in more than two variables.

arXiv:1608.01354•Aug 3, 2016•4 citations

The Quantum Eigenvalue Problem and Z-Eigenvalues of Tensors

Xinzhen Zhang, Liqun Qi

The quantum eigenvalue problem arises in the study of the geometric measure of the quantum entanglement. In this paper, we convert the quantum eigenvalue problem to the Z-eigenvalue problem of a real symmetric tensor. In this way, the theory and algorithms for Z-eigenvalues can be applied to the quantum eigenvalue problem. In particular, this gives an upper bound for the number of quantum eigenvalues. We show that the quantum eigenvalues appear in pairs, i.e., if a real number $λ$ is a quantum eigenvalue of a square symmetric tensor $Ψ$, then $-λ$ is also a quantum eigenvalue of $Ψ$. When $Ψ$ is real, we show that the entanglement eigenvalue of $Ψ$ is always greater than or equal to the Z-spectral radius of $Ψ$, and that in several cases the equality holds. We also show that the ratio between the entanglement eigenvalue and the Z-spectral radius of a real symmetric tensor is bounded above in a real symmetric tensor space of fixed order and dimension.

arXiv:1205.1342•May 7, 2012•6 citations

Highly entangled tensors

Harm Derksen, Visu Makam

A geometric measure for the entanglement of a unit length tensor T∈(Cn)⊗k is given by −2log2⁡∥T∥σ, where ∥⋅∥σ denotes the spectral norm. A simple induction gives an upper bound of (k−1)log2⁡(n) for the entanglement. We show the existence of tensors with entanglement larger than klog2⁡(n)−log2⁡(k)−o(log2⁡(k)). Friedland and Kemp (Proc. AMS, 2018) have similar results in the case of symmetric tensors. Our techniques give improvements in this case.

arXiv:1803.09788•Linear and Multilinear Algebra•Feb 13, 2020•8 citations

Geometric Measure of Entanglement and U-Eigenvalues of Tensors

Guyan Ni, Liqun Qi, Minru Bai

We study tensor analysis problems motivated by the geometric measure of quantum entanglement. We define the concept of the unitary eigenvalue (U-eigenvalue) of a complex tensor, the unitary symmetric eigenvalue (US-eigenvalue) of a symmetric complex tensor, and the best complex rank-one approximation. We obtain an upper bound on the number of distinct US-eigenvalues of symmetric tensors and count all US-eigenpairs with nonzero eigenvalues of symmetric tensors. We convert the geometric measure of the entanglement problem to an algebraic equation system problem. A numerical example shows that a symmetric real tensor may have a best complex rank-one approximation that is better than its best real rank-one approximation, which implies that the absolute-value largest Z-eigenvalue is not always the geometric measure of entanglement.

SIAM Journal on Matrix Analysis and Applications•Jan 1, 2014•45 citations

Injective norm of real and complex random tensors I: From spin glasses to geometric entanglement

Stéphane Dartois, Benjamin McKenna

The injective norm is a natural generalization to tensors of the operator norm of a matrix. In quantum information, the injective norm is one important measure of genuine multipartite entanglement of quantum states, where it is known as the geometric entanglement. In this paper, we give a high-probability upper bound on the injective norm of real and complex Gaussian random tensors, corresponding to a lower bound on the geometric entanglement of random quantum states, and to a bound on the ground-state energy of a particular multispecies spherical spin glass model. For some cases of our model, previous work used $ε$-net techniques to identify the correct order of magnitude; in the present work, we use the Kac--Rice formula to give a one-sided bound on the constant which we believe to be tight.

arXiv:2404.03627•Apr 4, 2024•31 citations

A moment-based approach to the injective norm of random tensors

Stephane Dartois, Benjamin McKenna

In this paper, we present a technically simple method to establish upper bounds on the expected injective norm of real and complex random tensors. Our approach is somewhat analogous to the moment method in random matrix theory, and is based on a deterministic upper bound on the injective norm of a tensor which might be of independent interest. Compared to previous approaches to these problems (spin-glass methods, epsilon-net techniques, Sudakov-Fernique arguments, and PAC-Bayesian proofs), our method has the benefit of being nonasymptotic, relatively elementary, and applicable to non-Gaussian models. We illustrate our approach on various models of random tensors, recovering some previously known (and conjecturally tight) bounds with simpler arguments, and presenting new bounds, some of which are provably tight. From the perspective of statistical physics, our results yield rigorous estimates on the ground-state energy of real and complex, possibly non-Gaussian, spin glass models. From the perspective of quantum information, they establish bounds on the geometric entanglement of random bosonic states and of random states with bounded multipartite Schmidt rank, both in the thermodynamic limits as well as the regimes of large local dimensions.

math.PRCross-listedarXiv:2603.01342•Mar 3, 2026•4 citations
We show that the spectral norm of a d d -mode real or complex symmetric tensor in n n variables can be computed by finding the fixed points of the corresponding polynomial map. For a generic complex symmetric tensor the number of fixed points is finite, and we give upper and lower bounds for the number of fixed points. For n = 2 n=2 we show that these fixed points are the roots of a corresponding univariate polynomial of degree at most ( d − 1 ) 2 + 1 (d-1)^2+1 , except certain cases, which are completely analyzed. In particular, for n = 2 n=2 the spectral norm of d d -symmetric tensor is polynomially computable in d d with a given relative precision. For a fixed n > 2 n>2 we show that the spectral norm of a d d -mode symmetric tensor is polynomially computable in d d with a given relative precision with respect to the Hilbert-Schmidt norm of the tensor. These results show that the geometric measure of entanglement of d d -mode symmetric qunits on C n \mathbb {C}^n are polynomially computable for a fixed n n .
The quantum eigenvalue problem arises in the study of the geometric measure of the quantum entanglement. In this paper, we convert the quantum eigenvalue problem to the Z-eigenvalue problem of a real symmetric tensor. In this way, the theory and algorithms for Z-eigenvalues can be applied to the quantum eigenvalue problem. In particular, this gives an upper bound for the number of quantum eigenvalues. We show that the quantum eigenvalues appear in pairs, i.e., if a real number λλλ is a quantum eigenvalue of a square symmetric tensor ΨΨΨ, then −λ-λ−λ is also a quantum eigenvalue of ΨΨΨ. When ΨΨΨ is real, we show that the entanglement eigenvalue of ΨΨΨ is always greater than or equal to the Z-spectral radius of ΨΨΨ, and that in several cases the equality holds. We also show that the ratio between the entanglement eigenvalue and the Z-spectral radius of a real symmetric tensor is bounded above in a real symmetric tensor space of fixed order and dimension.
We study tensor analysis problems motivated by the geometric measure of quantum entanglement. We define the concept of the unitary eigenvalue (U-eigenvalue) of a complex tensor, the unitary symmetric eigenvalue (US-eigenvalue) of a symmetric complex tensor, and the best complex rank-one approximation. We obtain an upper bound on the number of distinct US-eigenvalues of symmetric tensors and count all US-eigenpairs with nonzero eigenvalues of symmetric tensors. We convert the geometric measure of the entanglement problem to an algebraic equation system problem. A numerical example shows that a symmetric real tensor may have a best complex rank-one approximation that is better than its best real rank-one approximation, which implies that the absolute-value largest Z-eigenvalue is not always the geometric measure of entanglement.
The injective norm is a natural generalization to tensors of the operator norm of a matrix. In quantum information, the injective norm is one important measure of genuine multipartite entanglement of quantum states, where it is known as the geometric entanglement. In this paper, we give a high-probability upper bound on the injective norm of real and complex Gaussian random tensors, corresponding to a lower bound on the geometric entanglement of random quantum states, and to a bound on the ground-state energy of a particular multispecies spherical spin glass model. For some cases of our model, previous work used εεε-net techniques to identify the correct order of magnitude; in the present work, we use the Kac--Rice formula to give a one-sided bound on the constant which we believe to be tight.
In this paper, we present a technically simple method to establish upper bounds on the expected injective norm of real and complex random tensors. Our approach is somewhat analogous to the moment method in random matrix theory, and is based on a deterministic upper bound on the injective norm of a tensor which might be of independent interest. Compared to previous approaches to these problems (spin-glass methods, epsilon-net techniques, Sudakov-Fernique arguments, and PAC-Bayesian proofs), our method has the benefit of being nonasymptotic, relatively elementary, and applicable to non-Gaussian models. We illustrate our approach on various models of random tensors, recovering some previously known (and conjecturally tight) bounds with simpler arguments, and presenting new bounds, some of which are provably tight. From the perspective of statistical physics, our results yield rigorous estimates on the ground-state energy of real and complex, possibly non-Gaussian, spin glass models. From the perspective of quantum information, they establish bounds on the geometric entanglement of random bosonic states and of random states with bounded multipartite Schmidt rank, both in the thermodynamic limits as well as the regimes of large local dimensions.