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:1701.03399 · Physical Review A

Entanglement and nonlocality in diagonal symmetric states of N qubits

Ruben Quesada, Swapan Rana, Anna Sanpera

Published Apr 24, 2017• 19 citations
arXivHTMLPDF

Abstract

We analyze entanglement and nonlocal properties of the convex set of symmetric $N$-qubit states which are diagonal in the Dicke basis. First, we demonstrate that within this set, semidefinite positivity of partial transposition (PPT) is necessary and sufficient for separability---which has also been reported recently by Yu [Phys. Rev. A 94, 060101(R) (2016)]. Furthermore, we show which states among the entangled diagonal symmetric are nonlocal under two-body Bell inequalities. The diagonal symmetric convex set contains a simple and extended family of states that violate the weak Peres conjecture, being PPT with respect to one partition but violating a Bell inequality in such partition. Our method opens directions to address entanglement and nonlocality on higher dimensional symmetric states, where presently very few results are available.

DOI
10.1103/physreva.95.042128

Related papers

Necessary and sufficient condition of separability for D -symmetric diagonal states

A. Rutkowski, Michał Banacki, Marcin Marciniak

For multipartite states, we consider a notion of $D$ symmetry. For a system of $N$ qubits, it coincides with the usual permutational symmetry. In the case of $N$ qudits ($d\ensuremath{\ge}3$), the $D$ symmetry is stronger than the permutational one. For the space of all $\mathrm{D}$-symmetric vectors in ${({\mathbb{C}}^{d})}^{\ensuremath{\bigotimes}N}$, we define a basis composed of vectors ${|{R}_{N,d;k}\ensuremath{\rangle}:\phantom{\rule{0.16em}{0ex}}0\ensuremath{\le}k\ensuremath{\le}N(d\ensuremath{-}1)}$ which are analogs of Dicke states. The aim of this paper is to discuss the problem of separability of $D$-symmetric states which are diagonal in the basis ${|{R}_{N,d;k}\ensuremath{\rangle}}$. We show that if $N$ is even and $d\ensuremath{\ge}2$ is arbitrary then a positive partial transposition property is a necessary and sufficient condition of separability for $D$-invariant diagonal states. In this way, we generalize results obtained by Yu [Phys. Rev. A 94, 060101(R) (2016)] and Wolfe and Yelin [Phys. Rev. Lett. 112, 140402 (2014)]. Our strategy is to use some classical mathematical results on a moment problem.

arXiv:1810.05522•Physical Review A•Feb 8, 2019•7 citations

Separability of diagonal symmetric states: a quadratic conic optimization problem

Jordi Tura, Albert Aloy, Ruben Quesada +2 more

We study the separability problem in mixtures of Dicke states i.e., the separability of the so-called Diagonal Symmetric (DS) states. First, we show that separability in the case of DS in C d ⊗ C d (symmetric qudits) can be reformulated as a quadratic conic optimization problem. This connection allows us to exchange concepts and ideas between quantum information and this field of mathematics. For instance, copositive matrices can be understood as indecomposable entanglement witnesses for DS states. As a consequence, we show that positivity of the partial transposition (PPT) is sufficient and necessary for separability of DS states for d ≤ 4 . Furthermore, for d ≥ 5 , we provide analytic examples of PPT-entangled states. Second, we develop new sufficient separability conditions beyond the PPT criterion for bipartite DS states. Finally, we focus on N -partite DS qubits, where PPT is known to be necessary and sufficient for separability. In this case, we present a family of almost DS states that are PPT with respect to each partition but nevertheless entangled.

arXiv:1706.09423•Quantum•Jan 12, 2018•50 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

Entangled symmetric states of N qubits with all positive partial transpositions

Remigiusz Augusiak, Jordi Tura, Jan Samsonowicz +1 more

From both theoretical and experimental points of view symmetric states constitute an important class of multipartite states. Still, entanglement properties of these states, in particular those with positive partial transposition (PPT), lack a systematic study. Aiming at filling in this gap, we have recently affirmatively answered the open question of existence of four-qubit entangled symmetric states with PPT and thoroughly characterized entanglement properties of such states [J. Tura et al., Phys. Rev. A 85, 060302(R) (2012)]. With the present contribution we continue on characterizing PPT entangled symmetric states. On the one hand, we present all the results of our previous work in a detailed way. On the other hand, we generalize them to systems consisting of an arbitrary number of qubits. In particular, we provide criteria for separability of such states formulated in terms of their ranks. Interestingly, for most of the cases, the symmetric states are either separable or typically separable. Then, edge states in these systems are studied, showing in particular that to characterize generic PPT entangled states with four and five qubits, it is enough to study only those that assume few (respectively, two and three) specific configurations of ranks. Finally, we numerically search for extremal PPT entangled states in such systems consisting of up to 23 qubits. One can clearly notice regularity behind the ranks of such extremal states, and, in particular, for systems composed of odd numbers of qubits we find a single configuration of ranks for which there are extremal states.

