Approximating the Set of Separable States Using the Positive Partial Transpose Test

Abstract

The positive partial transpose test is one of the main criteria for detecting entanglement, and the set of states with positive partial transpose is considered as an approximation of the set of separable states. However, we do not know to what extent this criterion, as well as the approximation, are efficient. In this paper, we show that the positive partial transpose test gives no bound on the distance of a density matrix from separable states. More precisely, we prove that, as the dimension of the space tends to infinity, the maximum trace distance of a positive partial transpose state from separable states tends to 1. Using similar techniques, we show that the same result holds for other well-known separability criteria such as reduction criterion, majorization criterion and symmetric extension criterion. We also bring an evidence that the sets of positive partial transpose states and separable states have totally different shapes.

12 pages, published version

References in corpus (9)

• A complete family of separability criteria
• One-and-a-half quantum de Finetti theorems
• Entanglement Theory and the Second Law of Thermodynamics
• A Generalization of Quantum Stein's Lemma
• The volume of separable states is super-doubly-exponentially small
• Geometry of sets of quantum maps: a generic positive map acting on a high-dimensional system is not completely positive
• Non-additivity of Renyi entropy and Dvoretzky's Theorem
• On the Bures Volume of Separable Quantum States
• Strong NP-Hardness of the Quantum Separability Problem

Cited by in corpus (18)

• Hypercontractivity, Sum-of-Squares Proofs, and their Applications
• Enhanced entanglement criterion via symmetric informationally complete measurements
• Relaxations of separability in multipartite systems: Semidefinite programs, witnesses and volumes
• The Church of the Symmetric Subspace
• Non-Positive Partial Transpose Subspaces Can be as Large as Any Entangled Subspace
• On a gap in the proof of the generalised quantum Stein's lemma and its consequences for the reversibility of quantum resources
• Genuine multipartite entanglement of quantum states in the multiple-copy scenario
• An improved semidefinite programming hierarchy for testing entanglement
• How often is a random quantum state k-entangled?
• Limitations of semidefinite programs for separable states and entangled games
• Bound entangled states with extremal properties
• Entanglement witnesses with variable number of local measurements
• Hybrid Zero-capacity Channels
• One-shot rates for entanglement manipulation under non-entangling maps
• Extendible quantum measurements and limitations on classical communication
• Analysing multiparticle quantum states
• Construction and properties of a class of private states in arbitrary dimensions
• Unlimited quantum correlation advantage from bound entanglement