Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.29471

Optimal entanglement criteria from trace invariants

Bivas Mallick, Aabhas Gulati, Ion Nechita

quant-phSubmitted Sep 24, 2026• Announced Sep 25, 2026• 1 citation
arXivHTMLPDF

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.

Little sign of AI-generated textAI use disclosedOverclaims
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

Related papers

Moment-based PPT criteria for random bipartite states

Cécilia Lancien, Kieran McShane

Moment-based relaxations of the positive partial transpose (PPT) criterion have been recently introduced, as a hierarchy of entanglement criteria involving only experimentally accessible quantities of a given bipartite state. The goal of this work is to study their typical detection performance on high-dimensional bipartite systems. Concretely, we investigate whether random bipartite mixed states on $\mathbb C^d\otimes\mathbb C^d$, obtained as the marginal over an environment $\mathbb C^s$ of a uniformly distributed pure state, generically satisfy or violate them. For each fixed level $m\in\mathbb N$ in this hierarchy of moment-based PPT criteria, we are able to identify a threshold environment dimension $s=λ_md^2$ at which the behavior of the associated random state switches from violating to satisfying it, with probability going to $1$ as $d$ grows. The proof combines combinatorics of permutations techniques to estimate the average value of moments of partially transposed random states and concentration of measure arguments to bound the probability of deviating from such average, when the underlying local dimension $d$ is large. We additionally need tools from the theory of Hankel determinant evaluation via orthogonal polynomials.

quant-pharXiv:2607.11369•Jul 14, 2026•0 citations

Complete entanglement detection using polynomial invariants

Thomas C. Fraser, Vjosa Blakaj, Roberto Rubboli +2 more

Existing methods for deciding whether a bipartite quantum state is separable or entangled typically fall into one of two categories: they are either complete but require access to an explicit density matrix followed by numerical optimization, or they can be evaluated directly by measuring the quantum system but are incomplete, in the sense that they cannot detect all forms of entanglement. In this work, we overcome both limitations in a unified framework. First, we bypass numerical optimization by deriving separability criteria in the form of universal bounds on tensor powers of separable states. We prove that these bounds are complete: every entangled state violates them for sufficiently large tensor powers. Second, we explicitly construct a corresponding complete family of nonlinear entanglement witnesses, which can detect all forms of entanglement without requiring an explicit density matrix. The witnesses we construct are moreover basis-independent, in the sense that they are invariant under conjugation by local unitaries. Altogether, our results expand the toolbox for entanglement detection in arbitrary local dimensions in a manifestly invariant way.

quant-pharXiv:2606.16712•Jun 16, 2026•2 citations

Optimal Entanglement Certification from Moments of the Partial Transpose

Xiao‐Dong Yu, Satoya Imai, Otfried Gühne

For the certification and benchmarking of medium-size quantum devices, efficient methods to characterize entanglement are needed. In this context, it has been shown that locally randomized measurements on a multiparticle quantum system can be used to obtain valuable information on the so-called moments of the partially transposed quantum state. This allows one to infer some separability properties of a state, but how to use the given information in an optimal and systematic manner has yet to be determined. We propose two general entanglement detection methods based on the moments of the partially transposed density matrix. The first method is based on the Hankel matrices and provides a family of entanglement criteria, of which the lowest order reduces to the known p_{3}-positive-partial-transpose criterion proposed in A. Elben et al. [Phys. Rev. Lett. 125, 200501 (2020)PRLTAO0031-900710.1103/PhysRevLett.125.200501]. The second method is optimal and gives necessary and sufficient conditions for entanglement based on some moments of the partially transposed density matrix.

arXiv:2103.06897•Physical Review Letters•Aug 4, 2021•79 citations

Rank-based entanglement detection for bound entangled states

Aabhas Gulati

We develop a new method for entanglement detection in bipartite quantum states by using the violation of the rank-1-generated property of matrices. The positive-semidefinite matrices form a convex cone that has extremal elements of rank 1. But, convex conic subsets resulting from the presence of linear constraints allow extremal elements of rank >= 2. The problem of deciding when a matrix is rank-1 generated, i.e, a sum of rank-1 positive-semidefinite (PSD) matrices, has been studied extensively in optimization theory. This rank-1 generated property acts as an entanglement criterion, and we use this property to find novel classes of PPT (Positive under partial transposition) entangled states. We do this by mapping some faces of PPT density matrices to convex cones that are not rank-1 generated. We show that all separable states map to a rank-1 generated matrix. In general, the same is not true for the corresponding mapping of PPT entangled states. We also extend this approach to construct PPT entangled edge states. Finally, we provide witnesses that detect violations of the rank-1 generated property.

arXiv:2506.11346•Physical Review A•Jan 2, 2026•2 citations

Entanglement in the Dicke subspace

Aabhas Gulati, Ion Nechita, Clément Pellegrini

