University of Cambridge > Talks.cam > CQIF Seminar > Approximate randomized benchmarking for finite groups

Approximate randomized benchmarking for finite groups

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

If you have a question about this talk, please contact Johannes Bausch.

We investigate randomized benchmarking in a general setting with quantum gates that form a representation, not necessarily an irreducible one, of a finite group. We derive an estimate for the average fidelity, to which experimental data may then be calibrated. The number of parameters that we need to fit is closely related to the structure of quantum channels that are covariant w.r.t. the representation at hand. Therefore, we also discuss how results on the structure of covariant channels can be used to improve randomized benchmarking protocols. Furthermore, we establish that randomized benchmarking can be achieved by the sole implementation of quantum gates that generate the group as well as one additional arbitrary group element if the quantum channel that describes the noise was close to a covariant channel. The efficiency of this protocol depends on mixing times of random walks on the group and we also briefly discuss how new results in this direction could improve our protocol.

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