Related papers: Best separable approximation with semi-definite pr…
We derive an integral convex combination of product states for a range of separable Werner states. Our method consists of expanding the sought-after local density operators in terms of Wigner operators. For dimension d=2, our decomposition…
We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…
Semidefinite programs (SDPs) are a framework for exact or approximate optimization that have widespread application in quantum information theory. We introduce a new method for using reductions to construct integrality gaps for SDPs. These…
The Lewenstein-Sanpera decomposition for a generic two-qubit density matrix is obtained by using Wootters's basis. It is shown that the average concurrence of the decomposition is equal to the concurrence of the state. It is also shown that…
Hilbert-Schmidt (HS) decompositions and Frobenius norms are used to analyze biseparability of 3-qubit systems, with particular emphasis on density matrices with maximally disordered subsystems (MDS) and on the W state mixed with white…
A decomposition form is introduced in this report to establish a criterion for the bi-partite separability of Bell diagonal states. A such criterion takes a quadratic form of the coefficients of a given Bell diagonal states and can be…
We show how to decompose any density matrix of the simplest binary composite systems, whether separable or not, in terms of only product vectors. We determine for all cases the minimal number of product vectors needed for such a…
We consider the problem of designing an optimal quantum detector to minimize the probability of a detection error when distinguishing between a collection of quantum states, represented by a set of density operators. We show that the design…
We introduce a new method to reconstruct unknown quantum states out of incomplete and noisy information. The method is a linear convex optimization problem, therefore with a unique minimum, which can be efficiently solved with Semidefinite…
The structural study of entanglement in multipartite systems is hindered by the lack of necessary and sufficient operational criteria able to discriminate among the various entanglement properties of a given mixed state. Here, we pursue a…
We present a new method of analytically deriving the entanglement of formation of the bipartite mixed state. The method realizes the optimal decomposition families of states. Our method can lead to many new results concerning entanglement…
Motivated by applications in wireless communications, this paper develops semidefinite programming (SDP) relaxation techniques for some mixed binary quadratically constrained quadratic programs (MBQCQP) and analyzes their approximation…
The bipartite entanglement of a pure quantum state is known to be characterized by its Schmidt decomposition. In particular the state is maximally entangled when all the Schmidt coefficients are equal. We point out a convenient method which…
A new additive and semidefinite programming (SDP) computable entanglement measure is introduced to upper bound the amount of distillable entanglement in bipartite quantum states by operations completely preserving the positivity of partial…
In this paper, we propose a low-rank coordinate descent approach to structured semidefinite programming with diagonal constraints. The approach, which we call the Mixing method, is extremely simple to implement, has no free parameters, and…
Semidefinite programs (SDPs) are a particular class of convex optimization problems with applications in combinatorial optimization, operational research, and quantum information science. Seminal work by Brand\~{a}o and Svore shows that a…
In this report, a scheme different from the PT and Wootters concurrence is developed to acquire a criterion to investigate the bipartite separability of the Werner state.
We prove limitations on LOCC and separable measurements in bipartite state discrimination problems using techniques from convex optimization. Specific results that we prove include: an exact formula for the optimal probability of correctly…
Production and verification of multipartite quantum state are an essential step in quantum information processing. In this work, we propose an efficient method to decompose symmetric multipartite observables, which are invariant under…
In this paper, we propose an approximate semi-definite programming framework for demodulation and equalization of non-coherent ultra-wide-band communication systems with inter-symbol-interference. It is assumed that the communication…