Tim Netzer
Given a quadratic module, we construct its universal C*-algebra, and then use methods and notions from the theory of C*-algebras to study the quadratic module. We define residually finite-dimensional quadratic modules, and characterize them…
Operator systems connect operator algebra, free semialgebraic geometry and quantum information theory. In this work we generalize operator systems and many of their theorems. While positive semidefinite matrices form the underlying…
We transfer the theory of slack operators and sums-of-squares-criteria for lifts from convex cones to operator systems. These allow to study the following question, among others: Given an abstract operator system, is its enveloping…
We investigate the generalized moment membership problem for matrices, a formulation equivalent to Skolem's problem for linear recurrence sequences. We show decidability for orthogonal, unitary, and real eigenvalue matrices, and…
Convex optimization encompasses a wide range of optimization problems that contain many efficiently solvable subclasses. Interior point methods are currently the state-of-the-art approach for solving such problems, particularly effective…
We give a sufficient condition for a model theoretic structure $B$ to 'inherit' quantifier elimination from another structure $A$. This yields an alternative proof of one of the main result from \cite{kle}, namely quantifier elimination for…
The matrix rank and its positive versions are robust for small approximations, i.e. they do not decrease under small perturbations. In contrast, the multipartite tensor rank can collapse for arbitrarily small errors, i.e. there may be a gap…
We show that the Carath\'{e}odory number of the joint numerical range of $d$ many bounded self-adjoint operators is at most $d-1$, and even at most $d-2$ if the underlying Hilbert space has dimension at least $3$. This extension of the…
We prove the existence of self-dual tensor products for finite-dimensional convex cones and operator systems. This is a consequence of a more general result: Every cone system, which is contained in its dual, can be enlarged to a self-dual…
We present a framework to decompose real multivariate polynomials while preserving invariance and positivity. This framework has been recently introduced for tensor decompositions, in particular for quantum many-body systems. Here we…
We illustrate how quantum information theory and free (i.e. noncommutative) semialgebraic geometry often study similar objects from different perspectives. We give examples in the context of positivity and separability, quantum magic…
We develop a framework to analyse invariant decompositions of elements of tensor product spaces. Namely, we define an invariant decomposition with indices arranged on a simplicial complex, and which is explicitly invariant under a group…
In this paper we show the existence of approximate completely positive semidefinite (cpsd) factorizations with a cpsd-rank bounded above (almost) independently from the cpsd-rank of the initial matrix. This is particularly relevant since…
Quantum magic squares were recently introduced as a 'magical' combination of quantum measurements. In contrast to quantum measurements, they cannot be purified (i.e. dilated to a quantum permutation matrix) -- only the so-called…
The Pythagoras number of a sum of squares is the shortest length among its sums of squares representations. In many algebras, for example real polynomial algebras in two or more variables, there exists no upper bound on the Pythagoras…
We systematically study how properties of abstract operator systems help classifying linear matrix inequality definitions of sets. Our main focus is on polyhedral cones, the 3-dimensional Lorentz cone, where we can completely describe all…
A map $\mathcal{P}$ is tensor stable positive (tsp) if $\mathcal{P}^{\otimes n}$ is positive for all $n$, and essential tsp if it is not completely positive or completely co-positive. Are there essential tsp maps? Here we prove that there…
We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…
There are several important abstract operator systems with the convex cone of positive semidefinite matrices at the first level. Well-known are the operator systems of separable matrices, of positive semidefinite matrices, and of block…
It is well-known that tensor decompositions show separations, that is, that constraints on local terms (such as positivity) may entail an arbitrarily high cost in their representation. Here we show that many of these separations disappear…