I offer a case that quantum query complexity still has loads of enticing and fundamental open
problems—from relativized QMA versus QCMA and BQP versus IP, to time/space tradeoffs …

We propose an application for near-term quantum devices: namely, generating
cryptographically certified random bits, to use (for example) in proof-of-stake …

We study unitary property testing, where a quantum algorithm is given query access to a
black-box unitary and has to decide whether it satisfies some property. In addition to …

We present a formalism that captures the process of proving quantum superiority to skeptics
as an interactive game between two agents, supervised by a referee. Bob, is sampling from …

While many statistical properties of deep random quantum circuits can be deduced, often
rigorously and other times heuristically, by an approximation to global Haar-random …

Random quantum circuits and random circuit sampling (RCS) have recently garnered
tremendous attention from all sub-fields of the quantum information community, especially …

Computational complexity theory is usually phrased in terms of decision problems and
Boolean functions, whose inputs and outputs are purely classical. However, many quantum …

A foundational question in quantum computational complexity asks how much more useful a
quantum state can be in a given task than a comparable, classical string. Aaronson and …

We introduce the problem of unitarization. Unitarization is the problem of taking $ k $ input
quantum circuits that produce orthogonal states from the all $0 $ state, and create an output …