Sander Gribling
Sander Gribling
Bestätigte E-Mail-Adresse bei - Startseite
Zitiert von
Zitiert von
Quantum SDP-solvers: Better upper and lower bounds
J Van Apeldoorn, A Gilyén, S Gribling, R de Wolf
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
Convex optimization using quantum oracles
J van Apeldoorn, A Gilyén, S Gribling, R de Wolf
Quantum 4, 220, 2020
Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
S Gribling, D De Laat, M Laurent
Foundations of Computational Mathematics 19 (5), 1013-1070, 2019
Matrices with high completely positive semidefinite rank
S Gribling, D de Laat, M Laurent
Linear Algebra and its Applications 513, 122-148, 2017
Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
S Gribling, D de Laat, M Laurent
Mathematical programming 170, 5-42, 2018
A (simple) classical algorithm for estimating Betti numbers
S Apers, S Gribling, S Sen, D Szabó
Quantum 7, 1202, 2023
Quantum algorithms for matrix scaling and matrix balancing
J van Apeldoorn, S Gribling, Y Li, H Nieuwboer, M Walter, R de Wolf
arXiv preprint arXiv:2011.12823, 2020
Quantum optimization: Potential, challenges, and the path forward
A Abbas, A Ambainis, B Augustino, A Bärtschi, H Buhrman, C Coffrin, ...
arXiv preprint arXiv:2312.02279, 2023
Bounding the separable rank via polynomial optimization
S Gribling, M Laurent, A Steenkamp
Linear Algebra and its Applications 648, 1-55, 2022
Semidefinite programming formulations for the completely bounded norm of a tensor
S Gribling, M Laurent
arXiv preprint arXiv:1901.04921, 2019
Applications of optimization to factorization ranks and quantum information theory
S Gribling
CentER, Tilburg University, 2019
Mutually unbiased bases: polynomial optimization and symmetry
S Gribling, S Polak
arXiv preprint arXiv:2111.05698, 2021
Simon's problem for linear functions
J van Apeldoorn, S Gribling
arXiv preprint arXiv:1810.12030, 2018
Improved quantum lower and upper bounds for matrix scaling
S Gribling, H Nieuwboer
arXiv preprint arXiv:2109.15282, 2021
Quantum speedups for linear programming via interior point methods
S Apers, S Gribling
arXiv preprint arXiv:2311.03215, 2023
Hamiltonian Monte Carlo for efficient Gaussian sampling: long and random steps
S Apers, S Gribling, D Szilágyi
arXiv preprint arXiv:2209.12771, 2022
Improving quantum linear system solvers via a gradient descent perspective
S Gribling, I Kerenidis, D Szilágyi
arXiv preprint arXiv:2109.04248, 2021
The Haemers bound of noncommutative graphs
S Gribling, Y Li
IEEE Journal on Selected Areas in Information Theory 1 (2), 424-431, 2020
A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization
S Gribling, S Polak, L Slot
arXiv preprint arXiv:2305.14944, 2023
Basic quantum subroutines: finding multiple marked elements and summing numbers
J van Apeldoorn, S Gribling, H Nieuwboer
arXiv preprint arXiv:2302.10244, 2023
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20