research
∙
05/24/2023
A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization
The moment-sum-of-squares (moment-SOS) hierarchy is one of the most cele...
share
research
∙
02/20/2023
Basic quantum subroutines: finding multiple marked elements and summing numbers
We show how to find all k marked elements in a list of size N using the ...
research
∙
12/16/2022
Grothendieck inequalities characterize converses to the polynomial method
A surprising 'converse to the polynomial method' of Aaronson et al. (CCC...
research
∙
09/26/2022
Hamiltonian Monte Carlo for efficient Gaussian sampling: long and random steps
Hamiltonian Monte Carlo (HMC) is a Markov chain algorithm for sampling f...
research
∙
09/30/2021
Improved quantum lower and upper bounds for matrix scaling
Matrix scaling is a simple to state, yet widely applicable linear-algebr...
research
∙
07/06/2021
On a tracial version of Haemers bound
We extend upper bounds on the quantum independence number and the quantu...
research
∙
11/25/2020
Quantum algorithms for matrix scaling and matrix balancing
Matrix scaling and matrix balancing are two basic linear-algebraic probl...
research
∙
10/29/2018
Simon's problem for linear functions
Simon's problem asks the following: determine if a function f: {0,1}^n →...
research
∙
09/03/2018
