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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Randomized benchmarking on the Clifford group and beyond

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 lists

Cambridge University Engineering Department, Trumpington Street, Cambridge CB2 1PZ https://us06web.zoom.us/j/81119667575?pwd=bXNQVzBXR2p3NXRDWDVVamFQa2JJdz09 Average on Saturdays: 7851.54 kWh

Other talks

Group Work Topic Film, TV shows for Medical Education, ‘The Wire’ as a case study Coming soon Tea and Coffee Break Title to be confirmed Online Causal Inference Seminar
 

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