BEST SEPARABLE APPROXIMATION WITH SEMI-DEFINITE PROGRAMMING METHOD

DOI10.1142/S0219749904000924zbMath1061.81011arXivquant-ph/0606075OpenAlexW2160287263MaRDI QIDQ4659847

No author found.

Publication date: 21 March 2005

Published in: International Journal of Quantum Information (Search for Journal in Brave)

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

zbMATH Keywords

semi-definite programmingBell decomposable statesoptimal Lewenstein-Sanpera decompositionWerner and isotropic states

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (2)

GROUP THEORETICAL APPROACH TO QUANTUM ENTANGLEMENT AND TOMOGRAPHY WITH WAVELET TRANSFORM IN BANACH SPACES ⋮ The minimum-error discrimination via Helstrom family of ensembles and convex optimization

Cites Work

• Separability of mixed states: necessary and sufficient conditions.
• Separable approximations of density matrices of composite quantum systems
• Separability of entangled q-bit pairs
• Optimal Lewenstein–Sanpera decomposition for some bipartite systems
• Separability Criterion for Density Matrices
• Bound Entanglement Can Be Activated
• A semidefinite program for distillable entanglement
• Semidefinite Programming
• Entanglement of Formation of an Arbitrary State of Two Qubits
• Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model
• Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
• [https://portal.mardi4nfdi.de/wiki/Publication:5762040 Die gegenw�rtige Situation in der Quantenmechanik]
• Separability and the stella octangula

This page was built for publication: BEST SEPARABLE APPROXIMATION WITH SEMI-DEFINITE PROGRAMMING METHOD