Searcharxiv⌕ Search

arXiv subjects

Igor Klep

Publications and source records attributed to Igor Klep.

At least 37 records · Page 2Linked to original sources

Quantitative Tsirelson's Theorems via Approximate Schur's Lemma and Probabilistic Stampfli's Theorems

Whether an almost-commuting pair of operators must be close to a commuting pair is a central question in operator and matrix theory. We investigate this problem for pairs of $C^*$-subalgebras $\mathcal{A}$ and $\mathcal{B}$ of $M_d(\mathbb{C})$, showing that each operator in $\mathcal{B}$ is $O(d^2ε)$-close in operator norm to an operator in the commutant $\mathcal{A}'$ under two complementary formulations of "$ε$-almost commutation." One formulation is probabilistic, requiring that the operators of $\mathcal{B}$ have small commutators for most Haar-random unitaries acting on $\mathcal{A}$. This first formulation leads to two novel probabilistic generalizations of Stampfli's theorem, which relates an operator's distance from the scalars to the norm of its inner derivation. The second formulation is deterministic, requiring small commutators between the generators of $\mathcal{A}$ and $\mathcal{B}$; we analyze this using an approximate Schur's lemma formulated in terms of Weyl-Heisenberg (clock-and-shift) matrices. As an application of our results to quantum information theory, we obtain a quantitative Tsirelson's theorem: in dimension $d$, every $ε$-almost quantum commuting observable model is well approximated by a quantum tensor-product model with error $O(d^2ε)$.

quant-ph↗

Upper bound hierarchies for noncommutative polynomial optimization

This work focuses on minimizing the eigenvalue of a noncommutative polynomial subject to a finite number of noncommutative polynomial inequality constraints. Based on the Helton-McCullough Positivstellensatz, the noncommutative analog of Lasserre's moment-sum of squares hierarchy provides a sequence of lower bounds converging to the minimal eigenvalue, under mild assumptions on the constraint set. Each lower bound can be obtained by solving a semidefinite program. We derive complementary converging hierarchies of upper bounds. They are noncommutative analogues of the upper bound hierarchies due to Lasserre for minimizing polynomials over compact sets. Each upper bound can be obtained by solving a generalized eigenvalue problem.

math.OC↗

Cross-positive linear maps, positive polynomials and sums of squares

A linear map $Φ$ between matrix spaces is called cross-positive if it is positive on orthogonal pairs $(U,V)$ of positive semidefinite matrices in the sense that $\langle U,V\rangle:=\text{Tr}(UV)=0$ implies $\langle Φ(U),V\rangle\geq0$, and is completely cross-positive if all its ampliations $I_n\otimes Φ$ are cross-positive. (Completely) cross-positive maps arise in the theory of operator semigroups, where they are sometimes called exponentially-positive maps, and are also important in the theory of affine processes on symmetric cones in mathematical finance. To each $Φ$ as above a bihomogeneous form is associated by $p_Φ(x,y)=y^TΦ(xx^T)y$. Then $Φ$ is cross-positive if and only if $p_Φ$ is nonnegative on the variety of pairs of orthogonal vectors $\{(x,y)\mid x^Ty=0\}$. Moreover, $Φ$ is shown to be completely cross-positive if and only if $p_Φ$ is a sum of squares modulo the principal ideal $(x^Ty)$. These observations bring the study of cross-positive maps into the powerful setting of real algebraic geometry. Here this interplay is exploited to prove quantitative bounds on the fraction of cross-positive maps that are completely cross-positive. Detailed results about cross-positive maps $Φ$ mapping between $3\times 3$ matrices are given. Finally, an algorithm to produce cross-positive maps that are not completely cross-positive is presented.

math.FA↗

Monoid algebras and graph products

In this note, we extend results about unique $n^{\textrm{th}}$ roots and cancellation of finite disconnected graphs with respect to the Cartesian, the strong and the direct product, to the rooted hierarchical products, and to a modified lexicographic product. We show that these results also hold for graphs with countably many finite connected components, as long as every connected component appears only finitely often (up to isomorphism). The proofs are via monoid algebras and generalized power series rings.

math.CO↗

A Model Theoretic Perspective on Matrix Rings

In this paper natural necessary and sufficient conditions for quantifier elimination of matrix rings $M_n(K)$ in the language of rings expanded by two unary functions, naming the trace and transposition, are identified. This is used together with invariant theory to prove quantifier elimination when $K$ is an intersection of real closed fields. On the other hand, it is shown that finding a natural \textit{definable} expansion with quantifier elimination of the theory of $M_n({\mathbb C})$ is closely related to the infamous simultaneous conjugacy problem in matrix theory. Finally, for various natural structures describing dimension-free matrices it is shown that no such elimination results can hold by establishing undecidability results.

