arXiv:2609.29471
Optimal entanglement criteria from trace invariants
Bivas Mallick, Aabhas Gulati, Ion Nechita
Abstract
Randomized measurement protocols give experimental access to low-degree polynomial invariants of a quantum state rather than to the state itself, which raises the question of what the best entanglement criterion is that can be built from finitely many such invariants. In this work we answer this question through convex duality. For each degree we introduce the cone of local unitary trace inequalities that are valid for separable bipartite states in all local dimensions, together with its one-matrix counterparts for Hermitian and positive semidefinite matrices. Each cone is the polar dual of a moment cone; we also determine the minimal combinatorial parametrization of the separable cone. The framework organizes the known moment criteria: the PPT criterion using the first three moments of the partial transposition is the image under an embedding of a Hankel determinant from the positive semidefinite cone to the bipartite cone, which we show to be an extremal ray, and we determine the first nontrivial separable cone completely, finding exactly four extremal rays. The framework allows us to analyze the realignment criterion and its centered (or enhanced) variant. We prove that the even singular value moments of the (centered) realignment matrix are trace invariants, associated with explicit fixed-point-free involutions. Extracting the optimal trace-norm bound from $m$ such moments thus becomes a dimension-free truncated moment problem, which we solve in closed form for $m = 2$ and relax to a semidefinite program of size $O(m)$ for arbitrary $m$. The dual solutions are polynomial minorants of $\sqrt{x}$ on $[0,1]$, and two explicit families, binomial and $L^1$-weighted, yield hierarchies of separability inequalities. Finally, we compare the criteria against one another and on PPT entangled states.
AI Summary
The paper asks which dimension-independent entanglement tests can be extracted from finitely many local-unitary trace invariants, motivated by randomized measurements. It defines cones of homogeneous inequalities valid for separable bipartite states, alongside Hermitian and positive-semidefinite one-matrix analogues, and identifies their dual moment cones. Using permutation contractions and convex geometry, it determines minimal coordinates for the real-valued bipartite invariants and completely characterizes the degree-two separability cone: its four extremal inequalities are $\pi\geq0$, $\pi_A\geq\pi$, $\pi_B\geq\pi$, and $t^2+\pi\geq\pi_A+\pi_B$. It also proves extremality of the PSD inequality $p_1p_3-p_2^2\geq0$ underlying the three-moment PPT test. Even realignment singular-value moments are expressed as trace invariants, with centered moments obtained by expansion. Minimizing the trace norm compatible with these moments gives an exact two-moment bound, attained with $\lceil r_1^2/r_2\rceil$ nonzero singular values. Relaxing integer multiplicities to arbitrary measure weights yields an SDP with matrix sizes $O(m)$; for two moments its value is $r_1^{3/2}/\sqrt{r_2}$, equal to the discrete optimum exactly when $r_1^2/r_2$ is integral. Dual polynomial minorants generate explicit witness families. Comparisons show that three-moment PPT detection contains standard two-moment realignment interpolation detection. A constructed $3\times3$ PPT-entangled family is detected by two centered moments for exactly $p>4/5$, matching enhanced realignment. Optimality concerns compatibility with the realignment trace-norm bound, not separability itself. General discrete optimization remains unresolved; multipartite extensions are deferred. Some explicit minorant tests require high moment orders.
Large language models suggested the $L^1$-weighted minorants and some ideas in the corresponding proofs, in particular the reference \cite{sakai2017sharp} in Appendix~\ref{sec:proof-1-norm}.
Central claim may not hold: The abstract's opening promise of the best entanglement criterion from finitely many invariants exceeds the results: general separability inequalities receive an abstract dual-cone characterization, while explicit optimality is established only for the restricted realignment compatibility problem with at most two moments. The introduction's unqualified promise to determine precisely when the relaxation is tight is supported only for the two-moment problem, not for arbitrary numbers of moments.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 53 pages, comments welcome