相关论文: Checking $2 \times M$ separability via semidefinit…

The quantum marginal problem asks whether a set of given density matrices are consistent, i.e., whether they can be the reduced density matrices of a global quantum state. Not many non-trivial analytic necessary (or sufficient) conditions…

It is known that every complex square matrix with nonnegative determinant is the product of positive semi-definite matrices. There are characterizations of matrices that require two or five positive semi-definite matrices in the product.…

We study the problem of determining whether a given graph~$G=(V,E)$ admits a matching~$M$ whose removal destroys all odd cycles of~$G$ (or equivalently whether~$G-M$ is bipartite). This problem is equivalent to determine whether~$G$ admits…

We provide a necessary and sufficient condition for separability of Gaussian states of bipartite systems of arbitrarily many modes. The condition provides an operational criterion since it can be checked by simple computation. Moreover, it…

Explicit separable density matrices, for mixed two qubits states, are derived by the use of Hilbert Schmidt decompositions and Peres Horodecki criterion. A strongly separable two qubits mixed state is defined by multiplications of two…

This paper addresses the problem of decomposing a numerical semigroup into m-irreducible numerical semigroups. The problem originally stated in algebraic terms is translated, introducing the so called Kunz-coordinates, to resolve a series…

We seek to derive the probability--expressed in terms of the Hilbert-Schmidt (Euclidean or flat) metric--that a generic (nine-dimensional) real two-qubit system is separable, by implementing the well-known Peres-Horodecki test on the…

The quantum separability problem consists in deciding whether a bipartite density matrix is entangled or separable. In this work, we propose a machine learning pipeline for finding approximate solutions for this NP-hard problem in…

In semidefinite programming (SDP), unlike in linear programming, Farkas' lemma may fail to prove infeasibility. Here we obtain an exact, short certificate of infeasibility in SDP by an elementary approach: we reformulate any semidefinite…

We give a short proof of the cross norm characterization of separability due to O. Rudolph and show how its computation, for a fixed chosen error, can be reduced to a linear programming problem whose dimension grows polynomially with the…

For a degree 2n finite sequence of real numbers $\beta \equiv \beta^{(2n)}= \{ \beta_{00},\beta_{10}, \beta_{01},\cdots, \beta_{2n,0}, \beta_{2n-1,1},\cdots, \beta_{1,2n-1},\beta_{0,2n} \}$ to have a representing measure $\mu $, it is…

We discuss optimization problems over convex cones in which membership is difficult to verify directly. In the standard theory of duality, vectors in the dual cone $K^*$ are associated with separating hyperplanes and interpreted as…

Recently, a new and powerful separability criterion was introduced in [O. Rudolph, quant-ph/0202121] and [Chen {\it et al.}, quant-ph/0205017]. Composing the main idea behind the above criterion and the necessary and sufficient condition in…

Using the dual cone of sums of nonnegative circuits (SONC), we provide a relaxation of the global optimization problem to minimize an exponential sum and, as a special case, a multivariate real polynomial. Our approach builds on two key…

We study the decidability of the Skolem Problem, the Positivity Problem, and the Ultimate Positivity Problem for linear recurrences with real number initial values and real number coefficients in the bit-model of real computation. We show…

In this paper we study decidability and complexity of decision problems on matrices from the special linear group $\mathrm{SL}(2,\mathbb{Z})$. In particular, we study the freeness problem: given a finite set of matrices $G$ generating a…

We propose a unifying approach to the separability problem using covariance matrices of locally measurable observables. From a practical point of view, our approach leads to strong entanglement criteria that allow to detect the entanglement…

We construct a single observable measurement of which mean value on four copies of an {\it unknown} two-qubit state is sufficient for unambiguous decision whether the state is separable or entangled. In other words, there exists a universal…

This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X of S, decide whether each element of S has at most one factorization over X. To…

The problem of quantum state classification asks how accurately one can identify an unknown quantum state that is promised to be drawn from a known set of pure states. In this work, we introduce the notion of $k$-learnability, which…