Simon's problem for linear functions. - Joran van Apeldoorn; Sander Gribling (CoRR, 2018)

Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization. - Sander Gribling; David de Laat; Monique Laurent (Math. Program., 2018)

Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization. - Sander Gribling; David de Laat; Monique Laurent (Found. Comput. Math., 2019)

On the complexity of solving a decision problem with flow-depending costs: The case of the IJsselmeer dikes. - Aida Abiad; Sander Gribling; Domenico Lahaye; Matthias Mnich; Guus Regts; Lluís Vena; Gerard Verweij; Peter J. Zwaneveld (Discret. Optim., 2020)

The Haemers Bound of Noncommutative Graphs. - Sander Gribling; Yinan Li (IEEE J. Sel. Areas Inf. Theory, 2020)

Convex optimization using quantum oracles. - Joran van Apeldoorn; András Gilyén; Sander Gribling; Ronald de Wolf (Quantum, 2020)

Quantum SDP-Solvers: Better upper and lower bounds. - Joran van Apeldoorn; András Gilyén; Sander Gribling; Ronald de Wolf (Quantum, 2020)

Quantum Algorithms for Matrix Scaling and Matrix Balancing. - Joran van Apeldoorn; Sander Gribling; Yinan Li; Harold Nieuwboer; Michael Walter 005; Ronald de Wolf (ICALP, 2021)

Improved Quantum Lower and Upper Bounds for Matrix Scaling. - Sander Gribling; Harold Nieuwboer (STACS, 2022)

Hamiltonian Monte Carlo for efficient Gaussian sampling: long and random steps. - Simon Apers; Sander Gribling; Dániel Szilágyi (CoRR, 2022)

On a Tracial Version of Haemers Bound. - Li Gao; Sander Gribling; Yinan Li (IEEE Trans. Inf. Theory, 2022)

A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization. - Sander Gribling; Sven C. Polak; Lucas Slot (ISSAC, 2023)

Quantum speedups for linear programming via interior point methods. - Simon Apers; Sander Gribling (CoRR, 2023)

Approximate Pythagoras numbers on ⁎-algebras over C. - Paria Abbasi; Sander Gribling; Andreas Klingler; Tim Netzer (J. Complex., 2023)

A (simple) classical algorithm for estimating Betti numbers. - Simon Apers; Sander Gribling; Sayantan Sen; Dániel Szabó (Quantum, 2023)

On computing approximate Lewis weights. - Simon Apers; Sander Gribling; Aaron Sidford (CoRR, 2024)

Grothendieck inequalities characterize converses to the polynomial method. - Jop Briët; Francisco Escudero Gutiérrez; Sander Gribling (Quantum, 2024)

Mutually unbiased bases: polynomial optimization and symmetry. - Sander Gribling; Sven C. Polak (Quantum, 2024)

Basic quantum subroutines: finding multiple marked elements and summing numbers. - Joran van Apeldoorn; Sander Gribling; Harold Nieuwboer (Quantum, 2024)

How to Compute the Volume in Low Dimension? - Arjan Cornelissen; Simon Apers; Sander Gribling (ICALP, 2025)