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:1906.10023

A Class of PPT Entangled States Arbitrary Far From Separable States

Rutkowski, Adam, Michał Studziński

Published Jun 24, 2019• 0 citations
arXivHTMLPDF

Abstract

In this paper we show an explicit construction of multipartite class of entangled states with the PPT (Positive Partial Transposition) property in every cut. We investigate properties of this class of states focusing on the trace distance from the set of separable states. We provide an explicit sub-class of the multipartite entangled PPT states which are arbitrary far from the set of separable states. We argue, that in the multipartite case the mentioned distance increases with dimension of the local Hilbert space. In our construction is we do not have to use many copies of initial state living on the smaller space to boost the trace distance as in the previous attempts to this problem.

DOI
10.48550/arxiv.1906.10023

Related papers

Bound entangled states with extremal properties

Piotr Badzia ̧g, Karol Horodecki, Michał Horodecki +2 more

Following recent work of Beigi and Shor, we investigate positive partial transpose (PPT) states that are ``heavily entangled.'' We first exploit volumetric methods to show that in a randomly chosen direction, there are PPT states whose distance in trace norm from separable states is (asymptotically) at least $1/4$. We then provide explicit examples of PPT states which are nearly as far from separable ones as possible. To obtain a distance of $2\ensuremath{-}\ensuremath{\epsilon}$ from the separable states, we need a dimension of ${2}^{\mathrm{poly}[log(\frac{1}{\ensuremath{\epsilon}})]}$, as opposed to ${2}^{\mathrm{poly}(\frac{1}{\ensuremath{\epsilon}})}$ given by the construction of Beigi and Shor [J. Math. Phys. 51, 042202 (2010)]. We do so by exploiting the so-called private states, introduced earlier in the context of quantum cryptography. We also provide a lower bound for the distance between private states and PPT states and investigate the distance between pure states and the set of PPT states.

arXiv:1309.7992•Physical Review A•Jul 2, 2014•10 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•47 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•52 citations

