Urmila Mahadev: Classical Verification of Quantam Computation

Speaker: Urmila Mahadev

Date: Tuesday, October 23, 2018

Time: 4:00 PM to 5:00 PM

Refreshments: 12:00 AM

Public: Yes

Location: Patil/Kiva G449

Event Type: Seminar

Room Description:

Host: Aleksander Madry and Vinod Vaikuntanathan

Contact: Deborah Goodwin, 617.324.7303, dlehto@csail.mit.edu

Relevant URL:

Speaker URL: None

Speaker Photo:

Reminders to: seminars@csail.mit.edu, theory-seminars@csail.mit.edu

Reminder Subject: TALK: Urmila Mahadev: Classical Verification of Quantam Computation

Abstract: 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, which enables a classical verifier to use a quantum prover as a trusted measurement device. The protocol forces the prover to behave as follows: the prover must construct an n qubit state of his choice, measure each qubit in the Hadamard or standard basis as directed by the verifier, and report the measurement results to the verifier. The soundness of this protocol is enforced based on the assumption that the learning with errors problem is computationally intractable for efficient quantum machines.

Research Areas:

Impact Areas:

See other events that are part of the Theory of Computation (TOC) 2018.

Created by Deborah Goodwin Email at Friday, September 07, 2018 at 3:01 PM.