181 citations · 332 across the 25 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
quant-ph2022
Grothendieck inequalities characterize converses to the polynomial method
Jop Briët, Francisco Escudero Gutiérrez, Sander Gribling
A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorit…
stat.ML2022★ 2 cited
Hamiltonian Monte Carlo for efficient Gaussian sampling: long and random steps
Simon Apers, Sander Gribling, Dániel Szilágyi
Hamiltonian Monte Carlo (HMC) is a Markov chain algorithm for sampling from a high-dimensional distribution with density , given access to the gradient of . A particu…