Sander Gribling

Orcid: 0000-0002-6817-2971

According to our database1, Sander Gribling authored at least 17 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Basic quantum subroutines: finding multiple marked elements and summing numbers.
Quantum, March, 2024

2023
A (simple) classical algorithm for estimating Betti numbers.
Quantum, December, 2023

Approximate Pythagoras numbers on ⁎-algebras over C.
J. Complex., 2023

Quantum speedups for linear programming via interior point methods.
CoRR, 2023

A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

2022
On a Tracial Version of Haemers Bound.
IEEE Trans. Inf. Theory, 2022

Grothendieck inequalities characterize converses to the polynomial method.
CoRR, 2022

Hamiltonian Monte Carlo for efficient Gaussian sampling: long and random steps.
CoRR, 2022

Improved Quantum Lower and Upper Bounds for Matrix Scaling.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

2021
Quantum Algorithms for Matrix Scaling and Matrix Balancing.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
Quantum SDP-Solvers: Better upper and lower bounds.
Quantum, 2020

Convex optimization using quantum oracles.
Quantum, 2020

The Haemers Bound of Noncommutative Graphs.
IEEE J. Sel. Areas Inf. Theory, 2020

On the complexity of solving a decision problem with flow-depending costs: The case of the IJsselmeer dikes.
Discret. Optim., 2020

2019
Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization.
Found. Comput. Math., 2019

2018
Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization.
Math. Program., 2018

Simon's problem for linear functions.
CoRR, 2018


  Loading...