Optimization, sampling and machine learning are topics of broad interest that have inspired
significant developments and new approaches in quantum computing. One such approach …

We study the task of differentially private clustering. For several basic clustering problems,
including Euclidean DensestBall, 1-Cluster, k-means, and k-median, we give efficient …

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

Longest common substring (LCS), longest palindrome substring (LPS), and Ulam distance
(UL) are three fundamental string problems that can be classically solved in near linear 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 …

A line of work has shown how nontrivial uniform algorithms for analyzing circuits can be
used to derive non-uniform circuit lower bounds. We show how the non-existence of …

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 …

Numerous quantum algorithms require the use of quantum error correction to overcome the
intrinsic unreliability of physical qubits. However, quantum error correction imposes a unique …

The strong exponential-time hypothesis (SETH) is a commonly used conjecture in the field of
complexity theory. It essentially states that determining whether a CNF formula is satisfiable …