Pith. sign in

REVIEW 2 major objections 3 minor 2 cited by

This paper establishes an exact dictionary mapping separability, PPT, entanglement witnesses, and decomposability of Dicke-state mixtures to completely positive, moment, copositive, and sum-of-squares tensor cones, and proves PPT-entangled

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · deepseek-v4-flash

2026-08-02 22:47 UTC pith:KFY5QYDM

load-bearing objection Substantial, mostly rigorous dictionary for entanglement in the Dicke subspace; one explicit counterexample rests on an unreported numerical search and needs fixing, but the core math is solid and deserves review. the 2 major comments →

arxiv 2602.15800 v2 pith:KFY5QYDM submitted 2026-02-17 quant-ph math-phmath.MP

Entanglement in the Dicke subspace

Aabhas Gulati , Ion Nechita , Cl\'ement Pellegrini This is my paper
classification quant-ph math-phmath.MP MSC 81P4015A6990C2214P10
keywords mixtures of Dicke statesdiagonally symmetric subspacePPT entanglementcompletely positive tensorscopositive tensorssum of squares polynomialsmoment tensorsbosonic extendibility
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper develops a complete mathematical dictionary between the entanglement properties of mixtures of Dicke states (bosonic states with diagonal symmetry) and well-studied convex cones of real symmetric tensors. Using a parametrization by the state's diagonal entries, it shows that separability is exactly complete positivity of the tensor, the PPT condition exactly moment-tensor positivity, entanglement witnesses exactly copositivity, and decomposable witnesses exactly sum-of-squares. On this basis it constructs explicit PPT entangled states in three or more qutrits and proves such states exist for all local dimension d≥3 and n≥3 parties, disproving a recent conjecture that separability equals PPT in small dimensions. It also proves that the most balanced bipartition gives the strongest PPT criterion, and connects bosonic extendibility to classical hierarchies for non-negative polynomials, yielding semidefinite programming relaxations for separability and entanglement testing.

Core claim

For a diagonally symmetric (DS) bosonic matrix X, the paper defines the symmetric tensor Q[X] by its diagonal entries Q[X]i = ⟨i|X|i⟩, and the companion tensor W[X]i = (n choose γ(i)) Q[X]i. The central discovery is a set of exact equivalences: X is separable iff Q[X] is a completely positive tensor; X is PPT across the k-th bipartition iff the even slice-flattenings of Q[X] are positive semidefinite (a moment tensor); an operator O is an entanglement witness iff W[O] is copositive; and O is decomposable iff W[O] is a sum-of-squares tensor. From these, the PPT condition across the most balanced bipartition implies all other PPT conditions, and there exist PPT entangled DS states for every d≥

What carries the argument

The central object is the tensor-based parametrization X ↦ Q[X] (diagonal entries of the DS state) and its weighted companion W[X], which make the Hilbert-Schmidt duality coincide with the Euclidean tensor inner product. The load-bearing identities are four exact cone correspondences: Sep ↔ CP, PPT ↔ Mom (slice-flattenings positive semidefinite), EW ↔ Cop, and Dec ↔ SOS. These connect quantum entanglement theory to real algebraic geometry and polynomial optimization, allowing classical examples of positive polynomials that are not sums of squares to produce indecomposable witnesses and PPT-entangled states.

Load-bearing premise

The explicit disproof of the separability-equals-PPT conjecture rests on the numerical optimization in Example 4.27, which concludes η⋆≈−0.02<0 without displaying a feasible (p,q,r) triple or any solver certificate; if that numerical value is wrong, the poster example collapses, although the polynomial-based induction might still establish existence independently.

What would settle it

Run the stated optimization (minimize 3p+3r−6q subject to p≥q≥r≥0, p(q+r)≥2q², 3p+18q+6r=1) with a certified SDP solver. If the optimal value is ≥0, then Example 4.27 does not provide a PPT entangled 3-qutrit DS state, and the claimed explicit disproof of the conjecture via this example fails.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • For mixtures of Dicke states, checking PPT across the most balanced bipartition is sufficient for PPT across every bipartition.
  • PPT entangled states exist in the diagonally symmetric subspace for all local dimension d≥3 and parties n≥3, so separability cannot equal PPT in these systems.
  • The dictionary gives semidefinite programming hierarchies for separability, PPT, and bosonic extendibility in the DS subspace, with explicit matrix sizes.
  • All two-body marginals of pure entangled Dicke states are NPT, recovering known results with a shorter, more conceptual proof.
  • Bosonic extendibility of DS states reduces to classical extendibility of exchangeable probability distributions, connecting quantum state extension to known moment hierarchies.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The numerical construction in Example 4.27 is the only explicit showing of a PPT-entangled 3-qutrit DS state; exhibiting a certified feasible (p,q,r) triple would make the disproof of the conjecture fully checkable by hand.
  • The dictionary suggests that the separability problem restricted to the DS subspace inherits the computational hardness of complete-positivity detection, so the tensor correspondence may serve as a robust hardness transfer.
  • The balanced-bipartition result could plausibly extend to other centrally symmetric bosonic families, offering a cheap PPT test in symmetric multipartite systems.
  • The connection to Reznick and Pólya hierarchies means standard polynomial-positivity certificates can be reinterpreted as operating on quantum states, potentially enabling entanglement detection with classical optimization software.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

