Related papers: Computation of a new error bound for tensor comple…
In this paper, we discuss the perturbation analysis of the extended vertical linear complementarity problem (EVLCP). Under the assumption of the row $\mathcal{W}$-property, several absolute and relative perturbation bounds of EVLCP are…
To our knowledge, the error and perturbation bounds of the general absolute value equations are not discussed. In order to fill in this study gap, in this paper, by introducing a class of absolute value functions, we study the error and…
This paper is concerned with solving some structured multi-linear systems, which are called tensor absolute value equations. This kind of absolute value equations is closely related to tensor complementarity problems and is a generalization…
We propose a guaranteed and fully computable upper bound on the energy norm of the error in low-rank Tensor Train (TT) approximate solutions of (possibly) high dimensional reaction-diffusion problems. The error bound is obtained from…
The main challenge with the tensor completion problem is a fundamental tension between computation power and the information-theoretic sample complexity rate. Past approaches either achieve the information-theoretic rate but lack practical…
In this paper, we consider the network latency estimation, which has been an important metric for network performance. However, a large scale of network latency estimation requires a lot of computing time. Therefore, we propose a new method…
We obtain the first polynomial-time algorithm for exact tensor completion that improves over the bound implied by reduction to matrix completion. The algorithm recovers an unknown 3-tensor with $r$ incoherent, orthogonal components in…
In this paper, we introduce a unified framework of Tensor Higher-Degree Eigenvalue Complementarity Problem (THDEiCP), which goes beyond the framework of the typical Quadratic Eigenvalue Complementarity Problem (QEiCP) for matrices. First,…
In this paper, we prove that all H$^+$(Z$^+$)-eigenvalues of each principal sub-tensor of a strictly semi-positive tensor are positive. We define two new constants associated with H$^+$(Z$^+$)eigenvalues of a strictly semi-positive tensor.…
We present a comprehensive end-to-end quantum algorithm for tensor problems, including tensor PCA and planted kXOR, that achieves potential superquadratic quantum speedups over classical methods. We build upon prior works by…
Using convex optimization, we propose entanglement-assisted quantum error correction procedures that are optimized for given noise channels. We demonstrate through numerical examples that such an optimized error correction method achieves…
A symmetric tensor is completely positive (CP) if it is a sum of tensor powers of nonnegative vectors. This paper characterizes completely positive binary tensors. We show that a binary tensor is completely positive if and only if it…
The alternating least squares algorithm for CP and Tucker decomposition is dominated in cost by the tensor contractions necessary to set up the quadratic optimization subproblems. We introduce a novel family of algorithms that uses…
We develop a generalized theory of quantum error correction (QEC) that applies to any linear map, in particular maps that are not completely positive (CP). This theory describes entanglement-assisted QEC for invertible noise maps, which we…
A tensor ${\mathcal A}$ of order $m$ and dimension $n$ is called a ${\rm Q}$-tensor if the tensor complementarity problem has a solution for all ${\bf q} \in {\mathbb R}^{n}$. This means that for every vector ${\bf q}$, there exists a…
In this paper, we introduce set-valued tensor complementarity problem where the elements of the involved tensors are defined based on a set-valued mapping. We study several properties of the solution set under the framework of set-valued…
Error bounds have been studied for more than seventy years, beginning with the seminal result of Hoffman (1952) [{\it J. Res. Natl. Bur. Standards}, 49 (1952), 263--265], which establishes an upper bound for the distance from an arbitrary…
A real symmetric tensor is completely positive (CP) if it is a sum of symmetric tensor powers of nonnegative vectors. We propose a dehomogenization approach for studying CP tensors. This gives new Moment-SOS relaxations for CP tensors.…
The concepts of P- and P$_0$-matrices are generalized to P- and P$_0$-tensors of even and odd orders via homogeneous formulae. Analog to the matrix case, our P-tensor definition encompasses many important classes of tensors such as the…
We propose and prove an existential theorem for entanglement-assisted asymmetric quantum error correction. Then we demonstrate its superiority over the conventional one.