arXiv:2610.28162
Dimension-free marginal inequalities for pure three-party states
Simon Morelli
Abstract
The quantum marginal problem, concerned with the compatibility of local and global properties of a multipartite quantum system, is arguably one of the fundamental questions in quantum theory. In this article we introduce a novel family of inequalities bounding the allowed local spectra of a pure tripartite state. The number of inequalities in this family grows with the dimension of the system. Most importantly, the inequalities hold for arbitrary dimensions. For equal local dimension at most 4, they generate the complete set of eigenvalue inequalities.
AI Summary
The paper studies which triples of one-party spectra $(a,b,c)$ can arise from a pure tripartite state. Although this quantum marginal problem has a general representation-theoretic characterization, explicit facet inequalities become difficult to compute as local dimensions increase. The aim is to construct spectral constraints valid in arbitrary finite dimensions rather than separately for each dimension. The main result is a recursive procedure that lifts known inequalities into new ones using Horn inequalities. It removes the largest Schmidt component across one bipartition, applies a seed inequality to the remaining pure state, and controls the removed component through spectral monotonicity and partial-sum bounds. For example, every Horn triple $(I,J,K)$ gives $a_1-a_{J+1}+b_K-b_l-c_I+c_l\le m$, where $m$ is the state's squared norm, subscripts denote spectral sums, and $J+1$ shifts each index by one. The construction also yields necessary inequalities for nonzero Kronecker coefficients and dimension-independent extensions of the three-qutrit constraints. Computer-assisted exact calculations reportedly recover all 50 facet classes for equal local dimension four: 11 are trivial or first-row bounds, 32 require one lifting step, and seven require two. In dimension five, the procedure recovers 455 of 466 classes using at most two steps. For each remaining class, separating points certify that the recursive relaxation misses its constraint. Thus the construction is complete through dimension four but incomplete from dimension five onward; in general it supplies an outer approximation, not a full compatibility criterion.
Most of the technical parts of this work was done with Claude Opus 5.5.
Error found: The claimed completeness in dimension four depends on a reported exact computation for which the supplied paper provides neither reproducible computational materials nor explicit certificates covering the 50 facet classes.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 6 pages. This is a preliminary version. I would have liked to spend more time on the presentation of the results, but in this fast-moving times I prefer to upload a first version. Comments welcome