Quantum computers are expected to surpass the computational capabilities of classical
computers and have a transformative impact on numerous industry sectors. We present a …

Quantum computers are expected to surpass the computational capabilities of classical
computers during this decade and have transformative impact on numerous industry sectors …

Continuous-time quantum walks provide a natural framework to tackle the fundamental
problem of finding a node among a set of marked nodes in a graph, known as spatial …

Many standard linear algebra problems can be solved on a quantum computer by using
recently developed quantum linear algebra algorithms that make use of block encodings …

We study the limitations and fast-forwarding of quantum algorithms for linear ordinary
differential equation (ODE) systems with a particular focus on non-quantum dynamics …

We present a quantum eigenstate filtering algorithm based on quantum signal processing
(QSP) and minimax polynomials. The algorithm allows us to efficiently prepare a target …

We propose a class of randomized quantum algorithms for the task of sampling from matrix
functions, without the use of quantum block encodings or any other coherent oracle access …

A quantum walk algorithm can detect the presence of a marked vertex on a graph
quadratically faster than the corresponding random walk algorithm (Szegedy, FOCS 2004) …

We develop three new methods to implement any Linear Combination of Unitaries (LCU), a
powerful quantum algorithmic tool with diverse applications. While the standard LCU …

While the quantum query complexity of k-distinctness is known to be O (n 3/4− 1/4 (2 k− 1))
for any constant k≥ 4 [Belovs, FOCS 2012], the best previous upper bound on the time …