COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > CQIF Seminar > Randomized benchmarking on the Clifford group and beyond
Randomized benchmarking on the Clifford group and beyondAdd 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. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsImpact Stokes Society, Pembroke College bld31Other talksCANCELLED: Rethinking Medicine Non-convex Optimisation Using the Polyak-Ćojasiewicz Inequality St Catharine's Political Economy Seminar Series - Richard Lewney 'Policies to promote low-carbon technological development' Developing a Text Editor to Help Writers with Academic English Collocations Plant Sciences Departmental Seminar |