Related papers: Conic approach to quantum graph parameters using l…
The second-order cone (SOC) is a class of simple convex cones and optimizing over them can be done more efficiently than with semidefinite programming. It is interesting both in theory and in practice to investigate which convex cones admit…
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…
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.…
A convex optimization based method is proposed for quantum process tomography, in the case of known channel model structure, but unknown channel parameters. The main idea is to select an affine parametrization of the Choi matrix as a set of…
An alternative, geometrical proof of a known theorem concerning the decomposition of positive maps of the matrix algebra $M_{2}(\mathbb{C})$ has been presented. The premise of the proof is the identification of positive maps with operators…
We study methods of inducing metrics on unital completely positive maps by employing seminorms arising in noncommutative geometry. Our main approach relies on the development of an infinite-dimensional $C^*$-algebraic analogue of the…
This work introduces and systematically studies a new convex cone of PCOP (pairwise copositive). We establish that this cone is dual to the cone of PCP (pairwise completely positive) and, critically, provides a complete characterization for…
The graph and hypergraph container methods are powerful tools with a wide range of applications across combinatorics. Recently, Blais and Seth (FOCS 2023) showed that the graph container method is particularly well-suited for the analysis…
Positive 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$,…
In this paper we give a first study of perfect copositive $n \times n$ matrices. They can be used to find rational certificates for completely positive matrices. We describe similarities and differences to classical perfect, positive…
The second-order cone is a class of simple convex cones and optimizing over them can be done more efficiently than with semidefinite programming. It is interesting both in theory and in practice to investigate which convex cones admit a…
This paper studies the problem of finding an $(1+\epsilon)$-approximate solution to positive semidefinite programs. These are semidefinite programs in which all matrices in the constraints and objective are positive semidefinite and all…
One of the main applications of semidefinite programming lies in linear systems and control theory. Many problems in this subject, certainly the textbook classics, have matrices as variables, and the formulas naturally contain…
We present a unified quantum-classical framework for addressing NP-complete constrained combinatorial optimization problems, generalizing the recently proposed Quantum Conic Programming (QCP) approach. Accordingly, it inherits many…
Matrix completion results deal with the question of when a partially specified symmetric matrix can be completed to a member of certain matrix cones. Results from positive semidefinite matrix completion and completely positive matrix…
We consider the following natural graph cut problem called Critical Node Cut (CNC): Given a graph $G$ on $n$ vertices, and two positive integers $k$ and $x$, determine whether $G$ has a set of $k$ vertices whose removal leaves $G$ with at…
A symmetric matrix $A$ is completely positive (CP) if there exists an entrywise nonnegative matrix $V$ such that $A = V V ^T$. In this paper, we study the CP-matrix approximation problem of projecting a matrix onto the intersection of a set…
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.…
We construct a quantum-inspired classical algorithm for computing the permanent of Hermitian positive semidefinite matrices, by exploiting a connection between these mathematical structures and the boson sampling model. Specifically, the…
We give a quantum algorithm for evaluating formulas over an extended gate set, including all two- and three-bit binary gates (e.g., NAND, 3-majority). The algorithm is optimal on read-once formulas for which each gate's inputs are balanced…