Dimension-free entanglement detection in multipartite Werner states

Abstract

Werner states are multipartite quantum states that are invariant under the diagonal conjugate action of the unitary group. This paper gives a complete characterization of their entanglement that is independent of the underlying local Hilbert space: for every entangled Werner state there exists a dimension-free entanglement witness. The construction of such a witness is formulated as an optimization problem. To solve it, two semidefinite programming hierarchies are introduced. The first one is derived using real algebraic geometry applied to positive polynomials in the entries of a Gram matrix, and is complete in the sense that for every entangled Werner state it converges to a witness. The second one is based on a sum-of-squares certificate for the positivity of trace polynomials in noncommuting variables, and is a relaxation that involves smaller semidefinite constraints.

arXiv commentupdated abstract

References in corpus (31)

• Separability Criterion for Density Matrices
• Separability of Mixed States: Necessary and Sufficient Conditions
• Entanglement detection
• A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
• Integration with respect to the Haar measure on unitary, orthogonal and symplectic group
• Quantum steering: a review with focus on semidefinite programming
• A complete family of separability criteria
• Taming multiparticle entanglement
• One-and-a-half quantum de Finetti theorems
• Separability properties of tripartite states with UxUxU-symmetry
• Complete hierarchies of efficient approximations to problems in entanglement theory
• Exploiting symmetries in SDP-relaxations for polynomial optimization
• The power of symmetric extensions for entanglement detection
• Relaxations of separability in multipartite systems: Semidefinite programs, witnesses and volumes
• A Robust Semidefinite Programming Approach to the Separability Problem
• Sparse Noncommutative Polynomial Optimization
• Study of the Distillability of Werner States Using Entanglement Witnesses and Robust Semidefinite Programs
• MIP*=RE
• Long-range multipartite entanglement close to a first order quantum phase transition
• An improved semidefinite programming hierarchy for testing entanglement
• Unveiling quantum entanglement in many-body systems from partial information
• Semidefinite programming hierarchies for constrained bilinear optimization
• Efficient multi port-based teleportation schemes
• Optimization over trace polynomials
• Simplified formalism of the algebra of partially transposed permutation operators with applications
• Entanglement and the truncated moment problem
• Exact diagonalization of $\mathrm{SU}(N)$ Heisenberg and AKLT chains using the full $\mathrm{SU}(N)$ symmetry
• Positive maps and trace polynomials from the symmetric group
• Applications of semi-definite optimization in quantum information protocols
• A note on the Weingarten function
• Matrix forms of immanant inequalities

Cited by in corpus (14)

• Semidefinite programming relaxations for quantum correlations
• Classification of four-qubit entangled states via Machine Learning
• Entanglement detection with trace polynomials
• State polynomials: positivity, optimization and nonlinear Bell inequalities
• Introduction to quantum entanglement in many-body systems
• Linear programming with unitary-equivariant constraints
• Multiparticle singlet states cannot be maximally entangled for the bipartitions
• Positive maps from the walled Brauer algebra
• $su(d)$-squeezing and many-body entanglement geometry in finite-dimensional systems
• Refuting spectral compatibility of quantum marginals
• State-witness contraction
• Entanglement and distillation from symmetric positive maps
• Positivity of state, trace, and moment polynomials, and applications in quantum information
• Iterative construction of ${\mathfrak{S}}_p\times {\mathfrak{S}}_p$ group-adapted irreducible matrix units for the walled Brauer algebra