Regularly Decomposable Tensors and Classical Spin States
Liqun Qi, Guofeng Zhang, Daniel Braun, Fabian Bohnet-Waldraff, Olivier, Giraud

TL;DR
This paper introduces regularly decomposable tensors as a new mathematical tool to characterize classical spin states, establishing their properties, invariance, and duality with other tensor cones, with implications for quantum state analysis.
Contribution
It defines regularly decomposable tensors and proves their equivalence to classical spin states, expanding tensor theory and providing a new criterion for classicality detection.
Findings
Regularly decomposable tensors characterize classical spin states.
The tensor cones involved are closed convex cones and dual to each other.
Positive semi-definite programming can test classicality of spin states.
Abstract
A spin- state can be represented by a symmetric tensor of order and dimension . Here, can be a positive integer, which corresponds to a boson; can also be a positive half-integer, which corresponds to a fermion. In this paper, we introduce regularly decomposable tensors and show that a spin- state is classical if and only if its representing tensor is a regularly decomposable tensor. In the even-order case, a regularly decomposable tensor is a completely decomposable tensor but not vice versa; a completely decomposable tensors is a sum-of-squares (SOS) tensor but not vice versa; an SOS tensor is a positive semi-definite (PSD) tensor but not vice versa. In the odd-order case, the first row tensor of a regularly decomposable tensor is regularly decomposable and its other row tensors are induced by the regular decomposition of its first row tensor. We also show that…
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 · Matrix Theory and Algorithms · Quantum Computing Algorithms and Architecture
