University of Cambridge > Talks.cam > CQIF Seminar > Randomized benchmarking on the Clifford group and beyond

Randomized benchmarking on the Clifford group and beyond

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

If you have a question about this talk, please contact Sergii Strelchuk.

In this talk I will give an introduction to randomized benchmarking, a standard experimental technique in quantum computing. I will review the reasons for its existence and the functioning of its standard ‘Clifford group’ version from a representation theoretical angle. Using this representation theory perspective one can see that randomized benchmarking can be generalized to arbitrary finite groups. I will show how to do this in a principled manner and discuss some issues that appear. Finally, if there is time, I will try to give a hint of how the powerful machinery of harmonic analysis can be applied to guarantee the correct functioning of randomized benchmarking under very broad experimental conditions.

This talk is part of the CQIF Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2020 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity