An improved semidefinite programming hierarchy for testing entanglement
From MaRDI portal
Publication:529619
Abstract: We present a stronger version of the Doherty-Parrilo-Spedalieri (DPS) hierarchy of approximations for the set of separable states. Unlike DPS, our hierarchy converges exactly at a finite number of rounds for any fixed input dimension. This yields an algorithm for separability testing which is singly exponential in dimension and polylogarithmic in accuracy. Our analysis makes use of tools from algebraic geometry, but our algorithm is elementary and differs from DPS only by one simple additional collection of constraints.
Recommendations
- A quasipolynomial-time algorithm for the quantum separability problem
- Limitations of semidefinite programs for separable states and entangled games
- A two-way algorithm for the entanglement problem
- Distinguishing separable and entangled states
- Computational complexity of the quantum separability problem
Cites work
- scientific article; zbMATH DE number 52497 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 967945 (Why is no real title available?)
- Algebraic degree of polynomial optimization
- An exact Jacobian SDP relaxation for polynomial optimization
- Approximating the set of separable states using the positive partial transpose test
- Classical deterministic complexity of Edmonds' Problem and quantum entanglement
- Degree bounds for Gröbner bases of low-dimensional polynomial ideals
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- Epsilon-net method for optimizations over separable states
- Faithful squashed entanglement
- First and second order analysis of nonlinear semidefinite programs
- Geometric algorithms and combinatorial optimization.
- Hypercontractivity, sum-of-squares proofs, and their applications
- Improved soundness for QMA with multiple provers
- Near-optimal and explicit Bell inequality violations
- On QMA protocols with two short quantum proofs
- On quantum interactive proofs with short messages
- On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex
- On the Power of the PPT Constraint in the Symmetric Extensions Test for Separability
- On the combinatorial and algebraic complexity of quantifier elimination
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Pre- and Post-Processing Sum-of-Squares Programs in Practice
- Quantum de finetti theorems under local measurements with applications
- Quantum interactive proofs with weak error bounds
- Relative entropy and squashed entanglement
- Strong NP-hardness of the quantum separability problem
- Strong duality conditions in semidefinite programming
- Strong duality in lasserre's hierarchy for polynomial optimization
- Sum-of-squares proofs and the quest toward optimal algorithms
- Sums of squares, moment matrices and optimization over polynomials
- Testing product states, quantum Merlin-Arthur games and tensor optimization
- The power of unentanglement
- Undecidability of the Spectral Gap
- Which problems have strongly exponential complexity?
Cited in
(11)- Dimension-free entanglement detection in multipartite Werner states
- Entanglement meter: estimation of entanglement with single copy in interferometer
- Limitations of semidefinite programs for separable states and entangled games
- Entanglement diagnostics for efficient VQA optimization
- Bounding the separable rank via polynomial optimization
- scientific article; zbMATH DE number 7692356 (Why is no real title available?)
- Finite convergence of sum-of-squares hierarchies for the stability number of a graph
- \texttt{libCreme}: an optimization library for evaluating convex-roof entanglement measures
- Epsilon-net method for optimizations over separable states
- Relating an entanglement measure with statistical correlators for two-qudit mixed states using only a pair of complementary observables
- The power of unentangled quantum proofs with non-negative amplitudes
This page was built for publication: An improved semidefinite programming hierarchy for testing entanglement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q529619)
