181 citations · 332 across the 25 of their papers we have counts for
6 papers · 1 filter
Mutually unbiased bases: polynomial optimization and symmetry
Sander Gribling, Sven Polak
A set of orthonormal bases of is called mutually unbiased if whenever and are basis vectors in distinct bases. A natural q…
Improved quantum lower and upper bounds for matrix scaling
Sander Gribling, Harold Nieuwboer
Matrix scaling is a simple to state, yet widely applicable linear-algebraic problem: the goal is to scale the rows and columns of a given non-negative matrix such that the rescaled…
Bounding the separable rank via polynomial optimization
Sander Gribling, Monique Laurent, Andries Steenkamp
We investigate questions related to the set consisting of the linear maps acting on that can be written as a convex combina…
Improving quantum linear system solvers via a gradient descent perspective
Sander Gribling, Iordanis Kerenidis, Dániel Szilágyi
Solving systems of linear equations is one of the most important primitives in quantum computing that has the potential to provide a practical quantum advantage in many different a…
Approximate Pythagoras Numbers on -algebras over
Paria Abbasi, Sander Gribling, Andreas Klingler +1
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 va…
On a tracial version of Haemers bound
Li Gao, Sander Gribling, Yinan Li
We extend upper bounds on the quantum independence number and the quantum Shannon capacity of graphs to their counterparts in the commuting operator model. We introduce a von Neuma…