Spectral norm of a symmetric tensor and its computation

DOI10.1090/MCOM/3525zbMATH Open1452.15013arXiv1808.03864OpenAlexW3023388044MaRDI QIDQ5113665FDOQ5113665

S. Friedland, Li Wang

Publication date: 15 June 2020

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

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$.

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

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

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)

Cites Work

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

Cited In (9)

• The Relation Between a Tensor and Its Associated Semi-Symmetric Form
• 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
• 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

Uses Software

• Bertini
• ISOLATE

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)