math.LO↗

Positivstellensätze and Moment problems with Universal Quantifiers

This paper studies Positivstellensätze and moment problems for sets $K$ that are given by universal quantifiers. Let $Q$ be a closed set and let $g = (g_1,...,g_s)$ be a tuple of polynomials in two vector variables $x$ and $y$. Then $K$ is described as the set of all points $x$ such that each $g_j(x, y) \ge 0$ for all $y \in Q$. Fix a finite nonnegative Borel measure $ν$ with $supp(ν) = Q$, and assume it satisfies the multivariate Carleman condition. The first main result of the paper is a Positivstellensatz with universal quantifiers: if a polynomial $f(x)$ is positive on $K$, then it belongs to the quadratic module $QM(g,ν)$ associated to $(g,ν)$, under the archimedeanness assumption on $QM(g,ν)$. Here, $QM(g,ν)$ denotes the quadratic module of polynomials in $x$ that can be represented as \[τ_0(x) + \int τ_1(x,y)g_1(x, y)\, dν(y) + \cdots + \int τ_s(x,y) g_s(x, y)\, dν(y), \] where each $τ_j$ is a sum of squares polynomial. Second, necessary and sufficient conditions for a full (or truncated) multisequence to admit a representing measure supported in $K$ are given. In particular, the classical flat extension theorem of Curto and Fialkow is generalized to truncated moment problems on such a set $K$. Finally, applications of these results for solving semi-infinite optimization problems are presented.

math.OC↗

Sums of squares certificates for polynomial moment inequalities

This paper introduces and develops the algebraic framework of moment polynomials, which are polynomial expressions in commuting variables and their formal mixed moments. Their positivity and optimization over probability measures supported on semialgebraic sets and subject to moment polynomial constraints is investigated. A positive solution to Hilbert's 17th problem for pseudo-moments is given. On the other hand, moment polynomials positive on actual measures are shown to be sums of squares and formal moments of squares up to arbitrarily small perturbation of their coefficients. When only measures supported on a bounded semialgebraic set are considered, a stronger algebraic certificate for moment polynomial positivity is derived. This result gives rise to a converging hierarchy of semidefinite programs for moment polynomial optimization. Finally, as an application, two open nonlinear Bell inequalities from quantum physics are settled.

math.FA↗

Relaxations and Exact Solutions to Quantum Max Cut via the Algebraic Structure of Swap Operators

The Quantum Max Cut (QMC) problem has emerged as a test-problem for designing approximation algorithms for local Hamiltonian problems. In this paper we attack this problem using the algebraic structure of QMC, in particular the relationship between the quantum max cut Hamiltonian and the representation theory of the symmetric group. The first major contribution of this paper is an extension of non-commutative Sum of Squares (ncSoS) optimization techniques to give a new hierarchy of relaxations to Quantum Max Cut. The hierarchy we present is based on optimizations over polynomials in the qubit swap operators. This is in contrast to the "standard" quantum Lasserre Hierarchy, which is based on polynomials expressed in terms of the Pauli matrices. To prove correctness of this hierarchy, we exploit a finite presentation of the algebra generated by the qubit swap operators. This presentation allows for the use of computer algebraic techniques to manipulate and simplify polynomials written in terms of the swap operators, and may be of independent interest. Surprisingly, we find that level-2 of this new hierarchy is numerically exact (up to tolerance 10^(-7)) on all QMC instances with uniform edge weights on graphs with at most 8 vertices. The second major contribution of this paper is a polynomial-time algorithm that computes (in exact arithmetic) the maximum eigenvalue of the QMC Hamiltonian for certain graphs, including graphs that can be "decomposed" as a signed combination of cliques. A special case of the latter are complete bipartite graphs with uniform edge-weights, for which exact solutions are known from the work of Lieb and Mattis. Our methods, which use representation theory of the symmetric group, can be seen as a generalization of the Lieb-Mattis result.

quant-ph↗

A random copositive matrix is completely positive with positive probability

An $n\times n$ symmetric matrix $A$ is copositive if the quadratic form $x^TAx$ is nonnegative on the nonnegative orthant. The cone of copositive matrices strictly contains the cone of completely positive matrices, i.e., all matrices of the form $BB^T$ for some (possibly rectangular) matrix $B$ with nonnegative entries. The main result, proved using Blekherman's real algebraic geometry inspired techniques and tools of convex geometry, shows that asymptotically, as $n$ goes to infinity, the ratio of volume radii of the two cones is strictly positive. Consequently, the same holds true for the ratio of volume radii of any two cones sandwiched between them, e.g., the cones of positive semidefinite matrices, matrices with nonnegative entries, their intersection and their Minkowski sum.

math.FA↗

