Realigning random states

Details Realigning random states Realigning random states

2012-03-18

arxiv.org/abs/1203.3974v1

Mathematics

Probability

Scientific paper

We study how the realignment criterion (also called computable cross-norm criterion) succeeds asymptotically in detecting whether random states are separable or entangled. We consider random states on $\C^d \otimes \C^d$ obtained by partial tracing a Haar-distributed random pure state on $\C^d \otimes \C^d \otimes \C^s$ over an ancilla space $\C^s$. We show that, for large $d$, the realignment criterion typically detects entanglement if and only if $s \leq (8/3\pi)^2 d^2$. In this sense, the realignment criterion is asymptotically weaker than the partial transposition criterion.

Affiliated with

Also associated with

No associations

Rating

Realigning random states does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Realigning random states, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Realigning random states will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-617797