Dissertation talk: Classical delegation and verification of quantum computations

Seminar | April 30 | 4-5 p.m. | 540AB Cory Hall

 Urmila Mahadev

 Electrical Engineering and Computer Sciences (EECS)

Due to recent advances in quantum computing, two related open questions have become increasingly important. First, can a classical computer delegate a quantum computation without compromising privacy? Next, is it possible for a classical computer to verify the result of a quantum computation? In this talk, we present methods allowing a classical computer to achieve both of these cryptographic tasks, relying on the assumption of the hardness of the learning with errors problem. While we use entirely different techniques to construct both of these protocols, they use the same underlying cryptographic primitive of trapdoor claw-free functions.