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.

8+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 (15)

• Distillation of secret key and entanglement from quantum states
• A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
• Entanglement negativity in quantum field theory
• A complete family of separability criteria
• Quantum Communication With Zero-Capacity Channels
• Finite temperature entanglement negativity in conformal field theory
• Entanglement negativity in the harmonic chain out of equilibrium
• Unbounded number of channel uses are required to see quantum capacity
• Entanglement negativity and entropy in non-equilibrium conformal field theory
• Semidefinite Programming in Quantum Information Science
• Cost of quantum entanglement simplified
• Dynamical Entanglement
• Binegativity and geometry of entangled states in two qubits
• Counterexamples to additivity of minimum output p-Renyi entropy for p close to 0
• Distillable entanglement under dually non-entangling operations

Cited by in corpus (1)

• Asymptotic quantification of entanglement with a single copy