Entanglement and the truncated moment problem
arXiv:1704.02277 · doi:10.1103/PhysRevA.96.032312
Abstract
We map the quantum entanglement problem onto the mathematically well-studied truncated moment problem. This yields a necessary and sufficient condition for separability that can be checked by a hierarchy of semi-definite programs. The algorithm always gives a certificate of entanglement if the state is entangled. If the state is separable, typically a certificate of separability is obtained in a finite number of steps and an explicit decomposition into separable pure states can be extracted.
arXiv comment13 pages
References in corpus (33)
- Quantum entanglement
- Separability Criterion for Density Matrices
- Separability of Mixed States: Necessary and Sufficient Conditions
- Entanglement detection
- Characterizing Entanglement
- A complete family of separability criteria
- Quantum Correlations in Systems of Indistinguishable Particles
- Distinguishing separable and entangled states
- Taming multiparticle entanglement
- Generating random density matrices
- Separability in 2xN composite quantum systems
- Entanglement and permutational symmetry
- Operational criterion and constructive checks for the separability of low rank density matrices
- The geometric measure of entanglement for symmetric states
- Detecting multipartite entanglement
- Complete hierarchies of efficient approximations to problems in entanglement theory
- Classicality of spin states
- The power of symmetric extensions for entanglement detection
- Characterizing multiparticle entanglement in symmetric N-qubit states via negativity of covariance matrices
- Certifying Separability in Symmetric Mixed States, and Superradiance
- Tensor Representation of Spin States
- Four-qubit entangled symmetric states with positive partial transpositions
- Entangled symmetric states of N qubits with all positive partial transpositions
- Symmetric Extension of Two-Qubit States
- Exchange Symmetry and Multipartite Entanglement
- Multiqubit symmetric states with maximally mixed one-qubit reductions
- A two-way algorithm for the entanglement problem
- An improved semidefinite programming hierarchy for testing entanglement
- Multiparticle entanglement as an emergent phenomenon
- Partial transpose criteria for symmetric states
- Quantumness of spin-1 states
- `Classical' quantum states
- Parametrization of spin-1 classical states
Cited by in corpus (14)
- Optimal Entanglement Certification from Moments of the Partial Transpose
- Semidefinite programming relaxations for quantum correlations
- Unveiling quantum entanglement in many-body systems from partial information
- Dimension-free entanglement detection in multipartite Werner states
- Entanglement transitivity problems
- Certifying Quantum Separability with Adaptive Polytopes
- Optimal measurement strategies for fast entanglement detection
- Truncated moment sequences and a solution to the channel separability problem
- Nonequivalence between absolute separability and positive partial transposition in the symmetric subspace
- Revealing hidden physical nonclassicality with nonnegative polynomials
- Hybrid of Gradient Descent And Semidefinite Programming for Certifying Multipartite Entanglement Structure
- Bound entanglement in symmetric random induced states
- Certifying entanglement dimensionality by -reduction moments
- Quantum Entanglement, Symmetric Nonnegative Quadratic Polynomials and Moment Problems