Publication:3172441
From MaRDI portal
zbMath1234.81033arXiv0810.4507MaRDI QIDQ3172441
Publication date: 5 October 2011
Full work available at URL: https://arxiv.org/abs/0810.4507
NP-hard; entanglement; entanglement detection; weak membership; entanglement-breaking; quantum separability problem
81P40: Quantum coherence, entanglement, quantum correlations
Related Items
Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling, Dvoretzky's theorem and the complexity of entanglement detection, Pairwise Completely Positive Matrices and Conjugate Local Diagonal Unitary Invariant Quantum States, Approximating the set of separable states using the positive partial transpose test, Can quantum entanglement detection schemes improve search?, Epsilon-net method for optimizations over separable states, An improved semidefinite programming hierarchy for testing entanglement, Faithful squashed entanglement, An algorithm based on negative probabilities for a separability criterion, Quantum one-way permutation over the finite field of two elements, Limitations of semidefinite programs for separable states and entangled games, The inverse eigenvalue problem for entanglement witnesses, Calculation of quantum discord in higher dimensions for \(X\)- and other specialized states, Shorter unentangled proofs for ground state connectivity, Entanglement criterion via general symmetric informationally complete measurements, Product vectors in the ranges of multi-partite states with positive partial transposes and permanents of matrices, k-Extendibility of high-dimensional bipartite quantum states
