Abstract Deep Reinforcement Learning (RL) has considerably advanced over the past
decade. At the same time, state-of-the-art RL algorithms require a large computational …

We study quantum algorithms for several fundamental string problems, including Longest
Common Substring, Lexicographically Minimal String Rotation, and Longest Square …

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 …

Longest common substring (LCS) is an important text processing problem, which has
recently been investigated in the quantum query model. The decision version of this …

Emerging quantum algorithms for problems such as element distinctness, subset sum, and
closest pair demonstrate computational advantages by relying on abstract data structures …

We explore the power of the unbounded Fan-Out gate and the Global Tunable gates
generated by Ising-type Hamiltonians in constructing constant-depth quantum circuits, with …

In the classical RAM, we have the following useful property. If we have an algorithm that
uses $ M $ memory cells throughout its execution, and in addition is sparse, in the sense …

We initiate a systematic study of the time complexity of quantum divide and conquer
algorithms for classical problems. We establish generic conditions under which search and …

We explore the power of the unbounded Fan-Out gate and the Global Tunable gates
generated by Ising-type Hamiltonians in constructing constant-depth quantum circuits, with …

The classical 3SUM conjecture states that the class of 3SUM-hard problems does not admit
a truly subquadratic $ O (n^{2-\delta}) $-time algorithm, where $\delta> 0$, in classical …