Abstract
This talk will focus on a commitment protocol in which a classical string serves as a commitment to an exponentially complex quantum state. As in classical cryptography, commitment schemes are quite useful - in this case, this commitment protocol can be used to classically verify quantum computations. I will discuss both the construction and soundness of this primitive, which is based on the quantum hardness of the learning with errors problem.