We provide a complete mathematical theory for the entanglement of mixtures of Dicke states. These quantum states form an important subclass of bosonic states arising in the study of indistinguishable particles. We introduce a tensor-based parametrization where the diagonal entries of these states are encoded as a symmetric tensor, enabling a direct translation between entanglement properties and well-studied convex cones of tensors. Our results bridge multipartite entanglement theory with semialgebraic geometry and the theory of completely positive and copositive tensors. This dictionary maps separability to completely positive tensors, the PPT property to moment tensors, entanglement witnesses to copositive tensors, and decomposable witnesses to sum of squares tensors. Using this framework, we construct explicit PPT entangled states in three or more qutrits, disproving a recent conjecture. We establish that PPT entanglement exists for all multipartite systems with local dimension d >= 3 and n >= 3 parties. We also show that, for mixtures of Dicke states, the PPT condition with respect to the most balanced bipartition implies all other PPT conditions. We further connect bosonic extendibility of mixtures of Dicke states to the duals of known hierarchies for non-negative polynomials, such as the ones by Reznick and Polya. We thus provide semidefinite programming relaxations for separability and entanglement testing in the Dicke subspace.

quant-pharXiv:2602.15800•Quantum•Feb 18, 2026•4 citations

Non-negative symmetric polynomials and entangled Bosons

Bharath Hebbe Madhusudhana

The fundamental relation between quantum entanglement and convex algebraic geometry has unveiled a set of powerful tools, imported from the former to the study the latter. The space of separable mixed states is convex and so is the space of the corresponding observable values. Therefore, the problem of determining whether a set of observable values come from an entangled state is tantamount to checking for membership in a convex set, of a point with coordinates given by the set of observable values. Here, we use techniques from convex algebraic geometry to develop powerful criteria for entanglement in a many-body system of Bosonic atoms with a non-zero spin. The experimentally accessible observables are the spin expectation values <S_i> and <{S_i, S_j}> which, upon truncating at rank two, are 9 independent quantities. Recently, entanglement criteria in terms of 3 of these 9 quantities have been derived. We develop entanglement criteria using all of these 9 quantities. If we consider these numbers as coordinates of a point in a 9 dimensional space, those with a separable parent state lie within a convex region, also known as the moment cone. Therefore, the problem is to characterize this moment cone. Owing to the Bosonic exchange symmetry, this moment cone is the dual of the cone of non-negative symmetric polynomials. Together with a characterization of this cone, we also develop an entanglement criterion that is asymptotically tight, for large atom numbers.

