Improved Semidefinite Programming Upper Bound on Distillable Entanglement

Abstract

A new additive and semidefinite programming (SDP) computable entanglement measure is introduced to upper bound the amount of distillable entanglement in bipartite quantum states by operations completely preserving the positivity of partial transpose (PPT). This quantity is always smaller than or equal to the logarithmic negativity, the previously best known SDP bound on distillable entanglement, and the inequality is strict in general. Furthermore, a succinct SDP characterization of the one-copy PPT deterministic distillable entanglement for any given state is also obtained, which provides a simple but useful lower bound on the PPT distillable entanglement. Remarkably, there is a genuinely mixed state of which both bounds coincide with the distillable entanglement while being strictly less than the logarithmic negativity.

5 pages, 2 figures, v4 improved presentation and slightly changed title

References in corpus (2)

• Pure-state transformations and catalysis under operations that completely preserve positivity of partial transpose
• Efficiency of Deterministic Entanglement Transformation

Cited by in corpus (37)

• Optimizing practical entanglement distillation
• Quantifying the magic of quantum channels
• Efficiently computable bounds for magic state distillation
• Convex geometry of quantum resource quantification
• Principles of Quantum Communication Theory: A Modern Approach
• Semidefinite programming strong converse bounds for classical capacity
• Cost of quantum entanglement simplified
• Semidefinite programming relaxations for quantum correlations
• Non-asymptotic entanglement distillation
• Useful states and entanglement distillation
• No second law of entanglement manipulation after all
• Entanglement cost and quantum channel simulation
• Semidefinite programming converse bounds for quantum communication
• Detecting and quantifying entanglement on near-term quantum devices
• Practical distributed quantum information processing with LOCCNet
• Entanglement and secret-key-agreement capacities of bipartite quantum interactions and read-only memory devices
• Irreversibility of Asymptotic Entanglement Manipulation Under Quantum Operations Completely Preserving Positivity of Partial Transpose
• One-shot entanglement distillation beyond local operations and classical communication
• Amortization does not enhance the max-Rains information of a quantum channel
• Nonadditivity of Rains' bound for distillable entanglement
• Defining quantum divergences via convex optimization
• $\alpha$-Logarithmic negativity
• Practical measurement-device-independent entanglement quantification
• Pursuing the fundamental limits for quantum communication
• Indistinguishability of bipartite states by positive-partial-transpose operations in the many-copy scenario
• Exact entanglement cost of quantum states and channels under PPT-preserving operations
• Quantifying the performance of approximate teleportation and quantum error correction via symmetric two-PPT-extendibility
• Estimate distillable entanglement and quantum capacity by squeezing useless entanglement
• Hierarchy of quantum operations in manipulating coherence and entanglement
• Quantifying the unextendibility of entanglement
• Approximate broadcasting of quantum correlations
• Generalizing Entanglement
• Information-theoretic aspects of the generalized amplitude damping channel
• Quantifying magic via quantum $(\alpha ,\beta )$ Jensen-Shannon divergence
• State-witness contraction
• Genuinely entangled subspaces beyond strongly nonlocal unextendible biseparable bases
• Tripartite-to-bipartite Entanglement Transformation by Stochastic Local Operations and Classical Communication and the Structure of Matrix Spaces