An improved semidefinite programming hierarchy for testing entanglement

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.

22 pages. v2: published version, adds numerical results. Matlab code available at https://github.com/isobovine/dpsplus/

References in corpus (6)

• A complete family of separability criteria
• Short Multi-Prover Quantum Proofs for SAT without Entangled Measurements
• The Complexity of the Consistency and N-representability Problems for Quantum States
• Multi-Prover Quantum Merlin-Arthur Proof Systems with Small Gap
• Estimating operator norms using covering nets
• Hybrid Zero-capacity Channels

Cited by in corpus (23)

• Quantifying high dimensional entanglement with two mutually unbiased bases
• Semidefinite programming strong converse bounds for classical capacity
• Semidefinite programming relaxations for quantum correlations
• Non-asymptotic entanglement distillation
• Optimization of device-independent witnesses of entanglement depth from two-body correlators
• Quantum Interior Point Methods for Semidefinite Optimization
• Efficient Online Quantum Generative Adversarial Learning Algorithms with Applications
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver
• Entanglement and the truncated moment problem
• Dimension-free entanglement detection in multipartite Werner states
• Solvable Criterion for the Contextuality of any Prepare-and-Measure Scenario
• Limitations of semidefinite programs for separable states and entangled games
• Entanglement transitivity problems
• Finite convergence of sum-of-squares hierarchies for the stability number of a graph
• A Complete Hierarchy of Linear Systems for Certifying Quantum Entanglement of Subspaces
• Computable entanglement cost under positive partial transpose operations
• Five Starter Pieces: Quantum Information Science via Semi-definite Programs
• Worst-case Quantum Hypothesis Testing with Separable Measurements
• Entanglement Meter: Estimation of entanglement with single copy in Interferometer
• A hierarchy of eigencomputations for polynomial optimization on the sphere
• Macaulay bases of modules
• Bounding Real Tensor Optimizations via the Numerical Range
• Local Purity Distillation in Quantum Systems: Exploring the Complementarity Between Purity and Entanglement