2 citations · 5 across the 4 of their papers we have counts for
7 papers
Quantum algorithms for matrix scaling and matrix balancing
Joran van Apeldoorn, Sander Gribling, Yinan Li +3
Matrix scaling and matrix balancing are two basic linear-algebraic problems with a wide variety of applications, such as approximating the permanent, and pre-conditioning linear sy…
The Haemers bound of noncommutative graphs
Sander Gribling, Yinan Li
We continue the study of the quantum channel version of Shannon's zero-error capacity problem. We generalize the celebrated Haemers bound to noncommutative graphs (obtained from qu…
Semidefinite programming formulations for the completely bounded norm of a tensor
Sander Gribling, Monique Laurent
We show that a certain tensor norm, the completely bounded norm, can be expressed by a semidefinite program. This tensor norm recently attracted attention in the field of quantum c…
Simon's problem for linear functions
Joran van Apeldoorn, Sander Gribling
Simon's problem asks the following: determine if a function is one-to-one or if there exists a unique such that $f(x) = f(x \…
Convex optimization using quantum oracles
Joran van Apeldoorn, András Gilyén, Sander Gribling +1
We study to what extent quantum algorithms can speed up solving convex optimization problems. Following the classical literature we assume access to a convex set via various oracle…
On the complexity of solving a decision problem with flow-depending costs: the case of the IJsselmeer dikes
Aida Abiad, Sander Gribling, Domenico Lahaye +5
We consider a fundamental integer programming (IP) model for cost-benefit analysis flood protection through dike building in the Netherlands, due to Verweij and Zwaneveld. Experime…