The Product Structure of Matrix Product States under Permutations
Bibliographic record
Abstract
Tensor network methods have proved to be highly effective in addressing a wide variety of physical scenarios, including those lacking an intrinsic one-dimensional geometry. In such contexts, it is possible for the problem to exhibit a weak form of permutational symmetry, in the sense that entanglement behaves similarly across any arbitrary bipartition. In this paper, we show that translationally-invariant (TI) matrix product states (MPSs) with this property are trivial, meaning that they are either product states or superpositions of a few of them. The results also apply to non-TI generic MPSs, as well as further relevant examples of MPSs including the <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline"> <a:mi>W</a:mi> </a:math> state and the Dicke states in an approximate sense. Our findings motivate the usage of Ansätze simpler than tensor networks in systems whose structure is invariant under permutations.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".