2 major / 3 minor

Summary. The paper studies entanglement in the diagonally symmetric (DS) subspace, i.e., mixtures of Dicke states. It introduces a tensor-based parametrisation Q[X], W[X] of the DS subspace and proves a dictionary: separability is equivalent to complete positivity of Q[X] (Thm 4.10), entanglement witnesses to copositivity of W[O] (Thm 4.11), decomposable witnesses to SOS tensors (Thm 4.15), and the PPT property to moment tensors (Thm 4.20). This dictionary is used to show that PPT across the most balanced bipartition implies PPT across all bipartitions (Thm 4.21), to disprove the RPAR+25 conjecture by exhibiting PPT-entangled states in the DS subspace for all d≥3, n≥3 (Thm 4.29), to give an explicit 3-qutrit PPT-entangled example (Example 4.27), and to connect bosonic extendibility to Reznick and Polya hierarchies for nonnegative polynomials (Sec. 5). The paper also recovers, with a simpler proof, the NPT property of all marginals of entangled pure Dicke states (Prop. 4.30, Cor. 4.31).

Significance. If the results hold, this is a substantial contribution: it provides a complete and mostly self-contained mathematical framework for a physically important family of states, ties multipartite entanglement to well-developed tensor conic geometry, settles an open conjecture, and gives SDP-accessible hierarchies for separability and extendibility in the DS subspace. The core dictionary is derived rather than postulated, and most load-bearing steps—twirling in Thm 4.10, SOS/moment duality in Thms 4.16–4.20, the Motzkin/Robinson non-SOS arguments, and the induction in Thm 4.29—are presented with full proofs. The main weakness is the unreproducible numerical feasibility claim in Example 4.27, which is the only advertised explicit 3-qutrit PPT-entangled state; however, this gap is local and does not undermine the independent existence proof in Thm 4.29.

major comments (2)
  1. [§4.4, Example 4.27 and Remark 4.28] The advertised explicit PPT-entangled 3-qutrit state is not reproducible. The text states: 'A numerical computation yields η⋆≈−0.02<0. In particular, there exists a feasible triple (p,q,r)', but no triple, solver, or certificate is displayed. Remark 4.28 then refers to 'the values discussed in the example' that never appear. Because the feasible set includes the nonlinear constraint p(q+r)≥2q², existence of a feasible point is not immediate from the displayed inequalities. Please provide an exact or high-precision feasible triple satisfying all constraints, together with solver settings or an analytical certificate; alternatively, remove the numerical claim and rely on the independent existence proof via Thm 4.29.
  2. [§4.3, definition of Mom(n,k) for odd n] The informal description of the slice-flattenings SF[T] is easy to misread for odd n: the moment conditions of Thm 4.16 include j=0 scalar conditions T_{i(α)}≥0, which enforce entrywise nonnegativity of Q[X] (and hence X≥0), but the text's phrase 'even slices of order 2n−2,…,0' makes this implicit. Please spell out explicitly that for odd n the j=0 level consists of the diagonal entries of the tensor, so Mom(n,0) is exactly NN(n). This is a clarity issue, not a correctness issue, but it is central to reading Table 5 and Thm 4.20.
minor comments (3)
  1. [§4.4, Remark 4.28] The notation '3∨3 systems' should likely be '3×3 bipartite systems' or 'two-qutrit systems'.
  2. [Thm 4.7 proof] In the proof, the notation P_l^{Γ[k]} is introduced by writing P_l := ṜP_l^{Γ[k]}; please define the partial-transpose action explicitly for clarity.
  3. [Eq. (17) and surrounding text] The inner product identity ⟨X,Y⟩=⟨Q[X],W[Y]⟩ is central; consider stating both inner products (Hilbert–Schmidt and Euclidean tensor product) explicitly in one displayed line before using Eq. (17).

Circularity Check

0 steps flagged

No significant circularity: the dictionary is proven from definitions and external results; only non-load-bearing self-citations and a reproducibility gap in Example 4.27.

