Quantum random sampling is the leading proposal for demonstrating a computational
advantage of quantum computers over classical computers. Recently the first large-scale …

Quantum mechanics, the subfield of physics that describes the behavior of very small
(quantum) particles, provides the basis for a new paradigm of computing. First proposed in …

Abstract Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near
future. Quantum computers with 50-100 qubits may be able to perform tasks which surpass …

We present the first protocol allowing a classical computer to interactively verify the result of
an efficient quantum computation. We achieve this by constructing a measurement protocol …

The ability to perform measurements in the middle of a quantum circuit is a powerful
resource. It underlies a wide range of applications, from remote state preparation to quantum …

We show the following hold, unconditionally unless otherwise stated, relative to a random
oracle:—There are NP search problems solvable by quantum polynomial-time (QPT) …

We present the first leveled fully homomorphic encryption scheme for quantum circuits with
classical keys. The scheme allows a classical client to blindly delegate a quantum …

Existing experimental demonstrations of quantum computational advantage have had the
limitation that verifying the correctness of the quantum device requires exponentially costly …

Public key quantum money can be seen as a version of the quantum no-cloning theorem
that holds even when the quantum states can be verified by the adversary. In this work, we …

MiniQCrypt is a world where quantum-secure one-way functions exist, and quantum
communication is possible. We construct an oblivious transfer (OT) protocol in MiniQCrypt …