A semidefinite program for distillable entanglement

DOI10.1109/18.959270zbMATH Open0998.81012OpenAlexW2124792389MaRDI QIDQ4544733FDOQ4544733

Authors Eric Rains

Publication date 4 August 2002

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/0008047

zbMATH Keywords

isotropic and Werner stateslower and upper bounds on p.p.t.maximum fidelitypositive partial transpose distillation protocol

Mathematics Subject Classification ID

Communication theory (94A05) Semidefinite programming (90C22) Quantum computation (81P68) Applications of operator theory in the physical sciences (47N50) Quantum measurement theory, state operations, state preparations (81P15)

Abstract: We show that the maximum fidelity obtained by a p.p.t. distillation protocol is given by the solution to a certain semidefinite program. This gives a number of new lower and upper bounds on p.p.t. distillable entanglement (and thus new upper bounds on 2-locally distillable entanglement). In the presence of symmetry, the semidefinite program simplifies considerably, becoming a linear program in the case of isotropic and Werner states. Using these techniques, we determine the p.p.t. distillable entanglement of asymmetric Werner states and ``maximally correlated states. We conclude with a discussion of possible applications of semidefinite programming to quantum codes and 1-local distillation.

Recommendations

• A family of norms with applications in quantum information theory. II
• Distinguishing separable and entangled states
• Bounds on localizable information via semidefinite programming
• The distillability problem revisited
• Limitations of semidefinite programs for separable states and entangled games

Cited in

(50)

• Discrimination of quantum states under locality constraints in the many-copy setting
• A family of norms with applications in quantum information theory. II
• Entanglement of pair cat states and teleportation
• A semidefinite programming approach to optimal unambiguous discrimination of quantum states
• Amortized entanglement of a quantum channel and approximately teleportation-simulable channels
• Limitations of semidefinite programs for separable states and entangled games
• Finite quantum tomography and semidefinite programming
• APPLICATION OF PAIR COHERENT STATES IN QUANTUM INFORMATION PROCESSES
• Geometric Rényi divergence and its applications in quantum channel capacities
• On variational expressions for quantum relative entropies
• Quantum entanglement
• Computable entanglement conversion witness that is better than the negativity
• Characterizing quantumness via entanglement creation
• INTRODUCTION TO THE BASICS OF ENTANGLEMENT THEORY IN CONTINUOUS-VARIABLE SYSTEMS
• NOTES ON THE FIDELITY OF SYMPLECTIC QUANTUM ERROR-CORRECTING CODES
• “Squashed entanglement”: An additive entanglement measure
• Additivity and non-additivity of multipartite entanglement measures
• Relative entropy bounds on quantum, private and repeater capacities
• A reversible theory of entanglement and its relation to the second law
• \texttt{libCreme}: an optimization library for evaluating convex-roof entanglement measures
• Entanglement of formation for a class of quantum states
• Linear programming with unitary-equivariant constraints
• Everything you always wanted to know about LOCC (but were afraid to ask)
• Spin chains and channels with memory
• A two-way algorithm for the entanglement problem
• An entanglement measure based on the capacity of dense coding
• Assessing assay variability of pesticide metabolites in the presence of heavy left-censoring
• Positivity of linear maps under tensor powers
• Coherence concurrence for X states
• Attainability and lower semi-continuity of the relative entropy of entanglement and variations on the theme
• On the power of quantum entanglement in multipartite quantum XOR games
• Solving the fully entangled fraction on near-term quantum devices
• Entanglement convertibility for infinite-dimensional pure bipartite states
• Bounds on localizable information via semidefinite programming
• On the Chernoff distance for asymptotic LOCC discrimination of bipartite quantum states
• Computable lower bounds on the entanglement cost of quantum channels
• Relaxations of separability in multipartite systems: Semidefinite programs, witnesses and volumes
• EXACT CALCULATION OF ROBUSTNESS OF ENTANGLEMENT VIA CONVEX SEMI-DEFINITE PROGRAMMING
• Distinguishing separable and entangled states
• Converse bounds for quantum and private communication over Holevo-Werner channels
• Capacity estimates via comparison with TRO channels
• Fundamentals of quantum information theory
• BEST SEPARABLE APPROXIMATION WITH SEMI-DEFINITE PROGRAMMING METHOD
• Binegativity of two qubits under noise
• Schmidt-correlated states, weak Schmidt decomposition and generalized Bell bases related to Hadamard matrices
• Semidefinite programming hierarchies for constrained bilinear optimization
• Fidelity between one bipartite quantum state and another undergoing local unitary dynamics
• An Extension of Entanglement Measures for Pure States
• Semi-definite programming and quantum information
• Relative entropy of steering: on its definition and properties

This page was built for publication: A semidefinite program for distillable entanglement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544733)