arXiv:1206.3088•Physical Review A•Oct 15, 2012•54 citations

Four-qubit entangled symmetric states with positive partial transpositions

Jordi Tura, Remigiusz Augusiak, P. Hyllus +3 more

We solve the open question of the existence of four-qubit entangled symmetric states with positive partial transpositions (PPT states). We reach this goal with two different approaches. First, we propose a half-analytical--half-numerical method that allows us to construct multipartite PPT entangled symmetric states (PPTESSs) from the qubit-qudit PPT entangled states. Second, we adapt the algorithm allowing us to search for extremal elements in the convex set of bipartite PPT states [Phys. Rev. A 76, 034304 (2007)] to the multipartite scenario. With its aid we search for extremal four-qubit PPTESSs and show that generically they have ranks $(5,7,8)$. Finally, we provide an exhaustive characterization of these states with respect to their separability properties.

arXiv:1203.3711•Physical Review A•Jun 22, 2012•51 citations

On the separability of Bell-diagonal states with absolutely positive partial transposition

Ayan Patra, Beatrix C. Hiesmayr

Absolutely positive partial transpose (APPT) states, which remain PPT under every global unitary, provide a spectral relaxation of absolutely separable states, which remain separable under every such transformation. Despite substantial progress, whether these two notions coincide beyond qubit-qudit systems remains unresolved, motivating the study of structured state families in which the APPT spectral constraints and separability can be analyzed exactly. We study this problem for Bell-diagonal states in two settings: the standard two-qutrit Weyl-Heisenberg basis and the two-ququart lattice basis generated by two-qubit Pauli operators. In the two-qutrit case, we show that a linearized necessary condition for APPT defines a polytope of spectra in which every associated Weyl-Heisenberg Bell-diagonal state admits an exact decomposition into explicitly separable states. This yields a separability criterion that applies to a region even larger than the APPT set itself. In the two-ququart lattice Bell-diagonal setting, we show that a state remains PPT under every permutation of its Bell coefficients if and only if its six largest Bell coefficients sum to at most 1/2, and we prove that all such states are separable. Equivalently, every entangled lattice Bell-diagonal state becomes NPT after a suitable coefficient permutation and is therefore not APPT. The proofs combine convex-polytope analysis, affine and symplectic orbit reductions, and exact rational decompositions into separable states supported on affine Lagrangian subsets. Our results rule out entangled APPT states in both Bell-diagonal families, and provide simple spectral inequalities as sufficient criteria for separability in both cases. Being basis-specific, however, they do not by themselves settle whether APPT and absolute separability coincide.

