Related papers: Computing mixed Schatten norm of completely positi…
We describe a way to approximate the matrix elements of a real power $\alpha$ of a positive (for $\alpha \ge 0$) or non-negative (for $\alpha \in \mathbb{R}$), infinite, bounded, sparse and Hermitian matrix $W$. The approximation uses only…
A symmetric matrix $A$ is completely positive (CP) if there exists an entrywise nonnegative matrix $B$ such that $A = BB^T$. We characterize the interior of the CP cone. A semidefinite algorithm is proposed for checking interiors of the CP…
We study positive maps of B(K) into B(H) for finite-dimensional Hilbert spaces K and H. Our main emphasis is on how Choi matrices and estimates of their norms with respect to mapping cones reflect various properties of the maps. Special…
Many real-world problems rely on finding eigenvalues and eigenvectors of a matrix. The power iteration algorithm is a simple method for determining the largest eigenvalue and associated eigenvector of a general matrix. This algorithm relies…
In order to compute the Schmidt decomposition of $A\in M_k\otimes M_m$, we must consider an associated self-adjoint map. Here, we show that if $A$ is positive under partial transposition (PPT) or symmetric with positive coefficients (SPC)…
The alternate row and column scaling algorithm applied to a positive $n\times n$ matrix $A$ converges to a doubly stochastic matrix $S(A)$, sometimes called the \emph{Sinkhorn limit} of $A$. For every positive integer $n$, a two parameter…
It is known that for a completely positive and trace preserving (cptp) map ${\cal N}$, $\text{Tr}$ $\exp$$\{ \log \sigma$ $+$ ${\cal N}^\dagger [\log {\cal N}(\rho)$ $-\log {\cal N}(\sigma)] \}$ $\leqslant$ $\text{Tr}$ $\rho$ when $\rho$,…
In this paper we study general Schatten-$p$ quasi-norm (SPQN) regularized matrix minimization problems. In particular, we first introduce a class of first-order stationary points for them, and show that the first-order stationary points…
We investigate linear maps between matrix algebras that remain positive under tensor powers, i.e., under tensoring with $n$ copies of themselves. Completely positive and completely co-positive maps are trivial examples of this kind. We show…
We present a general scheme for the construction of new eficient generalized Schultz iterative methods for computing the inverse matrix. These methods have the form $$ X_{k+1} = X_k(a_0^{(k)}I+a_1^{(k)}AX_k),\quad k\in\mathbb{N}, $$ where…
We present a formula for the trace of any symmetric power of a $n\times n$ matrix (with coefficients in a field) in terms of the ordinary powers of the matrix, an arbitrarily chosen linear function which vanishes on the identity matrix, and…
Quantum algorithms for computing classical nonlinear maps are widely known for toy problems but might not suit potential applications to realistic physics simulations. Here, we propose how to compute a general differentiable invertible…
We study a non-convex low-rank promoting penalty function, the transformed Schatten-1 (TS1), and its applications in matrix completion. The TS1 penalty, as a matrix quasi-norm defined on its singular values, interpolates the rank and the…
The Schatten quasi-norm was introduced to bridge the gap between the trace norm and rank function. However, existing algorithms are too slow or even impractical for large-scale problems. Motivated by the equivalence relation between the…
A symmetric positive semi-definite matrix A is called completely positive if there exists a matrix B with nonnegative entries such that A=BB^T. If B is such a matrix with a minimal number p of columns, then p is called the cp-rank of A. In…
We consider the problem of computing the nearest matrix polynomial with a non-trivial Smith Normal Form. We show that computing the Smith form of a matrix polynomial is amenable to numeric computation as an optimization problem.…
We introduce a novel family of invariant, convex, and non-quadratic functionals that we employ to derive regularized solutions of ill-posed linear inverse imaging problems. The proposed regularizers involve the Schatten norms of the Hessian…
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 consider norms on a complex separable Hilbert space such that $\langle a\xi,\xi\rangle\leq\|\xi\|^2\leq\langle b\xi,\xi\rangle$ for positive invertible operators $a$ and $b$ that differ by an operator in the Schatten class. We prove that…
Prior to the parallel solution of a large linear system, it is required to perform a partitioning of its equations/unknowns. Standard partitioning algorithms are designed using the considerations of the efficiency of the parallel…