Realigning random states

From MaRDI portal



Abstract: 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 CdotimesCd obtained by partial tracing a Haar-distributed random pure state on CdotimesCdotimesCs over an ancilla space Cs. We show that, for large d, the realignment criterion typically detects entanglement if and only if sleq(8/3pi)2d2. In this sense, the realignment criterion is asymptotically weaker than the partial transposition criterion.












This page was built for publication: Realigning random states

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2872317)