This is a set of lecture notes suitable for a Master's course on quantum computation and
information from the perspective of theoretical computer science. The first version was …

Query complexity is a model of computation in which we have to compute a function f (x 1,…,
x N) of variables xi which can be accessed via queries. The complexity of an algorithm is …

We consider the problem of learning low-degree quantum objects up to $\varepsilon $-error
in $\ell_2 $-distance. We show the following results: $(i) $ unknown $ n $-qubit degree-$ d …

We study fine-grained error bounds for differentially private algorithms for counting under
continual observation. Our main insight is that the matrix mechanism when using lower …

Let A be an s-sparse Hermitian matrix, f (x) be a univariate function, and i, j be two indices. In
this work, we investigate the query complexity of approximating if (A) j. We show that for any …

Guest Column: Approximate Degree in Classical and Quantum Computing Page 1 Guest
Column: Approximate Degree in Classical and Quantum Computing1 Mark Bun2 and Justin …

This article highlights synergies between quantum information science (QIS) and operations
research for QIS-curious operations researchers (and vice versa), and the author challenges …

In recent years, quantum-enhanced machine learning has emerged as a particularly fruitful
application of quantum algorithms, covering aspects of supervised, unsupervised and …

The Aaronson-Ambainis conjecture (Theory of Computing'14) says that every low-degree
bounded polynomial on the Boolean hypercube has an influential variable. This conjecture …

The quantum query model is one of the most important models in quantum computing.
Several well-known quantum algorithms are captured by this model, including the Deutsch …