Urmila Mahadev from Berkeley will talk about her recent breakthrough.
title: Classical Verification of Quantum Computations.
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 ensure that the quantum prover holds an n qubit
quantum state, and correctly reports the results of measuring it in a basis
of the verifier's choice. This is enforced based on the assumption that the
learning with errors problem is computationally intractable for efficient
quantum machines.
The talk will be an informal blackboard talk that will focus on the
technical details and will not dwell on the motivation and broader context.
_______________________________________________
qip mailing list
qip(a)mit.edu
http://mailman.mit.edu/mailman/listinfo/qip