In the classical model of computation, it is well established that one-way functions (OWF) are
minimal for computational cryptography: They are essential for almost any cryptographic …

The Unitary Synthesis Problem (Aaronson-Kuperberg 2007) asks whether any n-qubit
unitary U can be implemented by an efficient quantum algorithm A augmented with an …

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 …

Formulating cryptographic definitions to protect against software piracy is an important
research direction that has not received much attention. Since natural definitions using …

Given a renormalization scheme, we show how to formulate a tractable convex relaxation of
the set of feasible local density matrices of a many-body quantum system. The relaxation is …

What does it mean to commit to a quantum state? In this work, we propose a simple answer:
a commitment to quantum messages is binding if, after the commit phase, the committed …

Quantum pseudorandom state generators (PRSG s) have stimulated exciting developments
in recent years. A PRSG, on a fixed initial (eg, all-zero) state, produces an output state that is …

In a recent breakthrough, Mahadev constructed an interactive protocol that enables a purely
classical party to delegate any quantum computation to an untrusted quantum prover. We …

Finding the ground-state energy of electrons subject to an external electric field is a
fundamental problem in computational chemistry. While the theory of QMA-completeness …

We construct a constant-round zero-knowledge classical argument for NP secure against
quantum attacks. We assume the existence of Quantum Fully-Homomorphic Encryption and …