arXiv:2609.39669
Separable decompositions of 2xn states with operator Schmidt rank three
Perrine Vantalon, Nicolas Macris
Abstract
We prove that every bipartite state $ρ$ of a qubit coupled to an $n$-level system whose operator Schmidt rank equals three can be written as a mixture of $\text{rank}(ρ)$ pure product states, and as a mixture of at most $n+1$ mixed product states in general. The second result is tight in the sense that there exist states that cannot be decomposed with a smaller number of terms. Our proof gives constructive methods to obtain the decompositions. It involves eigendecompositions of suitable unitary dilations of an operator explicitly determined by the state. Our framework recovers previously known results for the length of decompositions into pure product states and is also able to deal with decompositions into mixed states. For pure product states, our decomposition is different from existing ones.
AI Summary
The paper studies explicit separable decompositions of qubit–qudit states $\rho\in M_2\otimes M_n$ with operator Schmidt rank three. Separability of this class was already known; the focus is on constructing decompositions and bounding their lengths, distinguishing pure product terms from products of possibly mixed states. It gives an alternative constructive proof that the minimum number of pure product terms equals $\operatorname{rank}(\rho)$, recovering a known result. For mixed product terms, it establishes the tight bound $\operatorname{sr}(\rho)\le n+1$. A refinement bounds this by $\deg m_T+1$, where $m_T$ is the minimal polynomial of an associated contraction $T$. States constructed from the nilpotent shift require exactly $n+1$ terms. Consequences include recovering $\operatorname{sr}(\rho)=3$ for two-qubit states of operator Schmidt rank three. The construction uses invertible local filtering and support reduction to obtain a partial-transpose-invariant normal form with maximally mixed qudit marginal. Its correlations are encoded by $T=C_1+iC_3$, with positivity equivalent to $\|T\|\le1$. Spectral decompositions of unitary dilations then produce product decompositions: a defect-rank construction gives the optimal pure length, while compressed-shift dilation results give the mixed-term bound. Numerical ranges provide geometric containment criteria and tightness examples. The mixed-state construction generally supplies an upper bound, not the minimum length for an individual state. Numerical-range containment alone is not sufficient for a prescribed polygon beyond triangles. The channel interpretation yields measure-and-prepare implementations, with at most a one-bit reduction relative to the pure-term construction.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 28 pages, 6 figures