We give a comprehensive characterisation of the computational power of shallow quantum
circuits combined with classical computation. Specifically, for classes of search problems …

Collision-resistant hashing, a fundamental primitive in modern cryptography, ensures that
there is no efficient way to find distinct inputs that produce the same hash value. This …

We study tradeoffs between quantum and classical queries for hybrid algorithms that have
black-box access to a random oracle. Although there are several established techniques for …

Recently, Chia, Chung and Lai (STOC 2020) and Coudron and Menda (STOC 2020) have
shown that there exists an oracle $\mathcal {O} $ such that $\mathsf {BQP}^\mathcal {O}\neq …

Motivated by limitations on the depth of near-term quantum devices, we study the depth-
computation trade-off in the query model, where depth corresponds to the number of …

With the power of quantum information, we can achieve exciting and classically impossible
cryptographic primitives. However, almost all quantum cryptography faces extreme …

We introduce protocols for classical verification of quantum depth (CVQD). These protocols
enable a classical verifier to differentiate between devices of varying quantum circuit depths …

Low-depth quantum circuits are a well-suited model for near-term quantum devices, given
short coherence times and noisy gate operations, making it pivotal to examine their …

Understanding the relative power of quantum versus classical computation is a fascinating
and important problem in modern science on which there is likely to be much research and …

Self-testing is a fundamental feature of quantum mechanics that allows a classical verifier to
force untrusted quantum devices to prepare certain states and perform certain …