Computable entanglement cost under positive partial transpose operations

Abstract

Quantum information theory is plagued by the problem of regularisations, which require the evaluation of formidable asymptotic quantities. This makes it computationally intractable to gain a precise quantitative understanding of the ultimate efficiency of key operational tasks such as entanglement manipulation. Here we consider the problem of computing the asymptotic entanglement cost of preparing noisy quantum states under quantum operations with positive partial transpose (PPT). By means of an analytical example, a previously claimed solution to this problem is shown to be incorrect. Building on a previous characterisation of the PPT entanglement cost in terms of a regularised formula, we construct instead a hierarchy of semi-definite programs that bypasses the issue of regularisation altogether, and converges to the true asymptotic value of the entanglement cost. Our main result establishes that this convergence happens exponentially fast, thus yielding an efficient algorithm that approximates the cost up to an additive error $\epsilon$ in time $\mathrm{poly}(D,\log (1/\epsilon ))$, where $D$ is the underlying Hilbert space dimension. To our knowledge, this is the first time that an asymptotic entanglement measure is shown to be efficiently computable despite no closed-form formula being available.

arXiv comment8+23 pages, no figures. In v2 we corrected several typos and changed the title to match the published version, to which v2 is very close

References in corpus (55)

• Entanglement of Formation of an Arbitrary State of Two Qubits
• Mixed State Entanglement and Quantum Error Correction
• Separability Criterion for Density Matrices
• A computable measure of entanglement
• Separability of Mixed States: Necessary and Sufficient Conditions
• Concentrating Partial Entanglement by Local Operations
• Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
• The logarithmic negativity: A full entanglement monotone that is not convex
• Separability criterion and inseparable mixed states with positive partial transposition
• Mixed-state entanglement and distillation: is there a ``bound'' entanglement in nature?
• Conditions for a class of entanglement transformations
• Distillation of secret key and entanglement from quantum states
• The capacity of the noisy quantum channel
• A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
• Entanglement-Assisted Classical Capacity of Noisy Quantum Channels
• Robustness of entanglement
• Superadditivity of communication capacity using entangled inputs
• Entanglement negativity in quantum field theory
• Entanglement Measures under Symmetry
• A complete family of separability criteria
• Quantum Communication With Zero-Capacity Channels
• The asymptotic entanglement cost of preparing a quantum state
• An improved bound on distillable entanglement
• The entanglement cost under operations preserving the positivity of partial transpose
• Entanglement negativity in extended systems: A field theoretical approach
• Entangling operations and their implementation using a small amount of entanglement
• The Uniqueness Theorem for Entanglement Measures
• Finite temperature entanglement negativity in conformal field theory
• Entanglement negativity in the harmonic chain out of equilibrium
• Irreversibility for all bound entangled states
• Entanglement negativity and topological order
• Counterexamples to the maximal p-norm multiplicativity conjecture for all p > 1
• The entanglement negativity in random spin chains
• Construction of quantum states with bound entanglement
• Unbounded number of channel uses are required to see quantum capacity
• Entanglement negativity and entropy in non-equilibrium conformal field theory
• Asymptotic Relative Entropy of Entanglement for Orthogonally Invariant States
• Quantum SDP-Solvers: Better upper and lower bounds
• Semidefinite Programming in Quantum Information Science
• Semidefinite programming strong converse bounds for classical capacity
• Distillability via protocols respecting the positivity of partial transpose
• Cost of quantum entanglement simplified
• Dynamical Entanglement
• Entanglement cost in practical scenarios
• No second law of entanglement manipulation after all
• Binegativity and geometry of entangled states in two qubits
• Counterexamples to additivity of minimum output p-Renyi entropy for p close to 0
• Irreversibility of Asymptotic Entanglement Manipulation Under Quantum Operations Completely Preserving Positivity of Partial Transpose
• An improved semidefinite programming hierarchy for testing entanglement
• Defining quantum divergences via convex optimization
• Semidefinite programming hierarchies for constrained bilinear optimization
• Equivalence of Additivity Questions in Quantum Information Theory
• Distillable entanglement under dually non-entangling operations
• Exact entanglement cost of quantum states and channels under PPT-preserving operations
• A hierarchy of efficient bounds on quantum capacities exploiting symmetry

Cited by in corpus (1)

• Asymptotic quantification of entanglement with a single copy