We consider process tomography for unitary quantum channels. Given acces...
The divide-and-conquer framework, used extensively in classical algorith...
Suppose y is a real random variable, and one is given access
to “the cod...
We study the complexity of optimizing highly smooth convex functions. Fo...
We study the problem of learning a Hamiltonian H to precision
ε, supposi...
We exhibit an unambiguous k-DNF formula that requires CNF width
Ω̃(k^2),...
Based on the recent breakthrough of Huang (2019), we show that for any t...
We study the first-order convex optimization problem, where we have blac...
Suppose we have randomized decision trees for an outer function f and an...
Based on the recent breakthrough of Huang (2019), we show that for any t...
Recently, Bravyi, Gosset, and König (Science, 2018) exhibited a search
p...
This paper proves new limitations on the power of quantum computers to s...
We define a new query measure we call quantum distinguishing complexity,...
We give new quantum algorithms for evaluating composed functions whose i...
We prove lower bounds on complexity measures, such as the approximate de...
The approximate degree of a Boolean function f is the least degree of a ...