Dimensions, lengths, and separability in finite-dimensional quantum systems
Bibliographic record
Abstract
Many important sets of normalized states in a multipartite quantum system of finite dimension d, such as the set \documentclass[12pt]{minimal}\begin{document}${\cal S}$\end{document}S of all separable states, are real semialgebraic sets. We compute dimensions of many such sets in several low-dimensional systems. By using dimension arguments, we show that there exist separable states which are not convex combinations of d or less pure product states. For instance, such states exist in bipartite M⊗N systems when (M − 2)(N − 2) > 1. This solves an open problem proposed by DiVincenzo, Terhal and Thapliyal about 12 years ago. We prove that there exist a separable state ρ and a pure product state, whose mixture has smaller length than that of ρ. We show that any real \documentclass[12pt]{minimal}\begin{document}$\rho \in {\cal S}$\end{document}ρ∈S, which is invariant under all partial transpose operations, is a convex sum of real pure product states. In the case of the 2⊗N system, the number r of product states can be taken to be \documentclass[12pt]{minimal}\begin{document}$r=\mathop {\rm rank}\rho$\end{document}r= rank ρ. We also show that the general multipartite separability problem can be reduced to the case of real states. Regarding the separability problem, we propose two conjectures describing \documentclass[12pt]{minimal}\begin{document}${\cal S}$\end{document}S as a semialgebraic set, which may eventually lead to an analytic solution in some low-dimensional systems such as 2⊗4, 3⊗3, and 2⊗2⊗2.
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.001 | 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.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".