3 citations · 3 across the 7 of their papers we have counts for
7 papers
Robust self-testing with CHSH mod 3
Igor Klep, Nando Leijenhorst, Victor Magron
The CHSH mod 3 Bell inequality is a natural testbed for higher-dimensional quantum nonlocality, yet its maximal quantum violation and self-testing properties have remained unresolv…
The Effective Lasserre's Perturbative Positivstellensatz
Igor Klep, Victor Magron, Matthias Schötz
We study sum-of-squares (SOS) certificates for nonnegative polynomials on and their implications for polynomial optimization over unbounded domains. Building on…
Inclusion constants for free spectrahedra with applications to quantum incompatibility
Andreas Bluhm, Eric Evert, Igor Klep +2
Building on the matrix cube problem, inclusions of free spectrahedra have been used successfully to obtain relaxations of hard spectrahedral inclusion problems. The quality of such…
Exploiting Term Sparsity in Symmetry-Adapted Basis for Polynomial Optimization
Igor Klep, Victor Magron, Tobias Metzlaff +1
Polynomial optimization problems are infinite-dimensional, nonconvex, NP-hard, and are often handled in practice with the moment-sums of squares hierarchy of semidefinite programmi…
Quantum Max d-Cut via qudit swap operators
Igor Klep, Tea Štrekelj, Jurij Volčič
Quantum Max Cut (QMC) problem for systems of qubits is an example of a 2-local Hamiltonian problem, and a prominent paradigm in computational complexity theory. This paper investig…
Monoid algebras and graph products
Wilfried Imrich, Igor Klep, Daniel Smertnig
In this note, we extend results about unique roots and cancellation of finite disconnected graphs with respect to the Cartesian, the strong and the direct product…
First-order optimality conditions for non-commutative optimization problems
Mateus Araújo, Igor Klep, Andrew J. P. Garner +2
We consider the problem of optimizing the state average of a polynomial of non-commuting variables, over all states and operators satisfying a number of polynomial constraints, and…