State polynomials: positivity, optimization and nonlinear Bell inequalities

This paper introduces state polynomials, i.e., polynomials in noncommuting variables and formal states of their products. A state analog of Artin's solution to Hilbert's 17th problem is proved showing that state polynomials, positive over all matrices and matricial states, are sums of squares with denominators. Somewhat surprisingly, it is also established that a Krivine-Stengle Positivstellensatz fails to hold in the state polynomial setting. Further, archimedean Positivstellensätze in the spirit of Putinar and Helton-McCullough are presented leading to a hierarchy of semidefinite relaxations converging monotonically to the optimum of a state polynomial subject to state constraints. This hierarchy can be seen as a state analog of the Lasserre hierarchy for optimization of polynomials, and the Navascués-Pironio-Acín scheme for optimization of noncommutative polynomials. The motivation behind this theory arises from the study of correlations in quantum networks. Determining the maximal quantum violation of a polynomial Bell inequality for an arbitrary network is reformulated as a state polynomial optimization problem. Several examples of quadratic Bell inequalities in the bipartite and the bilocal tripartite scenario are analyzed. To reduce the size of the constructed SDPs, sparsity, sign symmetry and conditional expectation of the observables' group structure are exploited. To obtain the above-mentioned results, techniques from noncommutative algebra, real algebraic geometry, operator theory, and convex optimization are employed.

math.FA↗

Ranks of linear matrix pencils separate simultaneous similarity orbits

This paper solves the two-sided version and provides a counterexample to the general version of the 2003 conjecture by Hadwin and Larson. Consider evaluations of linear matrix pencils $L=T_0+x_1T_1+\cdots+x_mT_m$ on matrix tuples as $L(X_1,\dots,X_m)=I\otimes T_0+X_1\otimes T_1+\cdots+X_m\otimes T_m$. It is shown that ranks of linear matrix pencils constitute a collection of separating invariants for simultaneous similarity of matrix tuples. That is, $m$-tuples $A$ and $B$ of $n\times n$ matrices are simultaneously similar if and only if the ranks of $L(A)$ and $L(B)$ are equal for all linear matrix pencils $L$ of size $mn$. Variants of this property are also established for symplectic, orthogonal, unitary similarity, and for the left-right action of general linear groups. Furthermore, a polynomial time algorithm for orbit equivalence of matrix tuples under the left-right action of special linear groups is deduced.

math.RA↗

Matrix Extreme Points and Free extreme points of Free spectrahedra

A spectrahedron is a convex set defined by a linear matrix inequality, i.e., the set of all $x \in \mathbb{R}^g$ such that \[ L_A(x) = I + A_1 x_1 + A_2 x_2 + \dots + A_g x_g \succeq 0 \] for some symmetric matrices $A_1,\ldots,A_g$. This can be extended to matrix spaces by taking $X$ to be a tuple of real symmetric matrices of any size and using the Kronecker product $$L_A(X) = I_n \otimes I_d + A_1 \otimes X_1 + A_2 \otimes X_2 + \dots + A_g \otimes X_g.$$ The solution set of $L_A (X) \succeq 0$ is called a \textit{free spectrahedron}. Free spectrahedra are important in systems engineering, operator algebras, and the theory of matrix convex sets. Matrix and free extreme points of free spectrahedra are of particular interest. While many authors have studied matrix and free extreme points of free spectrahedra, it has until now been unknown if these two types of extreme points are actually different. The results of this paper fall into three categories: theoretical, algorithmic, and experimental. Firstly, we prove the existence of matrix extreme points of free spectrahedra that are not free extreme. This is done by producing exact examples of matrix extreme points that are not free extreme. We also show that if the $A_i$ are $2 \times 2$ matrices, then matrix and free extreme points coincide. Secondly, we detail methods for constructing matrix extreme points of free spectrahedra that are not free extreme, both exactly and numerically. We also show how a recent result due to Kriel (Complex Anal.~Oper.~Theory 2019) can be used to efficiently test whether a point is matrix extreme. Thirdly, we provide evidence that a substantial number of matrix extreme points of free spectrahedra are not free extreme. Numerical work in another direction shows how to effectively write a given tuple in a free spectrahedron as a matrix convex combination of its free extreme points.

math.FA↗

Globally trace-positive noncommutative polynomials and the unbounded tracial moment problem

