On the reduction criterion for random quantum states
arXiv:1402.4292 · doi:10.1063/1.4901548
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 (14)
- Quantum entanglement
- Separability Criterion for Density Matrices
- Separability of Mixed States: Necessary and Sufficient Conditions
- Induced measures in the space of mixed quantum states
- Random quantum channels I: graphical calculus and the Bell state phenomenon
- Generalized reduction criterion for separability of quantum states
- Asymptotics of random density matrices
- Entanglement thresholds for random induced states
- A new application of Random Matrices: Ext(C*_{red}(F_2)) is not a group
- Gaussianization and eigenvalue statistics for random quantum channels (III)
- Realigning random states
- The absolute positive partial transpose property for random induced 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