Taming quantum computation with cryptography

Thu 29Apr2021
Since June 2016 you need to have a valid API key enabled to display Google maps, see plugin settings

Alexandru Gheorghiu, ETH Zürich

From 12:30 until 13:30

At Zoom: https://ethz.zoom.us/j/62712763210

https://ethz.zoom.us/j/62712763210

Abstract:

Quantum computers are expected to provide efficient solutions to problems that are conjectured to be intractable for classical computers (such as the simulation of quantum physical system). This raises the following question: can a classical computer efficiently verify the results of a quantum computation? In 2018, Urmila Mahadev answered this question in the affirmative by giving the first such verification protocol. Mahadev's protocol relies on the conjectured intractability of the Learning With Errors problem for quantum computers. In this talk, I'll outline the main ideas behind Mahadev's protocol and discuss how it relates to my own work on verifying existing quantum devices. I won't be assuming any prior knowledge about quantum computation.

Join the Zoom meeting at 12:30 on Thursday, April 29th: https://ethz.zoom.us/j/62712763210

Download Event to Calendar