Polynomial-time computation of fixed points and spectral norms for nonsingular symmetric tensors
Polynomial-time computation of fixed points and spectral norms for nonsingular symmetric tensors
Fix with , and let be nonsingular. Let denote the polynomial map whose fixed points are used to compute the spectral norm of . Nonsingular fixed-point computation conjecture. With probability , all fixed points of can be found within approximation in time polynomial in ; in particular, can be computed within approximation in time polynomial in , with probability . The conjecture arises from applying homotopy methods to the fixed points associated with a nonsingular tensor. It remains open in the supplied text.
Sources & referencesView supporting material
Primary source
Shmuel Friedland and Li Wang, “Geometric measure of entanglement of symmetric d-qubits is polynomial-time computable”, arXiv:1608.01354 (2017).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.