Can you trust a quantum computer?

Add to your list(s) Download to your calendar using vCal

• Dr. Joe Fitzsimons, University of Oxford
• Friday 29 January 2010, 14:00-15:00
• Physics East 217.

If you have a question about this talk, please contact Elizabeth Blackburn.

As quantum computers grow in size and complexity, it becomes prohibitively slow to verify the correct operation of the device through process tomography. How can we trust the output of such a system if we cannot fully test it? In this talk I will provide an introduction to universal blind quantum computation, a cryptographic protocol that can be used to guarantee the correct functioning of a quantum computer even if it is interfered with by a malicious party. Blind quantum computation refers to the problem of allowing Alice to have Bob carry out a quantum computation for her such that Bob learns nothing about the computation that he performs. I will introduce a protocol for performing secure blind computation and show that it allows any quantum computation to be checked by a classical verifier given two non-communicating quantum provers, or by a semi-classical verifier using only a single quantum prover. Our protocol exploits techniques of measurement based computation and fault-tolerance to achieve its functionality, and so I will incorporate into the talk a brief introduction to each of these fields. Based on joint work with Anne Broadbent and Elham Kashefi.

This talk is part of the Condensed Matter Physics Seminars series.

This talk is included in these lists:

• Bham Talks
• Cond. Mat. seminar
• Condensed Matter Physics Seminars
• Physics East 217
• What's on in Physics?

Note that ex-directory lists are not shown.