Phase estimation, due to Kitaev [arXiv'95], is one of the most fundament...
The Aaronson-Ambainis conjecture (Theory of Computing '14) says that eve...
We study the problem of computing the Hamming weight of an n-bit string
...
Lasso and Ridge are important minimization problems in machine learning ...
We investigate the randomized and quantum communication complexities of ...
In theoretical computer science, conferences play an important role in t...
Buhrman, Cleve and Wigderson (STOC'98) showed that for every Boolean fun...
Matrix scaling and matrix balancing are two basic linear-algebraic probl...
Boosting is a general method to convert a weak learner (which generates
...
Graph sparsification underlies a large number of algorithms, ranging fro...
This is a set of lecture notes suitable for a Master's course on quantum...
Chattopadhyay, Mande and Sherif (ECCC 2018) recently exhibited a total
B...
We present two new results about exact learning by quantum computers. Fi...
Given a Boolean function f:{-1,1}^n→{-1,1}, the Fourier distribution
ass...
We study to what extent quantum algorithms can speed up solving convex
o...
This paper considers the potential impact that the nascent technology of...