Sander Gribling

408 total citations
13 papers, 78 citations indexed

About

Sander Gribling is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Numerical Analysis. According to data from OpenAlex, Sander Gribling has authored 13 papers receiving a total of 78 indexed citations (citations by other indexed papers that have themselves been cited), including 8 papers in Computational Theory and Mathematics, 7 papers in Artificial Intelligence and 5 papers in Numerical Analysis. Recurrent topics in Sander Gribling's work include Quantum Computing Algorithms and Architecture (7 papers), Advanced Optimization Algorithms Research (5 papers) and Quantum Information and Cryptography (5 papers). Sander Gribling is often cited by papers focused on Quantum Computing Algorithms and Architecture (7 papers), Advanced Optimization Algorithms Research (5 papers) and Quantum Information and Cryptography (5 papers). Sander Gribling collaborates with scholars based in Netherlands, France and Japan. Sander Gribling's co-authors include Monique Laurent, András Gilyén, Ronald de Wolf, Yinan Li, Gerard Verweij, Michael Walter, Li Gao, Matthias Mnich, Domenico Lahaye and Guus Regts and has published in prestigious journals such as IEEE Transactions on Information Theory, Mathematical Programming and Linear Algebra and its Applications.

In The Last Decade

Sander Gribling

12 papers receiving 75 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Sander Gribling Netherlands 5 52 31 24 21 7 13 78
Sarvagya Upadhyay United States 7 136 2.6× 88 2.8× 59 2.5× 6 0.3× 2 0.3× 10 154
Chunhao Wang United States 7 99 1.9× 19 0.6× 64 2.7× 2 0.1× 3 0.4× 12 119
Elijah Pelofske United States 7 88 1.7× 29 0.9× 21 0.9× 3 0.1× 1 0.1× 18 100
David E. Roberson Denmark 6 38 0.7× 38 1.2× 33 1.4× 4 0.2× 3 0.4× 19 104
Shelby Kimmel United States 6 183 3.5× 27 0.9× 112 4.7× 3 0.1× 8 1.1× 12 189
Ali S. Kavruk United States 4 18 0.3× 16 0.5× 22 0.9× 2 0.1× 7 94
J. Pablo Bonilla Ataides United States 4 81 1.6× 29 0.9× 40 1.7× 1 0.0× 7 107
Simon Martiel France 6 87 1.7× 42 1.4× 33 1.4× 15 106
Craig Gidney United States 3 53 1.0× 15 0.5× 19 0.8× 1 0.0× 1 0.1× 4 64
Mitchell Matheny United States 4 53 1.0× 10 0.3× 53 2.2× 2 0.3× 5 85

Countries citing papers authored by Sander Gribling

Since Specialization
Citations

This map shows the geographic impact of Sander Gribling's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Sander Gribling with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sander Gribling more than expected).

Fields of papers citing papers by Sander Gribling

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Sander Gribling. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Sander Gribling. The network helps show where Sander Gribling may publish in the future.

Co-authorship network of co-authors of Sander Gribling

This figure shows the co-authorship network connecting the top 25 collaborators of Sander Gribling. A scholar is included among the top collaborators of Sander Gribling based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Sander Gribling. Sander Gribling is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

13 of 13 papers shown
1.
Gribling, Sander, et al.. (2024). Mutually unbiased bases: polynomial optimization and symmetry. Quantum. 8. 1318–1318. 2 indexed citations
2.
Gribling, Sander, et al.. (2024). Basic quantum subroutines: finding multiple marked elements and summing numbers. Quantum. 8. 1284–1284. 1 indexed citations
3.
Gribling, Sander, et al.. (2024). An Optimal Linear-combination-of-unitaries-based Quantum Linear System Solver. Tilburg University Research Portal. 5(2). 1–23.
4.
Gribling, Sander, et al.. (2023). A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization. Research portal (Tilburg University). 280–288. 2 indexed citations
5.
Gribling, Sander, et al.. (2023). A (simple) classical algorithm for estimating Betti numbers. Quantum. 7. 1202–1202. 3 indexed citations
6.
Gribling, Sander, et al.. (2022). Bounding the separable rank via polynomial optimization. Linear Algebra and its Applications. 648. 1–55. 5 indexed citations
7.
Gao, Li, Sander Gribling, & Yinan Li. (2022). On a Tracial Version of Haemers Bound. IEEE Transactions on Information Theory. 68(10). 6585–6604. 1 indexed citations
8.
Gribling, Sander, et al.. (2021). Quantum Algorithms for Matrix Scaling and Matrix Balancing. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations
9.
Gribling, Sander, Domenico Lahaye, Matthias Mnich, et al.. (2020). On the complexity of solving a decision problem with flow-depending costs: The case of the IJsselmeer dikes. Discrete Optimization. 37. 100565–100565. 1 indexed citations
10.
Gribling, Sander, et al.. (2019). Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization. Foundations of Computational Mathematics. 19(5). 1013–1070. 13 indexed citations
11.
Gribling, Sander, et al.. (2018). Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization. Mathematical Programming. 170(1). 5–42. 10 indexed citations
12.
Gilyén, András, et al.. (2017). Quantum SDP-Solvers: Better Upper and Lower Bounds. UvA-DARE (University of Amsterdam). 403–414. 26 indexed citations
13.
Gribling, Sander, et al.. (2016). Matrices with high completely positive semidefinite rank. Linear Algebra and its Applications. 513. 122–148. 12 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026