A new bound on the rank of tensor product of W-states
S. Canino, A. Casarotti, P. Santarsiero

TL;DR
This paper establishes a new upper bound on the tensor rank of tensor products of W-states, improving previous bounds and providing explicit decompositions, which advances understanding of tensor complexity in quantum information.
Contribution
It introduces a tighter upper bound on the tensor and partially symmetric rank of tensor products of W-states, along with explicit decompositions achieving this bound.
Findings
New upper bound on tensor rank of W-state tensor products
Explicit decomposition achieving the bound
Improvement over previous bounds by a factor of 2^k(k-1)
Abstract
A W-state is an order d symmetric tensor of the form W_d=x^{d-1}y. We prove that the partially symmetric rank of W_{d_1}\otimes \cdots \otimes W_{d_k} is at most 2^{k-1}(d_1+\cdots +d_k-2k+2). The same bound holds for the tensor rank and it is an improvement of 2^k(k-1) over the best known bound. Moreover, we provide an explicit partially symmetric decomposition achieving this bound.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications · Complexity and Algorithms in Graphs · Quantum Computing Algorithms and Architecture
