The so-called welded tree problem provides an example of a black-box pro...
Given a convex function fℝ^d→ℝ, the problem of
sampling from a distribut...
The divide-and-conquer framework, used extensively in classical algorith...
The Swap gate is a ubiquitous tool for moving information on quantum
har...
Quantum simulation is a prominent application of quantum computers. Whil...
We present methods for implementing arbitrary permutations of qubits und...
We study quantum algorithms that learn properties of a matrix using quer...
While there has been extensive previous work on efficient quantum algori...
Identifying the best arm of a multi-armed bandit is a central problem in...
The standard circuit model for quantum computation presumes the ability ...
Aaronson and Ambainis (2009) and Chailloux (2018) showed that fully symm...
Quantum computers can produce a quantum encoding of the solution of a sy...
Quantum computers can sometimes exponentially outperform classical ones,...
The Lie-Trotter formula, together with its higher-order generalizations,...
In a recent breakthrough, Mahadev constructed an interactive protocol th...
We describe a two-message protocol that enables a purely classical verif...
Estimating the volume of a convex body is a central problem in convex
ge...
The difficulty of simulating quantum dynamics depends on the norm of the...
Quantum computer architectures impose restrictions on qubit interactions...
Recently developed quantum algorithms address computational challenges i...
Product formulas provide a straightforward yet surprisingly efficient
ap...
While recent work suggests that quantum computers can speed up the solut...