S. Gribling

activity

20172022

most citedHamiltonian Monte Carlo for efficient Gaussian sampling: long and random steps

2 citations · 7 across the 7 of their papers we have counts for

collaborators

Showing math.OCShow all

2 papers · 1 filter

math.OC2021

Bounding the separable rank via polynomial optimization

Sander Gribling, Monique Laurent, Andries Steenkamp

We investigate questions related to the set $S E P_{d}$ consisting of the linear maps $ρ$ acting on $C^{d} \otimes C^{d}$ that can be written as a convex combina…

math.OC2017

Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization

Sander Gribling, David de Laat, Monique Laurent

In this paper we study bipartite quantum correlations using techniques from tracial noncommutative polynomial optimization. We construct a hierarchy of semidefinite programming low…