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

Non-positive-partial-transpose subspaces can be as large as any entangled subspace

Nathaniel Johnston

Published Jun 28, 2013• 44 citations
arXivHTMLPDF

Abstract

It is known that, in an $(m\ensuremath{\bigotimes}n)$-dimensional quantum system, the maximum dimension of a subspace that contains only entangled states is $(m\ensuremath{-}1)(n\ensuremath{-}1)$. We show that the exact same bound is tight if we require the stronger condition that every state with range in the subspace has non-positive partial transpose. As an immediate corollary of our result, we solve an open question that asks for the maximum number of negative eigenvalues of the partial transpose of a quantum state. In particular, we give an explicit method of construction of a bipartite state whose partial transpose has $(m\ensuremath{-}1)(n\ensuremath{-}1)$ negative eigenvalues, which is necessarily maximal, despite recent numerical evidence that suggested such states may not exist for large $m$ and $n$.

DOI
10.1103/physreva.87.064302

Related papers

The Non-m-Positive Dimension of a Positive Linear Map

Nathaniel Johnston, Benjamin Lovitz, Daniel Puzzuoli

We introduce a property of a matrix-valued linear map Φ that we call its ``non-m-positive dimension'' (or ``non-mP dimension'' for short), which measures how large a subspace can be if every quantum state supported on the subspace is non-positive under the action of Im⊗Φ . Equivalently, the non-mP dimension of Φ tells us the maximal number of negative eigenvalues that the adjoint map Im⊗Φ∗ can produce from a positive semidefinite input. We explore the basic properties of this quantity and show that it can be thought of as a measure of how good Φ is at detecting entanglement in quantum states. We derive non-trivial bounds for this quantity for some well-known positive maps of interest, including the transpose map, reduction map, Choi map, and Breuer--Hall map. We also extend some of our results to the case of higher Schmidt number as well as the multipartite case. In particular, we construct the largest possible multipartite subspace with the property that every state supported on that subspace has non-positive partial transpose across at least one bipartite cut, and we use our results to construct multipartite decomposable entanglement witnesses with the maximum number of negative eigenvalues.

arXiv:1906.04517•Quantum•Aug 12, 2019•5 citations

Asymptotic Indistinguishability of Bipartite Quantum States by Operations Completely Preserving Positivity of Partial Transpose

Yinan Li, Xin Wang, Runyao Duan

A bipartite subspace $S$ is called strongly positive-partial-transpose-unextendible (PPT-unextendible) if for every positive integer $k$, there is no PPT state supporting on the orthogonal complement of $S^{\otimes k}$. We show that a subspace is strongly PPT-unextendible if it contains a PPT-definite operator (a positive semidefinite operator whose partial transpose is positive definite). Applying this result, we demonstrate a simple criterion for verifying whether a set of bipartite quantum states is asymptotically indistinguishable by operations completely preserving positivity of partial transpose. This criterion is based on the observation that if the support of some bipartite state is strongly PPT-unextendible, then any set of bipartite quantum states which contains this state cannot be asymptotically distinguished by PPT operations. Utilizing this criterion, we further show that any entangled pure state and its orthogonal complement cannot be distinguished asymptotically by PPT operations. Meanwhile, we also investigate that the minimum dimension of strongly PPT-unextendible subspaces in a $m\otimes n$ system is $m+n-1$, which involves an extension of the result that non-positive-partial-transpose (NPT) subspaces can be as large as any entangled subspace [N. Johnston, Phys. Rev. A 87: 064302 (2013)].

•Feb 1, 2017•1 citation

Indistinguishability of bipartite states by positive-partial-transpose operations in the many-copy scenario

Yinan Li, Xin Wang, Runyao Duan

A bipartite subspace $S$ is called strongly positive-partial-transpose (PPT) unextendible if for every positive integer $k$, there is no PPT operator supporting on the orthogonal complement of ${S}^{\ensuremath{\bigotimes}k}$. We show that a subspace is strongly PPT unextendible if it contains a PPT-definite operator (a positive semidefinite operator whose partial transpose is positive definite). Based on these, we are able to propose a simple criterion for verifying whether a set of bipartite orthogonal quantum states is indistinguishable by PPT operations in the many-copy scenario. Utilizing this criterion, we further point out that any entangled pure state and its orthogonal complement cannot be distinguished by PPT operations in the many-copy scenario. On the other hand, we investigate that the minimum dimension of strongly PPT-unextendible subspaces in an $m\ensuremath{\bigotimes}n$ system is $m+n\ensuremath{-}1$, which involves a generalization of the result that non-positive-partial-transpose subspaces can be as large as any entangled subspace [N. Johnston, Phys. Rev. A 87, 064302 (2013)].

arXiv:1702.00231•Physical Review A•May 30, 2017•20 citations

Fully non-positive-partial-transpose genuinely entangled subspaces

Owidiusz Makuta, Błażej Kuzaka, Remigiusz Augusiak