full rationale

I find no circular load-bearing step. Theorem 4.10 is proved directly: separable X gives Q[X]=sum v_q^⊗n by taking diagonal entries, and a CP tensor is converted back to a separable DS state by the square-root vectors plus diagonal-unitary twirling, with Theorem 3.7 ensuring Q determines X. Theorem 4.11 follows from the Q/W inner-product identity (Eq. 17). The PPT<->moment-tensor dictionary (Thm 4.20) is derived by conic duality from the proved decomposable<->SOS correspondence (Thm 4.14, Appendix A) and the moment-matrix duality (Thms 4.16-4.18), not assumed. Theorem 4.21 is a monotonicity consequence of the definition of Mom(n,k). The PPT-entangled examples are built on external, entanglement-free positivity results (Motzkin 1967, Robinson 1973, CLR87, ZVP06), and the induction in Thm 4.29 is a valid Newton-polytope/divisibility argument. The self-citations ([GNP25], [GNS25], [SN21]) are contextual or are reproved in the paper, so they are not load-bearing. The weakest passage is Example 4.27: 'A numerical computation yields η⋆≈−0.02<0. In particular, there exists a feasible triple (p,q,r)' is asserted without displaying the triple, solver, or certificate, and Remark 4.28 refers to 'the values discussed in the example' that never appear. That is a reproducibility gap in the explicit counterexample, not a circular derivation, and the existence claim is independently supported by Theorem 4.29. Hence the circularity score is low.

Axiom & Free-Parameter Ledger

2 free parameters · 4 axioms · 1 invented entities

The central claim rests on mathematical objects nearly all imported from prior literature (tensor cones, SOS hierarchies, duality theory, the Dicke basis) plus two classical polynomial facts; the only genuinely new primitive is the Q/W parametrization, which is a definition with checkable consequences rather than a postulate. The numerical feasibility claim in Example 4.27 is the only unverified numerical input.

free parameters (2)
  • Feasible triple (p,q,r) for the explicit 3-qutrit PPT-entangled state = not reported (claimed optimal objective η⋆ ≈ −0.02)
    Example 4.27 asserts 'A numerical computation yields η⋆≈−0.02<0' but never displays the feasible (p,q,r) satisfying p≥q≥r≥0, p(q+r)≥2q², 3p+18q+6r=1, 3p+3r−6q<0; the text later refers to 'the values discussed in the example' which are absent. The explicit counterexample depends on this unreported triple.
  • Robinson polynomial coefficients (a=3, b=−5/2, c=1/2) = a=3, b=−5/2, c=1/2
    Chosen from the [CLR87] family p_{a,b,c} = aM3 + bM1M2 + cM1^3 so that p*(t) = (1/2)(2−t)(3−t) is positive on integers {1..d} but negative between 2 and 3, making the form positive-but-not-SOS. Ad hoc choice used to build the indecomposable witness in Section 4.4; sourced from Robinson's classical example, not fitted to data.
axioms (4)
  • standard math ZVP06, Prop. 9 (used as Thm 2.11): p(x⊙x) is SOS iff p(x) = Σ_{j,α} x^α ψ_{j,α}(x) with ψ SOS of degree 2j
    This structural decomposition is the basis for the moment-matrix characterization of the dual of SOS tensors (Thm 4.16) and hence for the entire PPT dictionary (Thm 4.20). Cited, not proven in the paper.
  • standard math CLR87, Thms 3.7 & 4.25: for even symmetric sextics p_{a,b,c}, nonnegativity on the simplex ⟺ p*(k)≥0 ∀k∈[d], and SOS ⟺ p*(t)≥0 ∀t∈{1}∪[2,d]
    This is the base case of the induction in Thm 4.29 which establishes PPT entangled states for all d≥3, n≥3. The paper imports the theorem; the claim 'the positivity and SOS conditions are independent of the number of variables d' is taken verbatim from the source.
  • domain assumption Bosonic separable states are exactly mixtures of product states |v⟩⟨v|^{⊗n} (Thm 4.2, from ISTY08)
    The dictionary Theorem 4.10 (separability ⟺ complete positivity) is proven from this characterization; the whole paper operates within this bosonic separability notion.
  • standard math Closedness of the relevant convex cones (CP, Cop, SOS, Mom) so that conic duality and the separating hyperplane theorem apply
    Used to pass from T∈Cop\SOS to existence of Q∈Mom\CP (Section 4.4, Thm 4.29) and in the dualities Thm 4.18, 5.5-5.6. Closedness is asserted in Remark 2.12 and [PVZ15, Prop. 1].