Two distinct classes of bound entanglement: PPT-bound and `multi-particle'-bound

Beatrix C. Hiesmayr, Marcus Huber

We introduce systematically with the help of Weyl operators novel classes of multipartite and multidimensional states which are all bound entangled for arbitrary dimension. We find that the entanglement is bound due to different reasons: unlockable due to the multi--particle nature and some states are in addition bound due the fact being positive under partial transposition (PPT). By a general construction (W simplices) we obtain classes of states which have the same geometry concerning separability and entanglement independent of the number of involved particle pairs. Moreover, we introduce a distillation protocol and demonstrate for d=3 that for a certain set of states the entanglement can be increased only up to a certain amount.

arXiv:0906.0238•Jun 1, 2009•1 citation

Robustness of entangled states that are positive under partial transposition

Somshubhro Bandyopadhyay, Sibasish Ghosh A, Vwani Roychowdhury

We study robustness of bipartite entangled states that are positive under partial transposition (PPT). It is shown that almost all PPT entangled states are unconditionally robust, in the sense, both inseparability and positivity are preserved under sufficiently small perturbations in its immediate neighborhood. Such unconditionally robust PPT entangled states lie inside an open PPT entangled ball. We construct examples of such balls whose radii are shown to be finite and can be explicitly calculated. This provides a lower bound on the volume of all PPT entangled states. Multipartite generalization of our constructions is also outlined.

arXiv:0709.0027•Physical Review A•Mar 12, 2008•15 citations

High-Dimensional Entanglement in States with Positive Partial Transposition

Marcus Huber, Ludovico Lami, Cécilia Lancien +1 more

Genuine high-dimensional entanglement, i.e., the property of having a high Schmidt number, constitutes an instrumental resource in quantum communication, overcoming limitations of low-dimensional systems. States with a positive partial transpose (PPT) are generally considered weakly entangled, as they can never be distilled into pure entangled states. This naturally raises the question of whether high Schmidt numbers are possible for PPT states. Volume estimates suggest that optimal, i.e., linear, scaling in the local dimension should be possible, albeit without providing insight into the possible slope. We provide the first explicit construction of a family of PPT states that achieves linear scaling in the local dimension and we prove that random PPT states typically share this feature. Our construction also allows us to prove a recent conjecture of Chen et al. on the existence of PPT states whose Schmidt number increases by an arbitrarily large amount upon partial transposition. Finally, we link the Schmidt number to entangled sub-block matrices of a quantum state. We use this connection to prove that quantum states that are either (i) invariant under partial transposition on the smallest of their two subsystems, or (ii) absolutely PPT cannot have a maximal Schmidt number. Overall, our findings shed new light on some fundamental problems in entanglement theory.

arXiv:1802.04975•Physical Review Letters•Nov 15, 2018•46 citations
In this paper we show an explicit construction of multipartite class of entangled states with the PPT (Positive Partial Transposition) property in every cut. We investigate properties of this class of states focusing on the trace distance from the set of separable states. We provide an explicit sub-class of the multipartite entangled PPT states which are arbitrary far from the set of separable states. We argue, that in the multipartite case the mentioned distance increases with dimension of the local Hilbert space. In our construction is we do not have to use many copies of initial state living on the smaller space to boost the trace distance as in the previous attempts to this problem.
Following recent work of Beigi and Shor, we investigate positive partial transpose (PPT) states that are ``heavily entangled.'' We first exploit volumetric methods to show that in a randomly chosen direction, there are PPT states whose distance in trace norm from separable states is (asymptotically) at least 1/41/41/4. We then provide explicit examples of PPT states which are nearly as far from separable ones as possible. To obtain a distance of $2\ensuremath{-}\ensuremath{\epsilon}$ from the separable states, we need a dimension of ${2}^{\mathrm{poly}[log(\frac{1}{\ensuremath{\epsilon}})]}$, as opposed to ${2}^{\mathrm{poly}(\frac{1}{\ensuremath{\epsilon}})}$ given by the construction of Beigi and Shor [J. Math. Phys. 51, 042202 (2010)]. We do so by exploiting the so-called private states, introduced earlier in the context of quantum cryptography. We also provide a lower bound for the distance between private states and PPT states and investigate the distance between pure states and the set of PPT states.
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.
We introduce systematically with the help of Weyl operators novel classes of multipartite and multidimensional states which are all bound entangled for arbitrary dimension. We find that the entanglement is bound due to different reasons: unlockable due to the multi--particle nature and some states are in addition bound due the fact being positive under partial transposition (PPT). By a general construction (W simplices) we obtain classes of states which have the same geometry concerning separability and entanglement independent of the number of involved particle pairs. Moreover, we introduce a distillation protocol and demonstrate for d=3 that for a certain set of states the entanglement can be increased only up to a certain amount.
We study robustness of bipartite entangled states that are positive under partial transposition (PPT). It is shown that almost all PPT entangled states are unconditionally robust, in the sense, both inseparability and positivity are preserved under sufficiently small perturbations in its immediate neighborhood. Such unconditionally robust PPT entangled states lie inside an open PPT entangled ball. We construct examples of such balls whose radii are shown to be finite and can be explicitly calculated. This provides a lower bound on the volume of all PPT entangled states. Multipartite generalization of our constructions is also outlined.
Genuine high-dimensional entanglement, i.e., the property of having a high Schmidt number, constitutes an instrumental resource in quantum communication, overcoming limitations of low-dimensional systems. States with a positive partial transpose (PPT) are generally considered weakly entangled, as they can never be distilled into pure entangled states. This naturally raises the question of whether high Schmidt numbers are possible for PPT states. Volume estimates suggest that optimal, i.e., linear, scaling in the local dimension should be possible, albeit without providing insight into the possible slope. We provide the first explicit construction of a family of PPT states that achieves linear scaling in the local dimension and we prove that random PPT states typically share this feature. Our construction also allows us to prove a recent conjecture of Chen et al. on the existence of PPT states whose Schmidt number increases by an arbitrarily large amount upon partial transposition. Finally, we link the Schmidt number to entangled sub-block matrices of a quantum state. We use this connection to prove that quantum states that are either (i) invariant under partial transposition on the smallest of their two subsystems, or (ii) absolutely PPT cannot have a maximal Schmidt number. Overall, our findings shed new light on some fundamental problems in entanglement theory.