2014
DOI: 10.1103/physreva.90.062323
|View full text |Cite
|
Sign up to set email alerts
|

Entanglement properties of positive operators with ranges in completely entangled subspaces

Abstract: Abstract. We prove that the projection on a completely entangled subspace S of maximum dimension in a multipartite quantum system obtained by Parthasarathy[Par04] is not positive under partial transpose. We next show that several positive operators with range in S also have the same property. In this process we construct an orthonormal basis of S and provide a linking theorem to link the constructions of completely entangled subspaces due to Parthasarthy, Bhat and Johnston.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(6 citation statements)
references
References 27 publications
0
6
0
Order By: Relevance
“…Completely entangled subspaces have been a subject of intensive studies in the literature [18,19,[36][37][38]. In particular, in Refs.…”
Section: Preliminariesmentioning
confidence: 99%
“…Completely entangled subspaces have been a subject of intensive studies in the literature [18,19,[36][37][38]. In particular, in Refs.…”
Section: Preliminariesmentioning
confidence: 99%
“…The study of multipartite entanglement has led to the discovery of different types of entanglement that can be shared by three or more quantum particles [18][19][20]. In turn, subspaces whose vectors show interesting entanglement properties have been investigated, such as those showing a bounded Schmidt rank [21], having a negative partial transpose [22], and being completely [23,24] or genuinly entangled [25].…”
Section: Introductionmentioning
confidence: 99%
“…As we have noted before, this bound was shown to be attainable by an NPT subspace in the bipartite case (in which case the bound simplifies to [13], and partial progress on this problem was made in the multipartite case in [29]. We now solve this problem by showing that there is an NPT subspace that attains the Parthasarathy bound in the multipartite case as well.…”
Section: A Multipartite Npt Subspacementioning
confidence: 73%