A noncommutative (nc) polynomial is called (globally) trace-positive if its evaluation at any tuple of operators in a tracial von Neumann algebra has nonnegative trace. Such polynomials emerge as trace inequalities in several matrix or operator variables, and are widespread in mathematics and physics. This paper delivers the first Positivstellensatz for global trace positivity of nc polynomials. Analogously to Hilbert's 17th problem in real algebraic geometry, trace-positive nc polynomials are shown to be weakly sums of hermitian squares and commutators of regular nc rational functions. In two variables, this result is strengthened further using a new sum-of-squares certificate with concrete univariate denominators for nonnegative bivariate polynomials. The trace positivity certificates in this paper are obtained by convex duality through solving the so-called unbounded tracial moment problem, which arises from noncommutative integration theory and free probability. Given a linear functional on nc polynomials, the tracial moment problem asks whether it is a joint distribution of integral operators affiliated with a tracial von Neumann algebra. A counterpart to Haviland's theorem on solvability of the tracial moment problem is established. Moreover, a variant of Carleman's condition is shown to guarantee the existence of a solution to the tracial moment problem. Together with semidefinite optimization, this is then used to prove that every trace-positive nc polynomial admits an explicit approximation in the 1-norm on its coefficients by sums of hermitian squares and commutators of nc polynomials.

math.OA↗

Dimension-free entanglement detection in multipartite Werner states

Werner states are multipartite quantum states that are invariant under the diagonal conjugate action of the unitary group. This paper gives a complete characterization of their entanglement that is independent of the underlying local Hilbert space: for every entangled Werner state there exists a dimension-free entanglement witness. The construction of such a witness is formulated as an optimization problem. To solve it, two semidefinite programming hierarchies are introduced. The first one is derived using real algebraic geometry applied to positive polynomials in the entries of a Gram matrix, and is complete in the sense that for every entangled Werner state it converges to a witness. The second one is based on a sum-of-squares certificate for the positivity of trace polynomials in noncommuting variables, and is a relaxation that involves smaller semidefinite constraints.

quant-ph↗

Noncommutative partially convex rational functions

Motivated by classical notions of bilinear matrix inequalities (BMIs) and partial convexity, this article investigates partial convexity for noncommutative functions. It is shown that noncommutative rational functions that are partially convex admit novel butterfly-type realizations that necessitate square roots. The notion of xy-convexity, a strengthening of partial convexity arising in connection with BMIs, is also considered. A characterization of xy-convex polynomials is given.

math.FA↗

Noncommutative Nullstellensätze and Perfect Games

The foundations of classical Algebraic Geometry and Real Algebraic Geometry are the Nullstellensatz and Positivstellensatz. Over the last two decades the basic analogous theorems for matrix and operator theory (noncommutative variables) have emerged. This paper concerns commuting operator strategies for nonlocal games, recalls NC Nullstellensatz which are helpful, extends these, and applies them to a very broad collection of games. In the process it brings together results spread over different literatures, hence rather than being terse, our style is fairly expository. The main results of this paper are two characterizations, based on Nullstellensatz, which apply to games with perfect commuting operator strategies. The first applies to all games and reduces the question of whether or not a game has a perfect commuting operator strategy to a question involving left ideals and sums of squares. Previously, Paulsen and others translated the study of perfect synchronous games to problems entirely involving a $*$-algebra.The characterization we present is analogous, but works for all games. The second characterization is based on a new Nullstellensatz we derive in this paper. It applies to a class of games we call torically determined games, special cases of which are XOR and linear system games. For these games we show the question of whether or not a game has a perfect commuting operator strategy reduces to instances of the subgroup membership problem and, for linear systems games, we further show this subgroup membership characterization is equivalent to the standard characterization of perfect commuting operator strategies in terms of solution groups. Both the general and torically determined games characterizations are amenable to computer algebra techniques, which we also develop.

quant-ph↗

Noncommutative Polynomial Optimization

In this chapter we present the sums of Hermitian squares approach to noncommutative polynomial optimization problems. This is an extension of the sums of squares approach for polynomial optimization arising from real algebraic geometry. We provide a gentle introduction to the underlying theory of this methodology and highlight its importance.

math.OC↗

Optimization over trace polynomials

Motivated by recent progress in quantum information theory, this article aims at optimizing trace polynomials, i.e., polynomials in noncommuting variables and traces of their products. A novel Positivstellensatz certifying positivity of trace polynomials subject to trace constraints is presented, and a hierarchy of semidefinite relaxations converging monotonically to the optimum of a trace polynomial subject to tracial constraints is provided. This hierarchy can be seen as a tracial analog of the Pironio, Navascués and Acín scheme [New J. Phys., 2008] for optimization of noncommutative polynomials. The Gelfand-Naimark-Segal (GNS) construction is applied to extract optimizers of the trace optimization problem if flatness and extremality conditions are satisfied. These conditions are sufficient to obtain finite convergence of our hierarchy. The results obtained are applied to violations of polynomial Bell inequalities in quantum information theory. The main techniques used in this paper are inspired by real algebraic geometry, operator theory, and noncommutative algebra.

math-ph↗