On the reduction criterion for random quantum states

Abstract

In this paper we study the reduction criterion for detecting entanglement of large dimensional bipartite quantum systems. We first obtain an explicit formula for the moments of a random quantum state to which the reduction criterion has been applied. We show that the empirical eigenvalue distribution of this random matrix converges strongly to a limit that we compute, in three different asymptotic regimes. We then employ tools from free probability to study the asymptotic positivity of the reduction operators. Finally, we compare the reduction criterion with other entanglement criteria, via thresholds.

References in corpus (4)

• Asymptotics of random density matrices
• Realigning random states
• Partial transpose of random quantum states: exact formulas and meanders
• Block-modified Wishart matrices and free Poisson laws

Cited by in corpus (7)

• Random matrix techniques in quantum information theory
• Fundamental Limitation on the Detectability of Entanglement
• Positive reduction from spectra
• On the asymptotic distribution of block-modified random matrices
• Thresholds for reduction-related entanglement criteria in quantum information theory
• On the separability of unitarily invariant random quantum states - the unbalanced regime
• Non-commutative Probability Theory for Topological Data Analysis