A semidefinite program for distillable entanglement
From MaRDI portal
Publication:4544733
DOI10.1109/18.959270zbMATH Open0998.81012arXivquant-ph/0008047OpenAlexW2124792389MaRDI QIDQ4544733FDOQ4544733
Authors: Eric Rains 
Publication date: 4 August 2002
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/quant-ph/0008047
Recommendations
isotropic and Werner stateslower and upper bounds on p.p.t.maximum fidelitypositive partial transpose distillation protocol
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)
Cited In (49)
- Converse bounds for quantum and private communication over Holevo–Werner channels
- Finite quantum tomography and semidefinite programming
- Additivity and non-additivity of multipartite entanglement measures
- Fidelity between one bipartite quantum state and another undergoing local unitary dynamics
- Semi-definite programming and quantum information
- An Extension of Entanglement Measures for Pure States
- Limitations of semidefinite programs for separable states and entangled games
- An entanglement measure based on the capacity of dense coding
- EXACT CALCULATION OF ROBUSTNESS OF ENTANGLEMENT VIA CONVEX SEMI-DEFINITE PROGRAMMING
- Entanglement of pair cat states and teleportation
- APPLICATION OF PAIR COHERENT STATES IN QUANTUM INFORMATION PROCESSES
- 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
- On variational expressions for quantum relative entropies
- Solving the fully entangled fraction on near-term quantum devices
- Bounds on localizable information via semidefinite programming
- Geometric Rényi divergence and its applications in quantum channel capacities
- Entanglement convertibility for infinite-dimensional pure bipartite states
- A reversible theory of entanglement and its relation to the second law
- Relaxations of separability in multipartite systems: Semidefinite programs, witnesses and volumes
- Amortized entanglement of a quantum channel and approximately teleportation-simulable channels
- A family of norms with applications in quantum information theory. II
- Computable entanglement conversion witness that is better than the negativity
- Characterizing quantumness via entanglement creation
- Entanglement of formation for a class of quantum states
- Fundamentals of quantum information theory
- A two-way algorithm for the entanglement problem
- Positivity of linear maps under tensor powers
- Coherence concurrence for X states
- Everything you always wanted to know about LOCC (but were afraid to ask)
- Assessing assay variability of pesticide metabolites in the presence of heavy left-censoring
- Binegativity of two qubits under noise
- Linear programming with unitary-equivariant constraints
- On the power of quantum entanglement in multipartite quantum XOR games
- Distinguishing separable and entangled states
- Computable lower bounds on the entanglement cost of quantum channels
- Quantum entanglement
- Capacity estimates via comparison with TRO channels
- Schmidt-correlated states, weak Schmidt decomposition and generalized Bell bases related to Hadamard matrices
- Spin chains and channels with memory
- \texttt{libCreme}: an optimization library for evaluating convex-roof entanglement measures
- A semidefinite programming approach to optimal unambiguous discrimination of quantum states
- Relative entropy bounds on quantum, private and repeater capacities
- On the Chernoff distance for asymptotic LOCC discrimination of bipartite quantum states
- Attainability and lower semi-continuity of the relative entropy of entanglement and variations on the theme
- BEST SEPARABLE APPROXIMATION WITH SEMI-DEFINITE PROGRAMMING METHOD
- Relative entropy of steering: on its definition and properties
- Discrimination of quantum states under locality constraints in the many-copy setting
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)
