Related papers: Best separable approximation with semi-definite pr…
We use Robust Semidefinite Programs and Entanglement Witnesses to study the distillability of Werner states. We perform exact numerical calculations which show 2-undistillability in a region of the state space which was previously…
We compute the probability that a bipartite quantum state is separable by Monte Carlo sampling. This is carried out for rebits, qubits and quaterbits. We sampled $5\times 10^{11}$ points for each of these three cases. The results strongly…
We analyse the reconstruction of an unknown pure qubit state. We derive the optimal guess that can be inferred from any set of measurements on N identical copies of the system with the fidelity as a figure of merit. We study in detail the…
Summary. A simple derivation of finite Schmidt decomposition of pure states describing finite dimensional systems interacting with the infinite dimensional ones is presented. In particular, maximally entangled pure states in such systems…
A matrix optimization problem over an uncertain linear system on finite horizon (abbreviated as MOPUL) is studied, in which the uncertain transition matrix is regarded as a decision variable. This problem is in general NP-hard. By using the…
Many protocols of quantum information processing use entangled states. Hence, separability criteria are of great importance. We propose new separability conditions for a bipartite finite-dimensional system. They are derived by using…
Numerical approximation of quantum states via convex combinations of states with positive partial transposes (bi-PPT state) in multipartite systems constitutes a fundamental challenge in quantum information science. We reformulate this…
In this paper, we consider the problem of partitioning a small data sample of size $n$ drawn from a mixture of 2 sub-gaussian distributions in $\R^p$. We consider semidefinite programming relaxations of an integer quadratic program that is…
We develop a practical approach to semidefinite programming (SDP) that includes the von Neumann entropy, or an appropriate variant, as a regularization term. In particular we solve the dual of the regularized program, demonstrating how a…
Two families of bipartite mixed quantum states are studied for which it is proved that the number of members in the optimal-decomposition ensemble --- the ensemble realizing the entanglement of formation --- is greater than the rank of the…
In this paper, we give out some effective criterions which can be used to judge the separability of multipartite pure states. We obtain the relationship between separability and Schmidt decomposable of multipartite pure states in Theorem1.…
The strong numerical approximation of semilinear stochastic partial differential equations (SPDEs) driven by infinite dimensional Wiener processes is investigated. There are a number of results in the literature that show that Euler-type…
We use semidefinite programming to bound the fractional cut-cover parameter of graphs in association schemes in terms of their smallest eigenvalue. We also extend the equality cases of a primal-dual inequality involving the…
In this paper, we propose an efficient semidefinite programming (SDP) approach to worst-case linear discriminant analysis (WLDA). Compared with the traditional LDA, WLDA considers the dimensionality reduction problem from the worst-case…
In quantum embedding theories, a quantum many-body system is divided into localized clusters of sites which are treated with an accurate `high-level' theory and glued together self-consistently by a less accurate `low-level' theory at the…
The reduction criterion is a well known necessary condition for separable states, and states violating this condition are entangled and also 1-distillable. In this paper we introduce a new set of necessary conditions for separability of…
We present an iterative algorithm based on semidefinite programming (SDP) for computing the quantum smooth max-mutual information $I^\varepsilon_{\max}(\rho_{AB})$ of bipartite quantum states in any dimension. The algorithm is accurate if a…
We apply semidefinite programming for designing 1 to 2 symmetric qubit quantum cloners. These are optimized for the average fidelity of their joint output state with respect to a product of multiple originals. We design 1 to 2 quantum bit…
We construct an optimal state merging protocol by adapting a recently-discovered optimal entanglement distillation protcol [Renes and Boileau, Phys. Rev. A . 73, 032335 (2008)]. The proof of optimality relies only on directly establishing…
Recently, a lot of attention has been devoted to finding physically realisable operations that realise as closely as possible certain desired transformations between quantum states, e.g. quantum cloning, teleportation, quantum gates, etc.…