Related papers: $k$-Positive Maps: New Characterizations and a Gen…
In this paper we provide necessary and sufficient (KKT) conditions for global optimality for a new class of possibly nonconvex quadratically constrained quadratic programming (QCQP) problems, denoted by S-QCQP. The class consists of QCQP…
Positive spanning sets span a given vector space by nonnegative linear combinations of their elements. These have attracted significant attention in recent years, owing to their extensive use in derivative-free optimization. In this…
The generic linear evolution of the density matrix of a system with a finite-dimensional state space is by stochastic maps which take a density matrix linearly into the set of density matrices. These dynamical stochastic maps form a linear…
In this article, I introduce a group-theoretical method to prove positivity of certain linear combinations (with coefficients generally lying in $\mathbb{C}$) of exponential functions under a set of semidefinite linear constraints. The…
Structure learning methods for covariance and concentration graphs are often validated on synthetic models, usually obtained by randomly generating: (i) an undirected graph, and (ii) a compatible symmetric positive definite (SPD) matrix. In…
We study quantum process tomography given the prior information that the map is a unitary or close to a unitary process. We show that a unitary map on a $d$-level system is completely characterized by a minimal set of $d^2{+}d$ elements…
This short note, in part of expository nature, points out several new or recent consequences of a quite nice decomposition for positive semi-definite matrices.
In this work it is shown that the SD-KE decomposition is multiplicative under determinantal-type functions for graphs with perfect matchings, providing a new tool for the study of unimodular and singular matchable graphs.
Existing nonnegative matrix factorization methods focus on learning global structure of the data to construct basis and coefficient matrices, which ignores the local structure that commonly exists among data. In this paper, we propose a new…
We construct multiplicative norms on equivariant nonconnective algebraic $K$-theory for finite groups $G$. We also construct a genuine equivariant version of THH equipped with a Dennis trace map from K-theory compatible with the…
We show that each positive map from B(K) to B(H) with K and H finite dimensional Hilbert spaces is a scalar multiple of a map of the form $Tr - \psi$ with $\psi$ completely positive. This is used to give necessary and sufficient conditions…
In this paper, we introduce the concept of completely positive matrix of linear maps on Hilbert $A$-modules over locally $C^{*}$-algebras and prove an analogue of Stinespring theorem for it. We show that any two minimal Stinespring…
One of the central tasks in many-body physics is the determination of phase diagrams. However, mapping out a phase diagram generally requires a great deal of human intuition and understanding. To automate this process, one can frame it as a…
This work focuses on the problem of exact model reduction of positive linear systems, by leveraging minimal realization theory. While determining the existence of a positive reachable realization remains in general an open problem, we are…
We consider $K$-semialgebras for a commutative semiring $K$ that are at the same time $\Sigma$-algebras and satisfy certain linearity conditions. When each finite system of guarded polynomial fixed point equations has a unique solution over…
We initiate the study of positive-tropical generators as positive analogues of the concept of tropical bases. Applying this to the tropicalization of determinantal varieties, we develop criteria for characterizing their positive part. We…
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…
Given an undirected graph $G$, the Densest $k$-subgraph problem (DkS) asks to compute a set $S \subset V$ of cardinality $\left\lvert S\right\rvert \leq k$ such that the weight of edges inside $S$ is maximized. This is a fundamental NP-hard…
We introduce a framework for the construction of completely positive maps for subsystems of indistinguishable fermionic particles. In this scenario, the initial global state is always correlated, and it is not possible to tell system and…
Consider the (formal/analytic/algebraic) map-germs Maps(X,(k^p,o)). Let G be the group of right/contact/left-right transformations. I extend the following (classical) results from the real/complex-analytic case to the case of arbitrary…