Genuinely entangled subspaces are a class of subspaces in the multipartite Hilbert spaces that are composed of only genuinely entangled states. They are thus an interesting object of study in the context of multipartite entanglement. Here we provide a construction of multipartite subspaces that are not only genuinely entangled but also fully non-positive-partial-transpose (NPT) in the sense that any mixed state supported on them has non-positive partial transpose across any bipartition. Our construction originates from the stabilizer formalism known for its use in quantum error correction. To this end, we first introduce a couple of criteria allowing to assess whether any state from a given non-trivial stabilizer subspace is genuinely multipartite entangled. We then use these criteria to construct genuinely entangled stabilizer subspaces for any number of parties and arbitrary local dimension and conjecture them to be of maximal dimension achievable within the stabilizer formalism. At the same time, we prove that every genuinely entangled subspace is fully NPT in the above sense, which implies a quite surprising fact that no genuinely entangled stabilizer subspace can support PPT entangled states.

arXiv:2203.16902•Quantum•Feb 9, 2023•9 citations

Entanglement properties of positive operators with ranges in completely entangled subspaces

Ritabrata Sengupta, Arvind, Ajit Iqbal Singh

We prove that the projection on a completely entangled subspace $\mathcal{S}$ of maximum dimension obtained by Parthasarathy [K. R. Parthasarathy, Proc. Indian Acad. Sci. Math. Sci. 114, 365 (2004)] in a multipartite quantum system is not positive under partial transpose. We next show that a large number of positive operators with a range in $\mathcal{S}$ also have the same property. In this process we construct an orthonormal basis for $\mathcal{S}$ and provide a theorem to link the constructions of completely entangled subspaces due to Parthasarathy (as cited above), Bhat [B. V. R. Bhat, Int. J. Quantum Inf. 4, 325 (2006)], and Johnston [N. Johnston, Phys. Rev. A 87, 064302 (2013)].

arXiv:1409.5093•Physical Review A•Dec 15, 2014•11 citations

Bound Entangled States With Negative Partial Transpose Exist

Indrani Chattopadhyay, D. Sarkar

We prove the existence of bound entangled states with negative partial transpose (NPT) in any d × d(d ≥ 3) Hilbert space with a simple assumption on Schmidt rank two states. Obviously they belong to the class of conjectured to be bound entangled states by Divincenzo et.al [Phys. Rev. A, 61, 062312(2000)] and by Dür et.al [Phys. Rev. A, 61, 062313(2000)]. PACS number(s): 03.67.Hk, 03.65.Ud. The basic issue on the classification of mixed state entanglement at least on the level of bipartite systems solely depends upon whether there exist bound entangled states or not. The existence of PPT-bound (PPT means positive partial transpose) entangled states [1] and also the existence of NPT N−copy undistillable states [2, 3] for every positive integer N naturally indicates there may exist NPT-bound entangled states. In this work we are able to show the existence of NPT-bound entangled states with a simple assumption on Schmidt rank two states. We first briefly describe the issue and the importance of the problem. In recent years it is found that quantum entanglement is an useful resource in performing several tasks in quantum information theory and quantum communication [4]. Maximally entangled states shared between two parties are essential ingredients in this respect [5]. Now due to the interaction with environment, states are in practice found to be mixed. However there is a process called distillation by which we can distill sometimes maximally entangled

