Talk by Anne Broadbent from the University of Ottawa: How to Verify a Quantum Computation
This talk will not assume any prior knowledge of quantum information
Sponsored by the College of Arts and Science Department of Mathematics and Statistics and the Pacific Institute for Mathematical Sciences (PIMS)
Speaker: Prof. Anne Broadbent, University Chair in Quantum Information Processing at the University of Ottawa
Date/Time: Thursday, July 12, 2 p.m.
Location: ARTS 202
Title: How to Verify a Quantum Computation
Summary: Experimental implementations of quantum computers are in their infancy, but already we are faced with the following conundrum: if quantum computers are exponentially more powerful than their classical counterparts, how can we verify the outcome of a quantum computation? In this context, the scientific method of "predict and verify" appears to fail dramatically: these computations are so complex that they are impossible to predict. For a solution to this problem, we turn to theoretical computer science, where it is well established that interaction dramatically increases the power of a verification process.