======================================================================
Tuesday September 17, 2019, 10:30, CAB H53
======================================================================
Speaker:   Alexandru  Gheorghiu
Title:     Computationally-secure and composable remote quantum state preparation
Duration:  45 minutes
======================================================================

Abstract
--------
Quantum computers are expected to efficiently solve certain problems
that are believed to be computationally intractable to classical
computers. This raises the question: how can classical users
efficiently verify the results produced by quantum computers? In this
talk I will present a protocol between a classical polynomial-time
verifier and a quantum polynomial-time prover that allows the verifier
to securely delegate to the prover the preparation of certain quantum
states. Throughout the protocol, the prover remains oblivious as to
which state it was instructed to prepare. I will then show how this
remote state preparation primitive can be used by the verifier to
delegate general quantum computations to the prover and verify their
results.

The talk is based on joint work with Thomas Vidick:
https://arxiv.org/abs/1904.06320