Efficient proofs of quantumness for near-term devices

Seminar by Alexandru Gheorghiu, Junior Research Fellow at the Institute for Theoretical Studies of ETH Zürich
Alexandru will visit 23rd and 24th of September. Please contact Giulia Ferrini in case you wish to discuss with him.

Abstract: Groups at Google and USTC recently showed that small-scale quantum computers can outperform classical computers at specific tasks. Unfortunately, checking the results of these experiments takes exponential time and so is inefficient. Quantum computations for which the results can be verified efficiently are known (called proofs of quantumness), but these usually require circuits of high depth which are not suitable for noisy, near-term devices.
In this talk, I present some recent results that aim to bridge the gap between these two extremes. Specifically, I'll outline how one can design proofs of quantumness that only require circuits of constant quantum depth. I will also discuss a recent proof-of-principle demonstration on an ion quantum computer. Lastly, I'll talk about some of the open problems concerning proofs of quantumness and how these relate to interesting questions in complexity theory.
The talk will be mainly based around these results:
We have booked Kollektorn (which has a capacity limited to 40 people) but we will also broadcast the seminar online:
Password: 8h811s
Category Seminar
Location: Online and in Kollektorn
Starts: 23 September, 2021, 11:00
Ends: 23 September, 2021, 12:00

Page manager Published: Wed 01 Sep 2021.