Related papers: Thirty-six officers, artisanally entangled
We consider representations of tensors as sums of decomposable tensors or, equivalently, decomposition of multilinear forms into one--forms. In this short note we show that there exists a particular finite strongly orthogonal decomposition…
In a constructive setting, no concrete formulation of ordinal numbers can simultaneously have all the properties one might be interested in; for example, being able to calculate limits of sequences is constructively incompatible with…
Symmetric tensor decomposition is an important problem with applications in several areas for example signal processing, statistics, data analysis and computational neuroscience. It is equivalent to Waring's problem for homogeneous…
In this paper, we investigate the sample size requirement for a general class of nuclear norm minimization methods for higher order tensor completion. We introduce a class of tensor norms by allowing for different levels of coherence, which…
A typical quantum experiment has a bunch of apparatuses placed so that quantum systems can pass between them. We regard each use of an apparatus, along with some given outcome on the apparatus (a certain detector click or a certain meter…
The geometry of the set of restrictions of rank-one tensors to some of their coordinates is studied. This gives insight into the problem of rank-one completion of partial tensors. Particular emphasis is put on the semialgebraic nature of…
We study the problem of distinguishing quantum states using local operations and classical communication (LOCC). A question of fundamental interest is whether there exist sets of $k \leq d$ orthogonal maximally entangled states in…
A theorem due to Kazhdan and Ziegler implies that, by substituting linear forms for its variables, a homogeneous polynomial of sufficiently high strength specialises to any given polynomial of the same degree in a bounded number of…
There are good reasons to believe that we are classical algorithms run on (effectively) classical machines. However, the fact that a physical state of a system in a universe described by a classical deterministic model doesn't contain any…
We introduce a new consistency-based approach for defining and solving nonnegative/positive matrix and tensor completion problems. The novelty of the framework is that instead of artificially making the problem well-posed in the form of an…
We introduce the notion of the unextendible maximally entangled basis (UMEB), a set of orthonormal maximally entangled states in d \times d consisting of fewer that d^2 vectors which have no additional maximally entangled vectors orthogonal…
One of the main issues in computing a tensor decomposition is how to choose the number of rank-one components, since there is no finite algorithms for determining the rank of a tensor. A commonly used approach for this purpose is to find a…
Here we consider perfect entanglers from another perspective. It is shown that there are some {\em special} perfect entanglers which can maximally entangle a {\em full} product basis. We have explicitly constructed a one-parameter family of…
We study linear problems defined on tensor products of Hilbert spaces with an additional (anti-) symmetry property. We construct a linear algorithm that uses finitely many continuous linear functionals and show an explicit formula for its…
We give a new, constructive uniqueness theorem for tensor decomposition. It applies to order 3 tensors of format $n \times n \times p$ and can prove uniqueness of decomposition for generic tensors up to rank $r=4n/3$ as soon as $p \geq 4$.…
A positive definite quadratic form is called perfect, if it is uniquely determined by its arithmetical minimum and the integral vectors attaining it. In this self-contained survey we explain how to enumerate perfect forms in $d$ variables…
A general algebraic procedure for constructing coherent states of a wide class of exactly solvable potentials e.g., Morse and P{\"o}schl-Teller, is given. The method, {\it a priori}, is potential independent and connects with earlier…
Solving a decades-old problem we show that Keisler's 1967 order on theories has the maximum number of classes. The theories we build are simple unstable with no nontrivial forking, and reflect growth rates of sequences which may be thought…
We extend the $\lambda$-theory of operator spaces given by Defant and Wiesner (2014), that generalizes the notion of the projective, Haagerup and Schur tensor norm for operator spaces to matrix ordered spaces and Banach $*$-algebras. Given…
Superintegrable systems of 2nd order in 3 dimensions with exactly 3-parameter potentials are intriguing objects. Next to the nondegenerate 4-parameter potential systems they admit the maximum number of symmetry operators but their symmetry…