invented entities (1)
  • Q[X] / W[X] tensor parametrization of the diagonally symmetric (DS) subspace no independent evidence
    purpose: A bijection between mixtures of Dicke states and real symmetric tensors such that the Hilbert-Schmidt inner product of states equals the Euclidean inner product of tensors (Eq. 17); the foundation of every dictionary entry in Fig. 5.
    New mathematical object introduced in Thms 3.7, 3.10. It is a definition, not a physical postulate: its consistency is internally checkable (e.g., Thm 3.12 relates tensor marginals to quantum reduced states; Thm 4.10's two-way proof checks against the definition of a CP tensor). No independent external handle exists beyond these internal checks.

pith-pipeline@v1.3.0-alltime-deepseek · 48590 in / 33041 out tokens · 266717 ms · 2026-08-02T22:47:04.700579+00:00 · methodology

0 comments
read the original abstract

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.

Figures

Figures reproduced from arXiv: 2602.15800 by Aabhas Gulati, Cl\'ement Pellegrini, Ion Nechita.

Figure 1
Figure 1. Figure 1: The tensor spider T with 6 legs [PITH_FULL_IMAGE:figures/full_fig_p011_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: A tensor contraction: the contracted tensor has now [PITH_FULL_IMAGE:figures/full_fig_p011_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: The figure represents a balanced flattening of a tensor [PITH_FULL_IMAGE:figures/full_fig_p037_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: The figure represents a slice of a tensor [PITH_FULL_IMAGE:figures/full_fig_p037_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: The different notions of positivity for Hermitian matrices in the DS subspace (bottom row) [PITH_FULL_IMAGE:figures/full_fig_p041_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: The different sets explored in this work, with their inclusion and duality structures. On the [PITH_FULL_IMAGE:figures/full_fig_p052_6.png] view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Construction of three-qubit positive-partial-transpose entangled states of rank four

    quant-ph 2026-05 unverdicted novelty 6.0

    Three-qubit PPT entangled states of rank four are classified by Lorentz invariant into UPB-constructible type I and a one-complex-parameter type II up to SLOCC, with additional analysis of lower-rank invariants.

  2. Construction of three-qubit positive-partial-transpose entangled states of rank four

    quant-ph 2026-05 unverdicted novelty 6.0

    The authors classify three-qubit PPT entangled states of rank four into type I (UPB-based, nonzero Lorentz invariant) and type II (zero invariant, explicit one-complex-parameter form under SLOCC) and study related inv...

Reference graph

Works this paper leans on

82 extracted references · 7 linked inside Pith · cited by 1 Pith paper

  1. [1]

    Monogamy of highly symmetric states

    Rene Allerstorfer, Matthias Christandl, Dmitry Grinko, Ion Nechita, Maris Ozols, Denis Rochette, and Philip Verduyn Lunel. Monogamy of highly symmetric states. Communications in Mathematical Physics , 407(1):21, 2026

    2026

  2. [2]

    Entangled symmetric states of n qubits with all positive partial transpositions

    Remigiusz Augusiak, J Tura, Jan Samsonowicz, and M Lewenstein. Entangled symmetric states of n qubits with all positive partial transpositions. Physical Review A—Atomic, Molecular, and Optical Physics , 86(4):042316, 2012

    2012

  3. [3]

    Teleporting an unknown quantum state via dual classical and einstein-podolsky-rosen channels

    Charles H Bennett, Gilles Brassard, Claude Cr \'e peau, Richard Jozsa, Asher Peres, and William K Wootters. Teleporting an unknown quantum state via dual classical and einstein-podolsky-rosen channels. Physical review letters , 70(13):1895, 1993

    1993

  4. [4]

    Bomze, Mirjam D \"u r, Edith de Klerk, Christian Roos, and Andrew J

    Immanuel M. Bomze, Mirjam D \"u r, Edith de Klerk, Christian Roos, and Andrew J. Przybylski. On copositive programming and standard quadratic optimization problems. Journal of Global Optimization , 18(4):301--320, 2000

    2000

  5. [5]

    Entanglement criteria for D icke states

    Marcel Bergmann and Otfried G \"u hne. Entanglement criteria for D icke states. Journal of Physics A: Mathematical and Theoretical , 46(38):385304, 2013

    2013

  6. [6]

    Semidefinite hierarchies for diagonal unitary invariant bipartite quantum states

    Jonas Britz and Monique Laurent. Semidefinite hierarchies for diagonal unitary invariant bipartite quantum states. arXiv preprint arXiv:2512.06551 , 2025

    Pith/arXiv arXiv 2025

  7. [7]

    Semidefinite optimization and convex algebraic geometry

    Grigoriy Blekherman, Pablo A Parrilo, and Rekha R Thomas. Semidefinite optimization and convex algebraic geometry . SIAM, 2012

    2012

  8. [8]

    Convex optimization

    Stephen Boyd and Lieven Vandenberghe. Convex optimization . Cambridge university press, 2004

    2004

  9. [9]

    Symmetric tensors and symmetric tensor rank

    Pierre Comon, Gene Golub, Lek-Heng Lim, and Bernard Mourrain. Symmetric tensors and symmetric tensor rank. SIAM Journal on Matrix Analysis and Applications , 30(3):1254--1279, 2008

    2008

  10. [10]

    Christandl

    M. Christandl. P PT square conjecture. Banff International Research Station Workshop: Operator Structures in Quantum Information Theory , 2012

    2012

  11. [11]

    One-and-a-half quantum de finetti theorems

    Matthias Christandl, Robert K \"o nig, Graeme Mitchison, and Renato Renner. One-and-a-half quantum de finetti theorems. Communications in Mathematical Physics , 273(2):473--498, 2007

    2007

  12. [12]

    Even symmetric sextics

    Man-Duen Choi, Tsit-Yuen Lam, and Bruce Reznick. Even symmetric sextics. Mathematical Journal , 195(4):559--580, 1987

    1987

  13. [13]

    Matthias Christandl, Alexander M \"u ller-Hermes, and Michael M. Wolf. When do composed maps become entanglement breaking? Annales Henri Poincar \'e , 20:2295--2322, 2018

    2018

  14. [14]

    General form of genuine multipartite entanglement quantum channels for teleportation

    Ping-Xing Chen, Shi-Yao Zhu, and Guang-Can Guo. General form of genuine multipartite entanglement quantum channels for teleportation. Physical Review A—Atomic, Molecular, and Optical Physics , 74(3):032324, 2006

    2006

  15. [15]

    Scaling relationship between the copositive cone and parrilo’s first level approximation

    Peter JC Dickinson, Mirjam D \"u r, Luuk Gijben, and Roland Hildebrand. Scaling relationship between the copositive cone and parrilo’s first level approximation. Optimization Letters , 7(8):1669--1679, 2013

    2013

  16. [16]

    P. H. Diananda. On non-negative forms in real variables some or all of which are non-negative. Mathematical Proceedings of the Cambridge Philosophical Society , 58(1):17–25, 1962

    1962

  17. [17]

    Approximation of the stability number of a graph via copositive programming

    Etienne De Klerk and Dmitrii V Pasechnik. Approximation of the stability number of a graph via copositive programming. SIAM Journal on Optimization , 12(4):875--892, 2002

    2002

  18. [18]

    Complete family of separability criteria

    Andrew C Doherty, Pablo A Parrilo, and Federico M Spedalieri. Complete family of separability criteria. Physical Review A , 69(2):022308, 2004

    2004

  19. [19]

    Copositive programming -- a survey

    Mirjam D \"u r. Copositive programming -- a survey. Recent Advances in Optimization and its Applications , pages 3--20, 2010. Originally a University of Groningen technical report

    2010

  20. [20]

    Copositive programming--a survey

    Mirjam D \"u r. Copositive programming--a survey. In Recent Advances in Optimization and its Applications in Engineering: The 14th Belgian-French-German Conference on Optimization , pages 3--20. Springer, 2010

    2010

  21. [21]

    Artur K. Ekert. Quantum cryptography based on bell's theorem. Phys. Rev. Lett. , 67:661--663, Aug 1991

    1991

  22. [22]

    Quantum correlations in systems of indistinguishable particles

    K Eckert, John Schliemann, D Bru , and M Lewenstein. Quantum correlations in systems of indistinguishable particles. Annals of physics , 299(1):88--127, 2002

    2002

  23. [23]

    Completely positive binary tensors

    Jinyan Fan, Jiawang Nie, and Anwa Zhou. Completely positive binary tensors. Mathematics of Operations Research , 44(3):1087--1100, 2019

    2019

  24. [24]

    Completely positive tensor decomposition

    Jinyan Fan and Anwa Zhou. Completely positive tensor decomposition. arXiv preprint arXiv:1411.5149 , 2014

    Pith/arXiv arXiv 2014

  25. [25]

    A semidefinite algorithm for completely positive tensor decomposition

    Jinyan Fan and Anwa Zhou. A semidefinite algorithm for completely positive tensor decomposition. Computational Optimization and Applications , 66(2):267--283, 2017

    2017

  26. [26]

    Strong np-hardness of the quantum separability problem

    S Gharibian. Strong np-hardness of the quantum separability problem. Quantum Information and Computation , 10(3&4):343--360, 2010

    2010

  27. [27]

    The analogue of hilbert's 1888 theorem for even symmetric forms

    Charu Goel, Salma Kuhlmann, and Bruce Reznick. The analogue of hilbert's 1888 theorem for even symmetric forms. Journal of Pure and Applied Algebra , 221(6):1438--1448, 2017

    2017

  28. [28]

    Positive maps and extendibility hierarchies from copositive matrices, 2025

    Aabhas Gulati, Ion Nechita, and Sang-Jun Park. Positive maps and extendibility hierarchies from copositive matrices, 2025

    2025

  29. [29]

    Entanglement in cyclic sign invariant quantum states

    Aabhas Gulati, Ion Nechita, and Satvik Singh. Entanglement in cyclic sign invariant quantum states. arXiv preprint arXiv:2501.04786 , 2025

    arXiv 2025

  30. [30]

    Classical deterministic complexity of edmonds' problem and quantum entanglement

    Leonid Gurvits. Classical deterministic complexity of edmonds' problem and quantum entanglement. In Proceedings of the thirty-fifth annual ACM symposium on Theory of computing , pages 10--19, 2003

    2003

  31. [31]

    The church of the symmetric subspace

    Aram W Harrow. The church of the symmetric subspace. arXiv preprint arXiv:1308.6595 , 2013

    Pith/arXiv arXiv 2013

  32. [32]

    Quantum secret sharing

    Mark Hillery, Vladim \' r Bu z ek, and Andr \'e Berthiaume. Quantum secret sharing. Physical Review A , 59(3):1829, 1999

    1999

  33. [33]

    Separability of mixed states: necessary and sufficient conditions

    Micha Horodecki, Pawe Horodecki, and Ryszard Horodecki. Separability of mixed states: necessary and sufficient conditions. Physics Letters A , 223(1):1--8, 1996

    1996

  34. [34]

    \"U ber die darstellung definite forms as sum of form squares

    David Hilbert. \"U ber die darstellung definite forms as sum of form squares. Mathematical Annals , 32(3):342--350, 1888

  35. [35]

    Copositive and completely positive quadratic forms

    Marshall Hall Jr and Morris Newman. Copositive and completely positive quadratic forms. In Mathematical Proceedings of the Cambridge Philosophical Society , volume 59 (2), pages 329--339. Cambridge University Press, 1963

    1963

  36. [36]

    High-dimensional entanglement in states with positive partial transposition

    Marcus Huber, Ludovico Lami, C \'e cilia Lancien, and Alexander M \"u ller-Hermes. High-dimensional entanglement in states with positive partial transposition. Physical review letters , 121(20):200503, 2018

    2018

  37. [37]

    Separability criterion and inseparable mixed states with positive partial transposition

    Pawel Horodecki. Separability criterion and inseparable mixed states with positive partial transposition. Physics Letters A , 232(5):333–339, August 1997

    1997

  38. [38]

    Exchange symmetry and multipartite entanglement

    Tsubasa Ichikawa, Toshihiko Sasaki, Izumi Tsutsui, and Nobuhiro Yonezawa. Exchange symmetry and multipartite entanglement. Physical Review A—Atomic, Molecular, and Optical Physics , 78(5):052105, 2008

    2008

  39. [39]

    Pairwise completely positive matrices and conjugate local diagonal unitary invariant quantum states

    Nathaniel Johnston and Olivia MacLean. Pairwise completely positive matrices and conjugate local diagonal unitary invariant quantum states. The Electronic Journal of Linear Algebra , 35:156–180, February 2019

    2019

  40. [40]

    High schmidt number concentration in quantum bound entangled states

    Robin Krebs and Mariami Gachechiladze. High schmidt number concentration in quantum bound entangled states. Physical Review Letters , 132(22):220203, 2024

    2024

  41. [41]

    On the extendibility of finitely exchangeable probability measures

    Takis Konstantopoulos and Linglong Yuan. On the extendibility of finitely exchangeable probability measures. Transactions of the American Mathematical Society , 371(10):7067--7092, 2019

    2019

  42. [42]

    Moments, positive polynomials and their applications , volume 1

    Jean Bernard Lasserre. Moments, positive polynomials and their applications , volume 1. World Scientific, 2009

    2009

  43. [43]

    Sums of squares, moment matrices and optimization over polynomials

    Monique Laurent. Sums of squares, moment matrices and optimization over polynomials. In Emerging applications of algebraic geometry , pages 157--270. Springer, 2008

    2008

  44. [44]

    Doubly nonnegative tensors, completely positive tensors and applications

    Ziyan Luo and Liqun Qi. Doubly nonnegative tensors, completely positive tensors and applications. arXiv preprint arXiv:1504.07806 , 2015

    Pith/arXiv arXiv 2015

  45. [45]

    Completely positive tensors: properties, easily checkable subclasses, and tractable relaxations

    Ziyan Luo and Liqun Qi. Completely positive tensors: properties, easily checkable subclasses, and tractable relaxations. SIAM Journal on Matrix Analysis and Applications , 37(4):1675--1698, 2016

    2016

  46. [46]

    Exactness of parrilo’s conic approximations for copositive matrices and associated low order bounds for the stability number of a graph

    Monique Laurent and Luis Felipe Vargas. Exactness of parrilo’s conic approximations for copositive matrices and associated low order bounds for the stability number of a graph. Mathematics of Operations Research , 48(2):1017--1043, 2023

    2023

  47. [47]

    Entangled symmetric states and copositive matrices

    Carlo Marconi, Albert Aloy, Jordi Tura, and Anna Sanpera. Entangled symmetric states and copositive matrices. arXiv preprint arXiv:2012.06631 , 2020

    Pith/arXiv arXiv 2012

  48. [48]

    Some np-complete problems in quadratic and nonlinear programming, 1985

    Katta G Murty and Santosh N Kabadi. Some np-complete problems in quadratic and nonlinear programming, 1985

    1985

  49. [49]

    Some np-complete problems in quadratic and nonlinear programming

    Katta G Murty and Santosh N Kabadi. Some np-complete problems in quadratic and nonlinear programming. Mathematical Programming: Series A and B , 39(2):117--129, 1987

    1987

  50. [50]

    Symmetric quantum states: a review of recent progress

    Carlo Marconi, Guillem M \"u ller-Rigat, Jordi Romero-Pallej \`a , Jordi Tura, and Anna Sanpera. Symmetric quantum states: a review of recent progress. arXiv preprint arXiv:2506.10185 , 2025

    Pith/arXiv arXiv 2025

  51. [51]

    T. S. Motzkin. Inequalities. In Proceedings of the Symposium on Inequalities, Wright-Patterson AFB, Ohio, 1965 . Academic Press, 1967

    1965

  52. [52]

    Power of symmetric extensions for entanglement detection

    Miguel Navascu \'e s, Masaki Owari, and Martin B Plenio. Power of symmetric extensions for entanglement detection. Physical Review A—Atomic, Molecular, and Optical Physics , 80(5):052306, 2009

    2009

  53. [53]

    Dehomogenization for completely positive tensors

    Jiawang Nie, Xindong Tang, Zi Yang, and Suhan Zhong. Dehomogenization for completely positive tensors. arXiv preprint arXiv:2206.12553 , 2022

    Pith/arXiv arXiv 2022

  54. [54]

    A complete semidefinite algorithm for detecting copositive matrices and tensors

    Jiawang Nie, Zi Yang, and Xinzhen Zhang. A complete semidefinite algorithm for detecting copositive matrices and tensors. SIAM Journal on Optimization , 28(4):2902--2921, 2018

    2018

  55. [55]

    Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization

    Pablo A Parrilo. Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization . California Institute of Technology, 2000

    2000

  56. [56]

    Separability criterion for density matrices

    Asher Peres. Separability criterion for density matrices. Physical Review Letters , 77(8):1413, 1996

    1996

  57. [57]

    \"U ber positive darstellung von polynomen

    George P \'o lya. \"U ber positive darstellung von polynomen. Mathematische Annalen , 70:223--235, 1911

    1911

  58. [58]

    Certificates of positivity for real polynomials

    Victoria Powers. Certificates of positivity for real polynomials . Springer, 2021

    2021

  59. [59]

    Class of genuinely high-dimensionally-entangled states with a positive partial transpose

    K \'a roly F P \'a l and Tam \'a s V \'e rtesi. Class of genuinely high-dimensionally-entangled states with a positive partial transpose. Physical Review A , 100(1):012310, 2019

    2019

  60. [60]

    Completely positive reformulations for polynomial optimization

    Javier Pena, Juan C Vera, and Luis F Zuluaga. Completely positive reformulations for polynomial optimization. Mathematical Programming , 151(2):405--431, 2015

    2015

  61. [61]

    An algorithm for sums of squares of real polynomials

    Victoria Powers and Thorsten W \"o rmann. An algorithm for sums of squares of real polynomials. Journal of pure and applied algebra , 127(1):99--104, 1998

    1998

  62. [62]

    Symmetric nonnegative tensors and copositive tensors

    Liqun Qi. Symmetric nonnegative tensors and copositive tensors. Linear Algebra and its Applications , 439(1):228--238, 2013

    2013

  63. [63]

    Nonnegative tensor factorization, completely positive tensors, and a hierarchical elimination algorithm

    Liqun Qi, Changqing Xu, and Yi Xu. Nonnegative tensor factorization, completely positive tensors, and a hierarchical elimination algorithm. SIAM Journal on Matrix Analysis and Applications , 35(4):1227--1241, 2014

    2014

  64. [64]

    Robert Raussendorf and Hans J. Briegel. A one-way quantum computer. Phys. Rev. Lett. , 86:5188--5191, May 2001

    2001

  65. [65]

    Browne, and Hans J

    Robert Raussendorf, Daniel E. Browne, and Hans J. Briegel. Measurement-based quantum computation on cluster states. Phys. Rev. A , 68:022312, Aug 2003

    2003

  66. [66]

    Uniform denominators in hilbert's seventeenth problem

    Bruce Reznick. Uniform denominators in hilbert's seventeenth problem. Mathematische Zeitschrift , 220(1):75--97, 1995

    1995

  67. [67]

    Some definite polynomials which are not sums of squares of real polynomials

    Raphael M Robinson. Some definite polynomials which are not sums of squares of real polynomials. Selected questions of algebra and logic , pages 264--282, 1973

    1973

  68. [68]

    Multipartite entanglement in the diagonal symmetric subspace

    Jordi Romero-Pallej \`a , Jennifer Ahiable, Alessandro Romancino, Carlo Marconi, and Anna Sanpera. Multipartite entanglement in the diagonal symmetric subspace. Journal of Mathematical Physics , 66(2), 2025

    2025

  69. [69]

    Extendibility of brauer states

    Adrian Solymos, D \'a vid Jakab, and Zolt \'a n Zimbor \'a s. Extendibility of brauer states. arXiv preprint arXiv:2411.04597 , 2024

    arXiv 2024

  70. [70]

    Copositive and completely positive matrices

    Naomi Shaked-Monderer and Abraham Berman. Copositive and completely positive matrices . World Scientific, 2021

    2021

  71. [71]

    Diagonal unitary and orthogonal symmetries in quantum theory

    Satvik Singh and Ion Nechita. Diagonal unitary and orthogonal symmetries in quantum theory. Quantum , 5:519, August 2021

    2021

  72. [72]

    Dicke subsystems are entangled

    Szil \' a rd Szalay and P \' e ter Ny \' a ri. Dicke subsystems are entangled. Quantum , 9:1908, November 2025

    1908

  73. [73]

    Sum-of-squares certificates for copositivity via test states

    Markus Schweighofer and Luis Felipe Vargas. Sum-of-squares certificates for copositivity via test states. SIAM Journal on Applied Algebra and Geometry , 8(4):797--820, 2024

    2024

  74. [74]

    Four-qubit entangled symmetric states with positive partial transpositions

    J Tura, R Augusiak, P Hyllus, M Ku \'s , Jan Samsonowicz, and M Lewenstein. Four-qubit entangled symmetric states with positive partial transpositions. Physical Review A—Atomic, Molecular, and Optical Physics , 85(6):060302, 2012

    2012

  75. [75]

    Separability of diagonal symmetric states: a quadratic conic optimization problem

    Jordi Tura, Albert Aloy, Ruben Quesada, Maciej Lewenstein, and Anna Sanpera. Separability of diagonal symmetric states: a quadratic conic optimization problem. Quantum , 2:45, 2018

    2018

  76. [76]

    Is entanglement monogamous? IBM Journal of Research and Development , 48(1):71--78, 2004

    Barbara M Terhal. Is entanglement monogamous? IBM Journal of Research and Development , 48(1):71--78, 2004

    2004

  77. [77]

    Entanglement and permutational symmetry

    G\'eza T\'oth and Otfried G\"uhne. Entanglement and permutational symmetry. Phys. Rev. Lett. , 102:170503, May 2009

    2009

  78. [78]

    Detection of multipartite entanglement in the vicinity of symmetric D icke states

    G \'e za T \'o th. Detection of multipartite entanglement in the vicinity of symmetric D icke states. Journal of the Optical Society of America B , 24(2):275--282, 2007

    2007

  79. [79]

    Vidal and J

    G. Vidal and J. I. Cirac. Irreversibility in asymptotic manipulations of entanglement. Phys. Rev. Lett. , 86:5803--5806, Jun 2001

    2001

  80. [80]

    Certifying separability in symmetric mixed states of n qubits, and superradiance

    Elie Wolfe and SF Yelin. Certifying separability in symmetric mixed states of n qubits, and superradiance. Physical review letters , 112(14):140402, 2014

    2014

Showing first 80 references.