| 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 | 254 | 2017 |
| Challenges and opportunities in quantum optimization A Abbas, A Ambainis, B Augustino, A Bärtschi, H Buhrman, C Coffrin, ... Nature Reviews Physics, 1-18, 2024 | 156* | 2024 |
| Convex optimization using quantum oracles J van Apeldoorn, A Gilyén, S Gribling, R de Wolf Quantum 4, 220, 2020 | 82 | 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 | 31 | 2019 |
| 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 | 27 | 2018 |
| Matrices with high completely positive semidefinite rank S Gribling, D de Laat, M Laurent Linear Algebra and its Applications 513, 122-148, 2017 | 25 | 2017 |
| A (simple) classical algorithm for estimating Betti numbers S Apers, S Gribling, S Sen, D Szabó Quantum 7, 1202, 2023 | 20 | 2023 |
| Quantum speedups for linear programming via interior point methods S Apers, S Gribling arXiv preprint arXiv:2311.03215, 2023 | 15 | 2023 |
| An optimal linear-combination-of-unitaries-based quantum linear system solver S Gribling, I Kerenidis, D Szilágyi ACM Transactions on Quantum Computing 5 (2), 1-23, 2024 | 11* | 2024 |
| Hamiltonian Monte Carlo for efficient Gaussian sampling: long and random steps S Apers, S Gribling, D Szilágyi Journal of Machine Learning Research 25 (348), 1-30, 2024 | 10 | 2024 |
| Bounding the separable rank via polynomial optimization S Gribling, M Laurent, A Steenkamp Linear Algebra and its Applications 648, 1-55, 2022 | 10 | 2022 |
| Semidefinite programming formulations for the completely bounded norm of a tensor S Gribling, M Laurent arXiv preprint arXiv:1901.04921, 2019 | 10 | 2019 |
| 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 | 9 | 2020 |
| Mutually unbiased bases: polynomial optimization and symmetry S Gribling, S Polak Quantum 8, 1318, 2024 | 7 | 2024 |
| Basic quantum subroutines: finding multiple marked elements and summing numbers J van Apeldoorn, S Gribling, H Nieuwboer Quantum 8, 1284, 2024 | 7 | 2024 |
| Applications of optimization to factorization ranks and quantum information theory S Gribling | 6 | 2019 |
| A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization S Gribling, S Polak, L Slot Proceedings of the 2023 International Symposium on Symbolic and Algebraic …, 2023 | 5 | 2023 |
| On a tracial version of haemers bound L Gao, S Gribling, Y Li IEEE Transactions on Information Theory 68 (10), 6585-6604, 2022 | 5 | 2022 |
| Improved quantum lower and upper bounds for matrix scaling S Gribling, H Nieuwboer arXiv preprint arXiv:2109.15282, 2021 | 5 | 2021 |
| Simon's problem for linear functions J van Apeldoorn, S Gribling arXiv preprint arXiv:1810.12030, 2018 | 5 | 2018 |
Joran van ApeldoornIVIR & QuSoft, UvA在 cwi.nl 的電子郵件地址已通過驗證
