Spectral norm of a symmetric tensor and its computation

DOI10.1090/MCOM/3525MaRDI QIDQ5113665zbMATH OpenOpenAlexFDO

Authors Li Wang, S. Friedland

Publication date 15 June 2020

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1808.03864

zbMATH Keywords

spectral normentanglementhomogeneous polynomialssymmetric tensors\(d\)-mode symmetric qubits\(d\)-mode symmetric qunitsanti-fixed and fixed pointscomputation of spectral norm

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Symbolic computation and algebraic computation (68W30) Quantum coherence, entanglement, quantum correlations (81P40) Numerical computation of roots of polynomial equations (65H04) Solving polynomial systems; resultants (13P15)

Abstract: We show that the spectral norm of a $d$-mode real or complex symmetric tensor in $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$ we show that these fixed points are the roots of a corresponding univariate polynomial of degree at most $(d-1{)}^2+1$, except certain cases, which are completely analyzed. In particular, for $n=2$ the spectral norm of $d$-symmetric tensor is polynomially computable in $d$ with a given relative precision. For a fixed $n>2$ we show that the spectral norm of a $d$-mode symmetric tensor is polynomially computable in $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$-mode symmetric qunits on $mathbb{C}^n$ are polynomially computable for a fixed $n$.

Recommendations

• Symmetric tensor nuclear norms
• Highly entangled tensors
• Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement
• All real eigenvalues of symmetric tensors
• Geometric measure of entanglement and U-eigenvalues of tensors

Cites work

• scientific article; zbMATH DE number 3126031 (Why is no real title available?)
• scientific article; zbMATH DE number 575960 (Why is no real title available?)
• scientific article; zbMATH DE number 1952043 (Why is no real title available?)
• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• scientific article; zbMATH DE number 3023350 (Why is no real title available?)
• scientific article; zbMATH DE number 3058859 (Why is no real title available?)
• An efficient algorithm for the complex roots problem
• Best rank one approximation of real symmetric tensors can be chosen symmetric
• Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
• Coherence in Spontaneous Radiation Processes
• Computation of the geometric measure of entanglement for pure multiqubit states
• Definability and fast quantifier elimination in algebraically closed fields
• Efficient computation of the characteristic polynomial
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
• Geometry of Quantum States
• How entangled can two couples get?
• Inverse eigenvalue problems
• Low-rank approximation of tensors
• Matrices. Algebra, analysis and applications
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Maximum block improvement and polynomial optimization
• Most boson quantum states are almost maximally entangled
• Most tensor problems are NP-hard
• Multicorns are not path connected
• Nuclear norm of higher-order tensors
• On best rank one approximation of tensors
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• On the complexity of the \(F_5\) Gröbner basis algorithm
• Random matrices and complexity of spin glasses
• Rank-one approximation to high order tensors
• Real algebraic sets
• Reducibility among combinatorial problems
• Semidefinite relaxations for best rank-1 tensor approximations
• Solving zero-dimensional systems through the rational univariate representation
• Sparse Rational Univariate Representation
• Sums of even powers of real linear forms
• The computational complexity of linear optics
• The maximally entangled symmetric state in terms of the geometric measure
• The number of eigenvalues of a tensor
• The number of singular vector tuples and uniqueness of best rank-one approximation of tensors
• The tensor rank of tensor product of two three-qubit W states is eight
• Unique Arrangements of Points on a Sphere
• Über homogene Polynome in ($L^{2}$)

Cited in

(9)

• On semidefinite programming characterizations of the numerical radius and its dual norm
• On the tensor spectral \(\mathbf{p}\)-norm and its higher order power method
• Rank of a tensor and quantum entanglement
• Spectral inequalities for nonnegative tensors and their tropical analogues
• Quantum version of Euler's problem: a geometric perspective
• The relation between a tensor and its associated semi-symmetric form
• On the averaging of symmetric positive-definite tensors
• On the complexity of finding tensor ranks
• Large-sample properties of unsupervised estimation of the linear discriminant using projection pursuit

Describes a project that uses

Uses Software

• ISOLATE
• Bertini

This page was built for publication: Spectral norm of a symmetric tensor and its computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113665)