Papers
Topics
Authors
Recent
Search
2000 character limit reached

Qubit-qudit states with positive partial transpose

Published 29 Sep 2012 in quant-ph, math-ph, and math.MP | (1210.0111v2)

Abstract: We show that the length of a qubit-qutrit separable state is equal to the max(r,s), where r is the rank of the state and s is the rank of its partial transpose. We refer to the ordered pair (r,s) as the birank of this state. We also construct examples of qubit-qutrit separable states of any feasible birank (r,s). We determine the closure of the set of normalized two-qutrit entangled states of rank four having positive partial transpose (PPT). The boundary of this set consists of all separable states of length at most four. We prove that the length of any qubit-qudit separable state of birank (d+1,d+1) is d+1. We also show that all qubit-qudit PPT entangled states of birank (d+1,d+1) can be built in a simple way from edge states. If V is a subspace of dimension k<d in the tensor product of C2 and Cd such that V contains no product vectors, we show that the set of all product vectors in the orthogonal complement of V is a vector bundle of rank d-k over the projective line. Finally, we explicitly construct examples of qubit-qudit PPT states (both separable and entangled) of any feasible birank.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.