Related papers: Practical construction of positive maps which are …
This paper presents a new Matlab toolbox, aimed at facilitating the use of polynomial optimization for stability analysis of nonlinear systems. In the past decade several decisive contributions made it possible to recast this type of…
Genuine entanglement is the strongest form of multipartite entanglement. Genuinely entangled pure states contain entanglement in every bipartition and as such can be regarded as a valuable resource in the protocols of quantum information…
We investigate the set a) of positive, trace preserving maps acting on density matrices of size N, and a sequence of its nested subsets: the sets of maps which are b) decomposable, c) completely positive, d) extended by identity impose…
MAP inference for general energy functions remains a challenging problem. While most efforts are channeled towards improving the linear programming (LP) based relaxation, this work is motivated by the quadratic programming (QP) relaxation.…
A map $\mathcal{P}$ is tensor stable positive (tsp) if $\mathcal{P}^{\otimes n}$ is positive for all $n$, and essential tsp if it is not completely positive or completely co-positive. Are there essential tsp maps? Here we prove that there…
Quantum entanglement is essential to the development of quantum computation, communications, and technology. The controlled SWAP test, widely used for state comparison, can be adapted to an efficient and useful test for entanglement of a…
This paper presents PIQP, a high-performance toolkit for solving generic sparse quadratic programs (QP). Combining an infeasible Interior Point Method (IPM) with the Proximal Method of Multipliers (PMM), the algorithm can handle…
Computing maximum a posteriori (MAP) estimation in graphical models is an important inference problem with many applications. We present message-passing algorithms for quadratic programming (QP) formulations of MAP estimation for pairwise…
We analyze positivity of a tensor product of two linear qubit maps, $\Phi_1 \otimes \Phi_2$. Positivity of maps $\Phi_1$ and $\Phi_2$ is a necessary but not a sufficient condition for positivity of $\Phi_1 \otimes \Phi_2$. We find a…
Two fundamental contributions to categorical quantum mechanics are presented. First, we generalize the CP-construction, that turns any dagger compact category into one with completely positive maps, to arbitrary dimension. Second, we…
Copositive optimization is a special case of convex conic programming, and it consists of optimizing a linear function over the cone of all completely positive matrices under linear constraints. Copositive optimization provides powerful…
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been applied in several applications, it does not always result in…
The problem of minimizing a (nonconvex) quadratic form over the unit simplex, referred to as a standard quadratic program, admits an exact convex conic formulation over the computationally intractable cone of completely positive matrices.…
Matrices with low numerical rank are omnipresent in many signal processing and data analysis applications. The pivoted QLP (p-QLP) algorithm constructs a highly accurate approximation to an input low-rank matrix. However, it is…
Clustering is a popular unsupervised learning tool often used to discover groups within a larger population such as customer segments, or patient subtypes. However, despite its use as a tool for subgroup discovery and description - few…
In quantum information theory, it is a fundamental problem to construct multipartite unextendible product bases (UPBs). We show that there exist two families UPBs in Hilbert space…
We investigate the problem of reversing quantum dynamics, specifically via optimal Petz recovery maps. We focus on typical decoherence channels, such as dephasing, depolarizing and amplitude damping. We illustrate how well a physically…
We investigate certain classes of normal completely positive (CP) maps on the hyperfinite $II_1$ factor $\mathcal A$. Using the representation theory of a suitable irrational rotation algebra, we propose some computable invariants for such…
A quantile sheet is a global estimator for multiple quantile curves. A quantile sheet estimator is proposed to maintain the non-crossing properties for different quantiles. The proposed estimator utilizes SCOP: shape-constrained P-spline to…
In this paper we propose the Graduated NonConvexity and Graduated Concavity Procedure (GNCGCP) as a general optimization framework to approximately solve the combinatorial optimization problems on the set of partial permutation matrices.…