•Sep 7, 2018•0 citations
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 mmm such moments thus becomes a dimension-free truncated moment problem, which we solve in closed form for m=2m = 2m=2 and relax to a semidefinite program of size O(m)O(m)O(m) for arbitrary mmm. The dual solutions are polynomial minorants of x\sqrt{x}x​ on [0,1][0,1][0,1], and two explicit families, binomial and L1L^1L1-weighted, yield hierarchies of separability inequalities. Finally, we compare the criteria against one another and on PPT entangled states.
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 π≥0\pi\geq0π≥0, πA≥π\pi_A\geq\piπA​≥π, πB≥π\pi_B\geq\piπB​≥π, and t2+π≥πA+πBt^2+\pi\geq\pi_A+\pi_Bt2+π≥πA​+πB​. It also proves extremality of the PSD inequality p1p3−p22≥0p_1p_3-p_2^2\geq0p1​p3​−p22​≥0 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 ⌈r12/r2⌉\lceil r_1^2/r_2\rceil⌈r12​/r2​⌉ nonzero singular values. Relaxing integer multiplicities to arbitrary measure weights yields an SDP with matrix sizes O(m)O(m)O(m); for two moments its value is r13/2/r2r_1^{3/2}/\sqrt{r_2}r13/2​/r2​​, equal to the discrete optimum exactly when r12/r2r_1^2/r_2r12​/r2​ 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×33\times33×3 PPT-entangled family is detected by two centered moments for exactly p>4/5p>4/5p>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.
Moment-based relaxations of the positive partial transpose (PPT) criterion have been recently introduced, as a hierarchy of entanglement criteria involving only experimentally accessible quantities of a given bipartite state. The goal of this work is to study their typical detection performance on high-dimensional bipartite systems. Concretely, we investigate whether random bipartite mixed states on Cd⊗Cd\mathbb C^d\otimes\mathbb C^dCd⊗Cd, obtained as the marginal over an environment Cs\mathbb C^sCs of a uniformly distributed pure state, generically satisfy or violate them. For each fixed level m∈Nm\in\mathbb Nm∈N in this hierarchy of moment-based PPT criteria, we are able to identify a threshold environment dimension s=λmd2s=λ_md^2s=λm​d2 at which the behavior of the associated random state switches from violating to satisfying it, with probability going to 111 as ddd grows. The proof combines combinatorics of permutations techniques to estimate the average value of moments of partially transposed random states and concentration of measure arguments to bound the probability of deviating from such average, when the underlying local dimension ddd is large. We additionally need tools from the theory of Hankel determinant evaluation via orthogonal polynomials.
Existing methods for deciding whether a bipartite quantum state is separable or entangled typically fall into one of two categories: they are either complete but require access to an explicit density matrix followed by numerical optimization, or they can be evaluated directly by measuring the quantum system but are incomplete, in the sense that they cannot detect all forms of entanglement. In this work, we overcome both limitations in a unified framework. First, we bypass numerical optimization by deriving separability criteria in the form of universal bounds on tensor powers of separable states. We prove that these bounds are complete: every entangled state violates them for sufficiently large tensor powers. Second, we explicitly construct a corresponding complete family of nonlinear entanglement witnesses, which can detect all forms of entanglement without requiring an explicit density matrix. The witnesses we construct are moreover basis-independent, in the sense that they are invariant under conjugation by local unitaries. Altogether, our results expand the toolbox for entanglement detection in arbitrary local dimensions in a manifestly invariant way.
For the certification and benchmarking of medium-size quantum devices, efficient methods to characterize entanglement are needed. In this context, it has been shown that locally randomized measurements on a multiparticle quantum system can be used to obtain valuable information on the so-called moments of the partially transposed quantum state. This allows one to infer some separability properties of a state, but how to use the given information in an optimal and systematic manner has yet to be determined. We propose two general entanglement detection methods based on the moments of the partially transposed density matrix. The first method is based on the Hankel matrices and provides a family of entanglement criteria, of which the lowest order reduces to the known p_{3}-positive-partial-transpose criterion proposed in A. Elben et al. [Phys. Rev. Lett. 125, 200501 (2020)PRLTAO0031-900710.1103/PhysRevLett.125.200501]. The second method is optimal and gives necessary and sufficient conditions for entanglement based on some moments of the partially transposed density matrix.
We develop a new method for entanglement detection in bipartite quantum states by using the violation of the rank-1-generated property of matrices. The positive-semidefinite matrices form a convex cone that has extremal elements of rank 1. But, convex conic subsets resulting from the presence of linear constraints allow extremal elements of rank >= 2. The problem of deciding when a matrix is rank-1 generated, i.e, a sum of rank-1 positive-semidefinite (PSD) matrices, has been studied extensively in optimization theory. This rank-1 generated property acts as an entanglement criterion, and we use this property to find novel classes of PPT (Positive under partial transposition) entangled states. We do this by mapping some faces of PPT density matrices to convex cones that are not rank-1 generated. We show that all separable states map to a rank-1 generated matrix. In general, the same is not true for the corresponding mapping of PPT entangled states. We also extend this approach to construct PPT entangled edge states. Finally, we provide witnesses that detect violations of the rank-1 generated property.
We provide a complete mathematical theory for the entanglement of mixtures of Dicke states. These quantum states form an important subclass of bosonic states arising in the study of indistinguishable particles. We introduce a tensor-based parametrization where the diagonal entries of these states are encoded as a symmetric tensor, enabling a direct translation between entanglement properties and well-studied convex cones of tensors. Our results bridge multipartite entanglement theory with semialgebraic geometry and the theory of completely positive and copositive tensors. This dictionary maps separability to completely positive tensors, the PPT property to moment tensors, entanglement witnesses to copositive tensors, and decomposable witnesses to sum of squares tensors. Using this framework, we construct explicit PPT entangled states in three or more qutrits, disproving a recent conjecture. We establish that PPT entanglement exists for all multipartite systems with local dimension d >= 3 and n >= 3 parties. We also show that, for mixtures of Dicke states, the PPT condition with respect to the most balanced bipartition implies all other PPT conditions. We further connect bosonic extendibility of mixtures of Dicke states to the duals of known hierarchies for non-negative polynomials, such as the ones by Reznick and Polya. We thus provide semidefinite programming relaxations for separability and entanglement testing in the Dicke subspace.
The fundamental relation between quantum entanglement and convex algebraic geometry has unveiled a set of powerful tools, imported from the former to the study the latter. The space of separable mixed states is convex and so is the space of the corresponding observable values. Therefore, the problem of determining whether a set of observable values come from an entangled state is tantamount to checking for membership in a convex set, of a point with coordinates given by the set of observable values. Here, we use techniques from convex algebraic geometry to develop powerful criteria for entanglement in a many-body system of Bosonic atoms with a non-zero spin. The experimentally accessible observables are the spin expectation values <S_i> and <{S_i, S_j}> which, upon truncating at rank two, are 9 independent quantities. Recently, entanglement criteria in terms of 3 of these 9 quantities have been derived. We develop entanglement criteria using all of these 9 quantities. If we consider these numbers as coordinates of a point in a 9 dimensional space, those with a separable parent state lie within a convex region, also known as the moment cone. Therefore, the problem is to characterize this moment cone. Owing to the Bosonic exchange symmetry, this moment cone is the dual of the cone of non-negative symmetric polynomials. Together with a characterization of this cone, we also develop an entanglement criterion that is asymptotically tight, for large atom numbers.