Realigning random states

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 $\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\le (8/3\pi {)}^2{d}^2$. In this sense, the realignment criterion is asymptotically weaker than the partial transposition criterion.

References in corpus (2)

• Aspects of generic entanglement
• Pauli Diagonal Channels Constant on Axes

Cited by in corpus (13)

• Random matrix techniques in quantum information theory
• Generating random quantum channels
• Fun with replicas: tripartitions in tensor networks and gravity
• Random tensor networks with nontrivial links
• Correlation length in random MPS and PEPS
• Fundamental Limitation on the Detectability of Entanglement
• Mixed-State Entanglement Measures in Topological Order
• Asymptotically well-behaved input states do not violate additivity for conjugate pairs of random quantum channels
• On the reduction criterion for random quantum states
• $k$-extendibility of high-dimensional bipartite quantum states
• Random covariant quantum channels
• On the separability of unitarily invariant random quantum states - the unbalanced regime
• Entanglement criteria for the bosonic and fermionic induced ensembles