•Sep 6, 2006•0 citations
It is known that, in an (m\ensuremath⨂n)(m\ensuremath{\bigotimes}n)(m\ensuremath⨂n)-dimensional quantum system, the maximum dimension of a subspace that contains only entangled states is (m\ensuremath−1)(n\ensuremath−1)(m\ensuremath{-}1)(n\ensuremath{-}1)(m\ensuremath−1)(n\ensuremath−1). We show that the exact same bound is tight if we require the stronger condition that every state with range in the subspace has non-positive partial transpose. As an immediate corollary of our result, we solve an open question that asks for the maximum number of negative eigenvalues of the partial transpose of a quantum state. In particular, we give an explicit method of construction of a bipartite state whose partial transpose has (m\ensuremath−1)(n\ensuremath−1)(m\ensuremath{-}1)(n\ensuremath{-}1)(m\ensuremath−1)(n\ensuremath−1) negative eigenvalues, which is necessarily maximal, despite recent numerical evidence that suggested such states may not exist for large mmm and nnn.
We introduce a property of a matrix-valued linear map Φ that we call its ``non-m-positive dimension'' (or ``non-mP dimension'' for short), which measures how large a subspace can be if every quantum state supported on the subspace is non-positive under the action of Im⊗Φ . Equivalently, the non-mP dimension of Φ tells us the maximal number of negative eigenvalues that the adjoint map Im⊗Φ∗ can produce from a positive semidefinite input. We explore the basic properties of this quantity and show that it can be thought of as a measure of how good Φ is at detecting entanglement in quantum states. We derive non-trivial bounds for this quantity for some well-known positive maps of interest, including the transpose map, reduction map, Choi map, and Breuer--Hall map. We also extend some of our results to the case of higher Schmidt number as well as the multipartite case. In particular, we construct the largest possible multipartite subspace with the property that every state supported on that subspace has non-positive partial transpose across at least one bipartite cut, and we use our results to construct multipartite decomposable entanglement witnesses with the maximum number of negative eigenvalues.
A bipartite subspace SSS is called strongly positive-partial-transpose-unextendible (PPT-unextendible) if for every positive integer kkk, there is no PPT state supporting on the orthogonal complement of S⊗kS^{\otimes k}S⊗k. We show that a subspace is strongly PPT-unextendible if it contains a PPT-definite operator (a positive semidefinite operator whose partial transpose is positive definite). Applying this result, we demonstrate a simple criterion for verifying whether a set of bipartite quantum states is asymptotically indistinguishable by operations completely preserving positivity of partial transpose. This criterion is based on the observation that if the support of some bipartite state is strongly PPT-unextendible, then any set of bipartite quantum states which contains this state cannot be asymptotically distinguished by PPT operations. Utilizing this criterion, we further show that any entangled pure state and its orthogonal complement cannot be distinguished asymptotically by PPT operations. Meanwhile, we also investigate that the minimum dimension of strongly PPT-unextendible subspaces in a m⊗nm\otimes nm⊗n system is m+n−1m+n-1m+n−1, which involves an extension of the result that non-positive-partial-transpose (NPT) subspaces can be as large as any entangled subspace [N. Johnston, Phys. Rev. A 87: 064302 (2013)].
A bipartite subspace SSS is called strongly positive-partial-transpose (PPT) unextendible if for every positive integer kkk, there is no PPT operator supporting on the orthogonal complement of ${S}^{\ensuremath{\bigotimes}k}$. We show that a subspace is strongly PPT unextendible if it contains a PPT-definite operator (a positive semidefinite operator whose partial transpose is positive definite). Based on these, we are able to propose a simple criterion for verifying whether a set of bipartite orthogonal quantum states is indistinguishable by PPT operations in the many-copy scenario. Utilizing this criterion, we further point out that any entangled pure state and its orthogonal complement cannot be distinguished by PPT operations in the many-copy scenario. On the other hand, we investigate that the minimum dimension of strongly PPT-unextendible subspaces in an $m\ensuremath{\bigotimes}n$ system is $m+n\ensuremath{-}1$, which involves a generalization of the result that non-positive-partial-transpose subspaces can be as large as any entangled subspace [N. Johnston, Phys. Rev. A 87, 064302 (2013)].
Genuinely entangled subspaces are a class of subspaces in the multipartite Hilbert spaces that are composed of only genuinely entangled states. They are thus an interesting object of study in the context of multipartite entanglement. Here we provide a construction of multipartite subspaces that are not only genuinely entangled but also fully non-positive-partial-transpose (NPT) in the sense that any mixed state supported on them has non-positive partial transpose across any bipartition. Our construction originates from the stabilizer formalism known for its use in quantum error correction. To this end, we first introduce a couple of criteria allowing to assess whether any state from a given non-trivial stabilizer subspace is genuinely multipartite entangled. We then use these criteria to construct genuinely entangled stabilizer subspaces for any number of parties and arbitrary local dimension and conjecture them to be of maximal dimension achievable within the stabilizer formalism. At the same time, we prove that every genuinely entangled subspace is fully NPT in the above sense, which implies a quite surprising fact that no genuinely entangled stabilizer subspace can support PPT entangled states.
We prove that the projection on a completely entangled subspace S\mathcal{S}S of maximum dimension obtained by Parthasarathy [K. R. Parthasarathy, Proc. Indian Acad. Sci. Math. Sci. 114, 365 (2004)] in a multipartite quantum system is not positive under partial transpose. We next show that a large number of positive operators with a range in S\mathcal{S}S also have the same property. In this process we construct an orthonormal basis for S\mathcal{S}S and provide a theorem to link the constructions of completely entangled subspaces due to Parthasarathy (as cited above), Bhat [B. V. R. Bhat, Int. J. Quantum Inf. 4, 325 (2006)], and Johnston [N. Johnston, Phys. Rev. A 87, 064302 (2013)].
We prove the existence of bound entangled states with negative partial transpose (NPT) in any d × d(d ≥ 3) Hilbert space with a simple assumption on Schmidt rank two states. Obviously they belong to the class of conjectured to be bound entangled states by Divincenzo et.al [Phys. Rev. A, 61, 062312(2000)] and by Dür et.al [Phys. Rev. A, 61, 062313(2000)]. PACS number(s): 03.67.Hk, 03.65.Ud. The basic issue on the classification of mixed state entanglement at least on the level of bipartite systems solely depends upon whether there exist bound entangled states or not. The existence of PPT-bound (PPT means positive partial transpose) entangled states [1] and also the existence of NPT N−copy undistillable states [2, 3] for every positive integer N naturally indicates there may exist NPT-bound entangled states. In this work we are able to show the existence of NPT-bound entangled states with a simple assumption on Schmidt rank two states. We first briefly describe the issue and the importance of the problem. In recent years it is found that quantum entanglement is an useful resource in performing several tasks in quantum information theory and quantum communication [4]. Maximally entangled states shared between two parties are essential ingredients in this respect [5]. Now due to the interaction with environment, states are in practice found to be mixed. However there is a process called distillation by which we can distill sometimes maximally entangled