Abstract

One of the fundamental questions in quantum information processing is the verification. Can we efficiently test the validity of quantum mechanics in the regime of exponential-dimension Hilbert Space? Can we efficiently verify using only classical devices – a given quantum technology? The answer is almost yes !

We show that any quantum computation has an interactive proof with two entangled quantum provers and a completely classical verifier and also a single prover with a nearly classical verifier. These results are based on the recently proposed Universal Blind Quantum Computing Protocol (Broadbent, Fitzsimons and Kashefi, FOCS 2009 ).

Dr Elham Kashefi’s current research interests include: formalising physical computations, classical cryptography secure against quantum attacks, models of quantum computing and their structural relations, and exploring new applications, algorithms and protocols for quantum computing.

She was then awarded a four-year junior research fellowship at Christ Church College, Oxford to work on foundational structures for quantum information and computation. During this period she spent 2005 in Canada as a post doctoral fellow at the Institute for Quantum Computing, University of Waterloo, to work on depth complexity and parallel computing. From March 2006 until 2007 she was a visiting scientist at MIT , in the Department of Theoretical Physics, exploring the connection between measurement-based models, adiabatic and topological quantum computing.

Elham has recently been awarded a five-year EPSRC Advanced Research Fellowship, which she will hold at Edinburgh, to allow her to focus on measurement-based quantum computing and its relation to other quantum models.

Followed by a wine reception. 2 pounds entry / FREE for members