English
Related papers

Related papers: Positive maps and extendibility hierarchies from c…

200 papers

Here we consider a class of $2\otimes2\otimes d$ chessboard density matrices starting with three-qubit ones which have positive partial transposes with respect to all subsystems. To investigate the entanglement of these density matrices, we…

Quantum Physics · Physics 2009-11-13 M. A. Jafarizadeh , Y. Akbari , K. Aghayar , A. Heshmati , M. Mahdian

Any solid object can be decomposed into a collection of convex polytopes (in short, convexes). When a small number of convexes are used, such a decomposition can be thought of as a piece-wise approximation of the geometry. This…

Computer Vision and Pattern Recognition · Computer Science 2020-04-14 Boyang Deng , Kyle Genova , Soroosh Yazdani , Sofien Bouaziz , Geoffrey Hinton , Andrea Tagliasacchi

Semidefinite programs (SDPs) -- some of the most useful and versatile optimization problems of the last few decades -- are often pathological: the optimal values of the primal and dual problems may differ and may not be attained. Such SDPs…

Optimization and Control · Mathematics 2019-10-23 Gabor Pataki

Postive semidefinite (PSD) cone is the cone of positive semidefinite matrices, and is the object of interest in semidefinite programming (SDP). A computational efficient approximation of the PSD cone is the $k$-PSD closure, $1 \leq k < n$,…

Optimization and Control · Mathematics 2021-06-07 Avinash Bhardwaj , Harshit Kothari , Vishnu Narayanan

Maps that are not completely positive (CP) are often useful to describe the dynamics of open systems. An apparent violation of complete positivity can occur because there are prior correlations of the principal system with the environment,…

Quantum Physics · Physics 2008-04-21 Hilary Carteret , Daniel R. Terno , Karol Zyczkowski

We provide new distributed interactive proofs (DIP) for planarity and related graph families. The notion of a \emph{distributed interactive proof} (DIP) was introduced by Kol, Oshman, and Saxena (PODC 2018). In this setting, the verifier…

Data Structures and Algorithms · Computer Science 2025-07-10 Yuval Gil , Merav Parter

We present a new Partial Integral Equation (PIE) representation of Partial Differential Equations (PDEs) in which it is possible to use convex optimization to perform stability analysis with little or no conservatism. The first result gives…

Analysis of PDEs · Mathematics 2020-09-14 Matthew M. Peet

We study the problem of approximating the cone of positive semidefinite (PSD) matrices with a cone that can be described by smaller-sized PSD constraints. Specifically, we ask the question: "how closely can we approximate the set of…

Optimization and Control · Mathematics 2022-09-08 Dogyoon Song , Pablo A. Parrilo

The paper introduces and studies differentially positive systems, that is, systems whose linearization along an arbitrary trajectory is positive. A generalization of Perron Frobenius theory is developed in this differential framework to…

Systems and Control · Computer Science 2014-11-12 Fulvio Forni , Rodolphe Sepulchre

Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of…

Optimization and Control · Mathematics 2017-01-03 Alexander Weber , Gunther Reissig

A linear map $\Phi :\mathbb{M}_n \to \mathbb{M}_k$ is called completely copositive if the resulting matrix $[\Phi (A_{j,i})]_{i,j=1}^m$ is positive semidefinite for any integer $m$ and positive semidefinite matrix $[A_{i,j}]_{i,j=1}^m$. In…

Functional Analysis · Mathematics 2020-01-09 Yongtao Li , Yang Huang , Lihua Feng , Weijun Liu

A $n$-by-$n$ matrix is called totally positive ($TP$) if all its minors are positive and $TP_k$ if all of its $k$-by-$k$ submatrices are $TP$. For an arbitrary totally positive matrix or $TP_k$ matrix, we investigate if the $r$th compound…

Combinatorics · Mathematics 2024-05-13 Shaun Fallat , Himanshu Gupta , Charles R. Johnson

Let $D$ be the set of $n\times n$ positive semidefinite matrices of trace equal to one, also known as the set of density matrices. We prove two results on the hardness of approximating $D$ with polytopes. First, we show that if $0 <…

Optimization and Control · Mathematics 2022-06-14 Hamza Fawzi

Divisibility of dynamical maps is visualized by trajectories in the parameter space and analyzed within the framework of collision models. We introduce ultimate completely positive (CP) divisible processes, which lose CP divisibility under…

Quantum Physics · Physics 2017-09-20 S. N. Filippov , J. Piilo , S. Maniscalco , M. Ziman

We present a large class of indecomposable exposed positive linear maps between three dimensional matrix algebras. We also construct two qutrit separable states with lengths ten in the interior of their dual faces. With these examples, we…

Quantum Physics · Physics 2014-01-23 Kil-Chan Ha , Seung-Hyeok Kye

This paper concerns the robust vector problems \begin{equation*} \mathrm{(RVP)}\ \ {\rm Wmin}\left\{ F(x): x\in C,\; G_u(x)\in -S,\;\forall u\in\mathcal{U}\right\}, \end{equation*} where $X, Y, Z$ are locally convex Hausdorff topological…

Optimization and Control · Mathematics 2019-10-24 Dinh Nguyen , Long Dang Hai

We construct 2-query, quasi-linear size probabilistically checkable proofs (PCPs) with arbitrarily small constant soundness, improving upon Dinur's 2-query quasi-linear size PCPs with soundness $1-\Omega(1)$. As an immediate corollary, we…

Computational Complexity · Computer Science 2024-11-08 Mitali Bafna , Dor Minzer , Nikhil Vyas

On a smooth manifold, we associate to any closed differential form a mapping cone complex. The cohomology of this mapping cone complex can vary with the de Rham cohomology class of the closed form. We present a novel Morse theoretical…

Differential Geometry · Mathematics 2024-06-21 David Clausen , Xiang Tang , Li-Sheng Tseng

Motivated by recent advances in solution methods for mixed-integer convex optimization (MICP), we study the fundamental and open question of which sets can be represented exactly as feasible regions of MICP problems. We establish several…

Optimization and Control · Mathematics 2021-10-26 Miles Lubin , Juan Pablo Vielma , Ilias Zadik

We here show that the family of finite-dimensional, discrete-time, passive, linear time-invariant systems can be characterized through the structure of maximal, matrix-convex set, closed under multiplication among its elements. Moreover,…

Optimization and Control · Mathematics 2021-02-03 Izchak Lewkowicz