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

In this survey paper we give an intuitive treatment of the discrete time quantization of
classical Markov chains. Grover search and the quantum walk based search algorithms of …

This concise, accessible text provides a thorough introduction to quantum computing-an
exciting emergent field at the interface of the computer, engineering, mathematical and …

We propose a new method for designing quantum search algorithms forfinding a" marked"
element in the state space of a classical Markovchain. The algorithm is based on a quantum …

Consider the problem of evaluating an AND-OR formula on an N-bit black-box input. We
present a bounded-error quantum algorithm that solves this problem in time N^1/2+o(1). In …

We study the robustness of the bucket brigade quantum random access memory model
introduced by Giovannettiet al (2008Phys. Rev. Lett. 100 160501). Due to a result of Regev …

We show that any boolean function can be evaluated optimally by a quantum query
algorithm that alternates a certain fixed, input-independent reflection with a second reflection …

The degree of a polynomial representing (or approximating) a function f is a lower bound for
the quantum query complexity of f. This observation has been a source of many lower …

We present a quantum algorithm that verifies a product of two n* n matrices over any field
with bounded error in worst-case time n^{5/3} and expected time n^{5/3}/min (w, sqrt …

Learning with Errors (LWE) is an important problem for post-quantum cryptography (PQC)
that underlines the security of several NIST PQC selected algorithms. Several recent papers …