quant-pharXiv:2610.12000•Oct 9, 2026•0 citations
We analyze entanglement and nonlocal properties of the convex set of symmetric NNN-qubit states which are diagonal in the Dicke basis. First, we demonstrate that within this set, semidefinite positivity of partial transposition (PPT) is necessary and sufficient for separability---which has also been reported recently by Yu [Phys. Rev. A 94, 060101(R) (2016)]. Furthermore, we show which states among the entangled diagonal symmetric are nonlocal under two-body Bell inequalities. The diagonal symmetric convex set contains a simple and extended family of states that violate the weak Peres conjecture, being PPT with respect to one partition but violating a Bell inequality in such partition. Our method opens directions to address entanglement and nonlocality on higher dimensional symmetric states, where presently very few results are available.
For multipartite states, we consider a notion of DDD symmetry. For a system of NNN qubits, it coincides with the usual permutational symmetry. In the case of NNN qudits ($d\ensuremath{\ge}3$), the DDD symmetry is stronger than the permutational one. For the space of all D\mathrm{D}D-symmetric vectors in ${({\mathbb{C}}^{d})}^{\ensuremath{\bigotimes}N}$, we define a basis composed of vectors ${|{R}_{N,d;k}\ensuremath{\rangle}:\phantom{\rule{0.16em}{0ex}}0\ensuremath{\le}k\ensuremath{\le}N(d\ensuremath{-}1)}$ which are analogs of Dicke states. The aim of this paper is to discuss the problem of separability of DDD-symmetric states which are diagonal in the basis ${|{R}_{N,d;k}\ensuremath{\rangle}}$. We show that if NNN is even and $d\ensuremath{\ge}2$ is arbitrary then a positive partial transposition property is a necessary and sufficient condition of separability for DDD-invariant diagonal states. In this way, we generalize results obtained by Yu [Phys. Rev. A 94, 060101(R) (2016)] and Wolfe and Yelin [Phys. Rev. Lett. 112, 140402 (2014)]. Our strategy is to use some classical mathematical results on a moment problem.
We study the separability problem in mixtures of Dicke states i.e., the separability of the so-called Diagonal Symmetric (DS) states. First, we show that separability in the case of DS in C d ⊗ C d (symmetric qudits) can be reformulated as a quadratic conic optimization problem. This connection allows us to exchange concepts and ideas between quantum information and this field of mathematics. For instance, copositive matrices can be understood as indecomposable entanglement witnesses for DS states. As a consequence, we show that positivity of the partial transposition (PPT) is sufficient and necessary for separability of DS states for d ≤ 4 . Furthermore, for d ≥ 5 , we provide analytic examples of PPT-entangled states. Second, we develop new sufficient separability conditions beyond the PPT criterion for bipartite DS states. Finally, we focus on N -partite DS qubits, where PPT is known to be necessary and sufficient for separability. In this case, we present a family of almost DS states that are PPT with respect to each partition but nevertheless entangled.
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.
From both theoretical and experimental points of view symmetric states constitute an important class of multipartite states. Still, entanglement properties of these states, in particular those with positive partial transposition (PPT), lack a systematic study. Aiming at filling in this gap, we have recently affirmatively answered the open question of existence of four-qubit entangled symmetric states with PPT and thoroughly characterized entanglement properties of such states [J. Tura et al., Phys. Rev. A 85, 060302(R) (2012)]. With the present contribution we continue on characterizing PPT entangled symmetric states. On the one hand, we present all the results of our previous work in a detailed way. On the other hand, we generalize them to systems consisting of an arbitrary number of qubits. In particular, we provide criteria for separability of such states formulated in terms of their ranks. Interestingly, for most of the cases, the symmetric states are either separable or typically separable. Then, edge states in these systems are studied, showing in particular that to characterize generic PPT entangled states with four and five qubits, it is enough to study only those that assume few (respectively, two and three) specific configurations of ranks. Finally, we numerically search for extremal PPT entangled states in such systems consisting of up to 23 qubits. One can clearly notice regularity behind the ranks of such extremal states, and, in particular, for systems composed of odd numbers of qubits we find a single configuration of ranks for which there are extremal states.
We solve the open question of the existence of four-qubit entangled symmetric states with positive partial transpositions (PPT states). We reach this goal with two different approaches. First, we propose a half-analytical--half-numerical method that allows us to construct multipartite PPT entangled symmetric states (PPTESSs) from the qubit-qudit PPT entangled states. Second, we adapt the algorithm allowing us to search for extremal elements in the convex set of bipartite PPT states [Phys. Rev. A 76, 034304 (2007)] to the multipartite scenario. With its aid we search for extremal four-qubit PPTESSs and show that generically they have ranks (5,7,8)(5,7,8)(5,7,8). Finally, we provide an exhaustive characterization of these states with respect to their separability properties.
Absolutely positive partial transpose (APPT) states, which remain PPT under every global unitary, provide a spectral relaxation of absolutely separable states, which remain separable under every such transformation. Despite substantial progress, whether these two notions coincide beyond qubit-qudit systems remains unresolved, motivating the study of structured state families in which the APPT spectral constraints and separability can be analyzed exactly. We study this problem for Bell-diagonal states in two settings: the standard two-qutrit Weyl-Heisenberg basis and the two-ququart lattice basis generated by two-qubit Pauli operators. In the two-qutrit case, we show that a linearized necessary condition for APPT defines a polytope of spectra in which every associated Weyl-Heisenberg Bell-diagonal state admits an exact decomposition into explicitly separable states. This yields a separability criterion that applies to a region even larger than the APPT set itself. In the two-ququart lattice Bell-diagonal setting, we show that a state remains PPT under every permutation of its Bell coefficients if and only if its six largest Bell coefficients sum to at most 1/2, and we prove that all such states are separable. Equivalently, every entangled lattice Bell-diagonal state becomes NPT after a suitable coefficient permutation and is therefore not APPT. The proofs combine convex-polytope analysis, affine and symplectic orbit reductions, and exact rational decompositions into separable states supported on affine Lagrangian subsets. Our results rule out entangled APPT states in both Bell-diagonal families, and provide simple spectral inequalities as sufficient criteria for separability in both cases. Being basis-specific, however, they do not by themselves settle whether APPT and absolute separability coincide.